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

Theorem sbcel12g 1982
Description: Distribute proper substitution through a membership relation.
Assertion
Ref Expression
sbcel12g |- (A e. D -> ([A / x]B e. C <-> [_A / x]_B e. [_A / x]_C))

Proof of Theorem sbcel12g
StepHypRef Expression
1 elisset 1792 . . 3 |- (A e. D -> A e. V)
2 sbcexg 1946 . . . . 5 |- (A e. V -> ([A / x]E.z(z = B /\ z e. C) <-> E.z[A / x](z = B /\ z e. C)))
3 df-clel 1449 . . . . . 6 |- (B e. C <-> E.z(z = B /\ z e. C))
43sbcbii 1949 . . . . 5 |- (A e. V -> ([A / x]B e. C <-> [A / x]E.z(z = B /\ z e. C)))
5 dfcleq 1447 . . . . . . . . . . 11 |- (z = B <-> A.y(y e. z <-> y e. B))
65sbcbii 1949 . . . . . . . . . 10 |- (A e. V -> ([A / x]z = B <-> [A / x]A.y(y e. z <-> y e. B)))
7 sbcalg 1945 . . . . . . . . . 10 |- (A e. V -> ([A / x]A.y(y e. z <-> y e. B) <-> A.y[A / x](y e. z <-> y e. B)))
8 sbcbidig 1944 . . . . . . . . . . . 12 |- (A e. V -> ([A / x](y e. z <-> y e. B) <-> ([A / x]y e. z <-> [A / x]y e. B)))
9 ax-17 1190 . . . . . . . . . . . . . 14 |- (y e. z -> A.x y e. z)
109sbcgf 1957 . . . . . . . . . . . . 13 |- (A e. V -> ([A / x]y e. z <-> y e. z))
1110bibi1d 617 . . . . . . . . . . . 12 |- (A e. V -> (([A / x]y e. z <-> [A / x]y e. B) <-> (y e. z <-> [A / x]y e. B)))
128, 11bitrd 526 . . . . . . . . . . 11 |- (A e. V -> ([A / x](y e. z <-> y e. B) <-> (y e. z <-> [A / x]y e. B)))
1312albidv 1260 . . . . . . . . . 10 |- (A e. V -> (A.y[A / x](y e. z <-> y e. B) <-> A.y(y e. z <-> [A / x]y e. B)))
146, 7, 133bitrd 542 . . . . . . . . 9 |- (A e. V -> ([A / x]z = B <-> A.y(y e. z <-> [A / x]y e. B)))
15 abeq2 1544 . . . . . . . . 9 |- (z = {y | [A / x]y e. B} <-> A.y(y e. z <-> [A / x]y e. B))
1614, 15syl6rbbr 537 . . . . . . . 8 |- (A e. V -> (z = {y | [A / x]y e. B} <-> [A / x]z = B))
17 eleq1 1510 . . . . . . . . . . . 12 |- (y = z -> (y e. C <-> z e. C))
1817sbcbidv 1948 . . . . . . . . . . 11 |- ((y = z /\ A e. V) -> ([A / x]y e. C <-> [A / x]z e. C))
1918expcom 374 . . . . . . . . . 10 |- (A e. V -> (y = z -> ([A / x]y e. C <-> [A / x]z e. C)))
201919.21aiv 1268 . . . . . . . . 9 |- (A e. V -> A.y(y = z -> ([A / x]y e. C <-> [A / x]z e. C)))
21 visset 1788 . . . . . . . . . 10 |- z e. V
22 elabgt 1867 . . . . . . . . . 10 |- ((z e. V /\ A.y(y = z -> ([A / x]y e. C <-> [A / x]z e. C))) -> (z e. {y | [A / x]y e. C} <-> [A / x]z e. C))
2321, 22mpan 692 . . . . . . . . 9 |- (A.y(y = z -> ([A / x]y e. C <-> [A / x]z e. C)) -> (z e. {y | [A / x]y e. C} <-> [A / x]z e. C))
2420, 23syl 10 . . . . . . . 8 |- (A e. V -> (z e. {y | [A / x]y e. C} <-> [A / x]z e. C))
2516, 24anbi12d 626 . . . . . . 7 |- (A e. V -> ((z = {y | [A / x]y e. B} /\ z e. {y | [A / x]y e. C}) <-> ([A / x]z = B /\ [A / x]z e. C)))
26 sbcang 1942 . . . . . . 7 |- (A e. V -> ([A / x](z = B /\ z e. C) <-> ([A / x]z = B /\ [A / x]z e. C)))
2725, 26bitr4d 529 . . . . . 6 |- (A e. V -> ((z = {y | [A / x]y e. B} /\ z e. {y | [A / x]y e. C}) <-> [A / x](z = B /\ z e. C)))
2827exbidv 1261 . . . . 5 |- (A e. V -> (E.z(z = {y | [A / x]y e. B} /\ z e. {y | [A / x]y e. C}) <-> E.z[A / x](z = B /\ z e. C)))
292, 4, 283bitr4d 548 . . . 4 |- (A e. V -> ([A / x]B e. C <-> E.z(z = {y | [A / x]y e. B} /\ z e. {y | [A / x]y e. C})))
30 df-clel 1449 . . . 4 |- ({y | [A / x]y e. B} e. {y | [A / x]y e. C} <-> E.z(z = {y | [A / x]y e. B} /\ z e. {y | [A / x]y e. C}))
3129, 30syl6bbr 536 . . 3 |- (A e. V -> ([A / x]B e. C <-> {y | [A / x]y e. B} e. {y | [A / x]y e. C}))
321, 31syl 10 . 2 |- (A e. D -> ([A / x]B e. C <-> {y | [A / x]y e. B} e. {y | [A / x]y e. C}))
33 df-csb 1973 . . 3 |- [_A / x]_B = {y | [A / x]y e. B}
34 df-csb 1973 . . 3 |- [_A / x]_C = {y | [A / x]y e. C}
3533, 34eleq12i 1515 . 2 |- ([_A / x]_B e. [_A / x]_C <-> {y | [A / x]y e. B} e. {y | [A / x]y e. C})
3632, 35syl6bbr 536 1 |- (A e. D -> ([A / x]B e. C <-> [_A / x]_B e. [_A / x]_C))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 950  E.wex 956   = wceq 1099   e. wcel 1105  [wsbc 1153  {cab 1440  Vcvv 1786  [_csb 1972
This theorem is referenced by:  sbcel1g 1984  sbcel2g 1986  sbccsb2g 1994  sbcnestg 2009
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-10 1103  ax-12 1104  ax-11 1180  ax-17 1190  ax-16 1194  ax-11o 1202  ax-ext 1436
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 774  df-ex 957  df-sb 1155  df-clab 1441  df-cleq 1446  df-clel 1449  df-v 1787  df-sbc 1913  df-csb 1973
Copyright terms: Public domain