Table of ContentsTable of Contents Mathbox for Jonathan Ben-Naim < Previous   Next >
Related theorems
Unicode version

Theorem bnj916 13332
Description: Technical lemma of bnj69 13455. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem).
Hypotheses
Ref Expression
bnj916.1 |- (ph <-> (f` (/)) = pred(X, A, R))
bnj916.2 |- (ps <-> A.i e. om (suc i e. n -> (f` suc i) = U_y e. (f` i) pred(y, A, R)))
bnj916.3 |- D = (om \ {(/)})
bnj916.4 |- B = {f | E.n e. D (f Fn n /\ ph /\ ps)}
bnj916.5 |- (ch <-> (f Fn n /\ ph /\ ps))
Assertion
Ref Expression
bnj916 |- (y e. trCl(X, A, R) -> E.fE.nE.i(n e. D /\ ch /\ i e. n /\ y e. (f` i)))
Distinct variable groups:   A,f,i,n,y   D,i   R,f,i,n,y   f,X,i,n,y   ph,i

Proof of Theorem bnj916
StepHypRef Expression
1 bnj916.1 . . . . . 6 |- (ph <-> (f` (/)) = pred(X, A, R))
2 bnj916.2 . . . . . 6 |- (ps <-> A.i e. om (suc i e. n -> (f` suc i) = U_y e. (f` i) pred(y, A, R)))
31, 2bnj911 13331 . . . . 5 |- ((f Fn n /\ ph /\ ps) -> A.i(f Fn n /\ ph /\ ps))
4 ax-17 1317 . . . . 5 |- (y e. (f` i) -> A.n y e. (f` i))
53, 4bnj912 12822 . . . 4 |- (E.nE.i(n e. D /\ (f Fn n /\ ph /\ ps) /\ i e. dom f /\ y e. (f` i)) <-> (E.n e. D (f Fn n /\ ph /\ ps) /\ E.i e. dom f y e. (f` i)))
65exbii 1398 . . 3 |- (E.fE.nE.i(n e. D /\ (f Fn n /\ ph /\ ps) /\ i e. dom f /\ y e. (f` i)) <-> E.f(E.n e. D (f Fn n /\ ph /\ ps) /\ E.i e. dom f y e. (f` i)))
7 bnj916.5 . . . . 5 |- (ch <-> (f Fn n /\ ph /\ ps))
87bnj913 12823 . . . 4 |- ((n e. D /\ ch /\ i e. dom f /\ y e. (f` i)) <-> (n e. D /\ (f Fn n /\ ph /\ ps) /\ i e. dom f /\ y e. (f` i)))
983exbii 1400 . . 3 |- (E.fE.nE.i(n e. D /\ ch /\ i e. dom f /\ y e. (f` i)) <-> E.fE.nE.i(n e. D /\ (f Fn n /\ ph /\ ps) /\ i e. dom f /\ y e. (f` i)))
10 bnj916.3 . . . . . . 7 |- D = (om \ {(/)})
11 bnj916.4 . . . . . . 7 |- B = {f | E.n e. D (f Fn n /\ ph /\ ps)}
121, 2, 10, 11bnj882 13320 . . . . . 6 |- trCl(X, A, R) = U_f e. B U_i e. dom f(f` i)
1312eleq2i 1961 . . . . 5 |- (y e. trCl(X, A, R) <-> y e. U_f e. B U_i e. dom f(f` i))
14 eliun 3259 . . . . 5 |- (y e. U_f e. B U_i e. dom f(f` i) <-> E.f e. B y e. U_i e. dom f(f` i))
15 eliun 3259 . . . . . 6 |- (y e. U_i e. dom f(f` i) <-> E.i e. dom f y e. (f` i))
1615rexbii 2128 . . . . 5 |- (E.f e. B y e. U_i e. dom f(f` i) <-> E.f e. B E.i e. dom f y e. (f` i))
1713, 14, 163bitri 194 . . . 4 |- (y e. trCl(X, A, R) <-> E.f e. B E.i e. dom f y e. (f` i))
18 df-rex 2110 . . . 4 |- (E.f e. B E.i e. dom f y e. (f` i) <-> E.f(f e. B /\ E.i e. dom f y e. (f` i)))
1911abeq2i 2001 . . . . . 6 |- (f e. B <-> E.n e. D (f Fn n /\ ph /\ ps))
2019anbi1i 539 . . . . 5 |- ((f e. B /\ E.i e. dom f y e. (f` i)) <-> (E.n e. D (f Fn n /\ ph /\ ps) /\ E.i e. dom f y e. (f` i)))
2120exbii 1398 . . . 4 |- (E.f(f e. B /\ E.i e. dom f y e. (f` i)) <-> E.f(E.n e. D (f Fn n /\ ph /\ ps) /\ E.i e. dom f y e. (f` i)))
2217, 18, 213bitri 194 . . 3 |- (y e. trCl(X, A, R) <-> E.f(E.n e. D (f Fn n /\ ph /\ ps) /\ E.i e. dom f y e. (f` i)))
236, 9, 223bitr4ri 201 . 2 |- (y e. trCl(X, A, R) <-> E.fE.nE.i(n e. D /\ ch /\ i e. dom f /\ y e. (f` i)))
24 bnj643 12578 . . . . 5 |- ((n e. D /\ ch /\ i e. dom f /\ y e. (f` i)) -> ch)
257bnj564 12542 . . . . . 6 |- (ch -> dom f = n)
26 eleq2 1958 . . . . . 6 |- (dom f = n -> (i e. dom f <-> i e. n))
27 bnj914 12824 . . . . . 6 |- ((i e. dom f <-> i e. n) -> ((n e. D /\ ch /\ i e. dom f /\ y e. (f` i)) <-> (n e. D /\ ch /\ i e. n /\ y e. (f` i))))
2825, 26, 273syl 24 . . . . 5 |- (ch -> ((n e. D /\ ch /\ i e. dom f /\ y e. (f` i)) <-> (n e. D /\ ch /\ i e. n /\ y e. (f` i))))
2924, 28bnj915 12825 . . . 4 |- ((n e. D /\ ch /\ i e. dom f /\ y e. (f` i)) -> (n e. D /\ ch /\ i e. n /\ y e. (f` i)))
30292eximi 1388 . . 3 |- (E.nE.i(n e. D /\ ch /\ i e. dom f /\ y e. (f` i)) -> E.nE.i(n e. D /\ ch /\ i e. n /\ y e. (f` i)))
3130eximi 1387 . 2 |- (E.fE.nE.i(n e. D /\ ch /\ i e. dom f /\ y e. (f` i)) -> E.fE.nE.i(n e. D /\ ch /\ i e. n /\ y e. (f` i)))
3223, 31sylbi 216 1 |- (y e. trCl(X, A, R) -> E.fE.nE.i(n e. D /\ ch /\ i e. n /\ y e. (f` i)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240   /\ w3a 858   = wceq 1298   e. wcel 1300  E.wex 1326  {cab 1871  A.wral 2105  E.wrex 2106   \ cdif 2590  (/)c0 2875  {csn 3044  U_ciun 3255  suc csuc 3659  omcom 3949  dom cdm 3986   Fn wfn 3993  ` cfv 3998   /\ syn-bnj17 12019   predsyn-bnj14 12023   trClsyn-bnj18 12029
This theorem is referenced by:  bnj917 13333
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ral 2109  df-rex 2110  df-v 2294  df-iun 3257  df-fn 4009  df-bnj17 12020  df-bnj18 12030
Copyright terms: Public domain