HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem acdc5 7443
Description: A more general version of acdc 7445 that has an initial value and where the function F depends on k.
Hypothesis
Ref Expression
acdc5.1 |- A e. V
Assertion
Ref Expression
acdc5 |- ((F:(NN X. A)-->(P~A \ {(/)}) /\ C e. A) -> E.g(g:NN-->A /\ (g` 1) = C /\ A.k e. NN (g` (k + 1)) e. ((k + 1)F(g` k))))
Distinct variable groups:   g,k,A   g,F,k   C,g

Proof of Theorem acdc5
StepHypRef Expression
1 eqeq2 1481 . . . . . 6 |- (c = C -> ((g` 1) = c <-> (g` 1) = C))
213anbi2d 896 . . . . 5 |- (c = C -> ((g:NN-->A /\ (g` 1) = c /\ A.k e. NN (g` (k + 1)) e. ((k + 1)F(g` k))) <-> (g:NN-->A /\ (g` 1) = C /\ A.k e. NN (g` (k + 1)) e. ((k + 1)F(g` k)))))
32exbidv 1277 . . . 4 |- (c = C -> (E.g(g:NN-->A /\ (g` 1) = c /\ A.k e. NN (g` (k + 1)) e. ((k + 1)F(g` k))) <-> E.g(g:NN-->A /\ (g` 1) = C /\ A.k e. NN (g` (k + 1)) e. ((k + 1)F(g` k)))))
43imbi2d 611 . . 3 |- (c = C -> ((F:(NN X. A)-->(P~A \ {(/)}) -> E.g(g:NN-->A /\ (g` 1) = c /\ A.k e. NN (g` (k + 1)) e. ((k + 1)F(g` k)))) <-> (F:(NN X. A)-->(P~A \ {(/)}) -> E.g(g:NN-->A /\ (g` 1) = C /\ A.k e. NN (g` (k + 1)) e. ((k + 1)F(g` k))))))
5 acdc5.1 . . . . 5 |- A e. V
65weth 4767 . . . 4 |- E.r r We A
7 eleq1 1531 . . . . . . . . . . . 12 |- (a = x -> (a e. A <-> x e. A))
8 eleq1 1531 . . . . . . . . . . . 12 |- (b = y -> (b e. NN <-> y e. NN))
97, 8bi2anan9 631 . . . . . . . . . . 11 |- ((a = x /\ b = y) -> ((a e. A /\ b e. NN) <-> (x e. A /\ y e. NN)))
10 opreq12 3961 . . . . . . . . . . . . . . . 16 |- ((b = y /\ a = x) -> (bFa) = (yFx))
1110ancoms 436 . . . . . . . . . . . . . . 15 |- ((a = x /\ b = y) -> (bFa) = (yFx))
12 rabeq 1805 . . . . . . . . . . . . . . . 16 |- ((bFa) = (yFx) -> {f e. (bFa) | A.h e. (bFa) -. hrf} = {f e. (yFx) | A.h e. (bFa) -. hrf})
13 raleq1 1783 . . . . . . . . . . . . . . . . 17 |- ((bFa) = (yFx) -> (A.h e. (bFa) -. hrf <-> A.h e. (yFx) -. hrf))
1413rabbisdv 1803 . . . . . . . . . . . . . . . 16 |- ((bFa) = (yFx) -> {f e. (yFx) | A.h e. (bFa) -. hrf} = {f e. (yFx) | A.h e. (yFx) -. hrf})
1512, 14eqtrd 1504 . . . . . . . . . . . . . . 15 |- ((bFa) = (yFx) -> {f e. (bFa) | A.h e. (bFa) -. hrf} = {f e. (yFx) | A.h e. (yFx) -. hrf})
1611, 15syl 10 . . . . . . . . . . . . . 14 |- ((a = x /\ b = y) -> {f e. (bFa) | A.h e. (bFa) -. hrf} = {f e. (yFx) | A.h e. (yFx) -. hrf})
17 breq2 2618 . . . . . . . . . . . . . . . . . 18 |- (f = v -> (hrf <-> hrv))
1817negbid 610 . . . . . . . . . . . . . . . . 17 |- (f = v -> (-. hrf <-> -. hrv))
1918ralbidv 1660 . . . . . . . . . . . . . . . 16 |- (f = v -> (A.h e. (yFx) -. hrf <-> A.h e. (yFx) -. hrv))
20 breq1 2617 . . . . . . . . . . . . . . . . . 18 |- (h = u -> (hrv <-> urv))
2120negbid 610 . . . . . . . . . . . . . . . . 17 |- (h = u -> (-. hrv <-> -. urv))
2221cbvralv 1796 . . . . . . . . . . . . . . . 16 |- (A.h e. (yFx) -. hrv <-> A.u e. (yFx) -. urv)
2319, 22syl6bb 535 . . . . . . . . . . . . . . 15 |- (f = v -> (A.h e. (yFx) -. hrf <-> A.u e. (yFx) -. urv))
2423cbvrabv 1907 . . . . . . . . . . . . . 14 |- {f e. (yFx) | A.h e. (yFx) -. hrf} = {v e. (yFx) | A.u e. (yFx) -. urv}
2516, 24syl6eq 1520 . . . . . . . . . . . . 13 |- ((a = x /\ b = y) -> {f e. (bFa) | A.h e. (bFa) -. hrf} = {v e. (yFx) | A.u e. (yFx) -. urv})
2625unieqd 2507 . . . . . . . . . . . 12 |- ((a = x /\ b = y) -> U.{f e. (bFa) | A.h e. (bFa) -. hrf} = U.{v e. (yFx) | A.u e. (yFx) -. urv})
2726eqeq2d 1483 . . . . . . . . . . 11 |- ((a = x /\ b = y) -> (d = U.{f e. (bFa) | A.h e. (bFa) -. hrf} <-> d = U.{v e. (yFx) | A.u e. (yFx) -. urv}))
289, 27anbi12d 627 . . . . . . . . . 10 |- ((a = x /\ b = y) -> (((a e. A /\ b e. NN) /\ d = U.{f e. (bFa) | A.h e. (bFa) -. hrf}) <-> ((x e. A /\ y e. NN) /\ d = U.{v e. (yFx) | A.u e. (yFx) -. urv})))
2928cbvoprab12v 3990 . . . . . . . . 9 |- {<.<.a, b>., d>. | ((a e. A /\ b e. NN) /\ d = U.{f e. (bFa) | A.h e. (bFa) -. hrf})} = {<.<.x, y>., d>. | ((x e. A /\ y e. NN) /\ d = U.{v e. (yFx) | A.u e. (yFx) -. urv})}
30 eqeq1 1478 . . . . . . . . . . 11 |- (d = z -> (d = U.{v e. (yFx) | A.u e. (yFx) -. urv} <-> z = U.{v e. (yFx) | A.u e. (yFx) -. urv}))
3130anbi2d 615 . . . . . . . . . 10 |- (d = z -> (((x e. A /\ y e. NN) /\ d = U.{v e. (yFx) | A.u e. (yFx) -. urv}) <-> ((x e. A /\ y e. NN) /\ z = U.{v e. (yFx) | A.u e. (yFx) -. urv})))
3231cbvoprab3v 3991 . . . . . . . . 9 |- {<.<.x, y>., d>. | ((x e. A /\ y e. NN) /\ d = U.{v e. (yFx) | A.u e. (yFx) -. urv})} = {<.<.x, y>., z>. | ((x e. A /\ y e. NN) /\ z = U.{v e. (yFx) | A.u e. (yFx) -. urv})}
3329, 32eqtr 1492 . . . . . . . 8 |- {<.<.a, b>., d>. | ((a e. A /\ b e. NN) /\ d = U.{f e. (bFa) | A.h e. (bFa) -. hrf})} = {<.<.x, y>., z>. | ((x e. A /\ y e. NN) /\ z = U.{v e. (yFx) | A.u e. (yFx) -. urv})}
34 eqid 1473 . . . . . . . 8 |- ({<.<.a, b>., d>. | ((a e. A /\ b e. NN) /\ d = U.{f e. (bFa) | A.h e. (bFa) -. hrf})} seq1 ({<.1, c>.} u. (I |` (NN \ {1})))) = ({<.<.a, b>., d>. | ((a e. A /\ b e. NN) /\ d = U.{f e. (bFa) | A.h e. (bFa) -. hrf})} seq1 ({<.1, c>.} u. (I |` (NN \ {1}))))
355, 33, 34acdc5lem2 7442 . . . . . . 7 |- ((r We A /\ (c e. A /\ F:(NN X. A)-->(P~A \ {(/)}))) -> (({<.<.a, b>., d>. | ((a e. A /\ b e. NN) /\ d = U.{f e. (bFa) | A.h e. (bFa) -. hrf})} seq1 ({<.1, c>.} u. (I |` (NN \ {1})))):NN-->A /\ (({<.<.a, b>., d>. | ((a e. A /\ b e. NN) /\ d = U.{f e. (bFa) | A.h e. (bFa) -. hrf})} seq1 ({<.1, c>.} u. (I |` (NN \ {1}))))` 1) = c /\