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

Theorem sbabel 1560
Description: Theorem to move a substitution in and out of a class abstraction.
Hypothesis
Ref Expression
sbabel.1 |- (w e. A -> A.x w e. A)
Assertion
Ref Expression
sbabel |- ([y / x]{z | ph} e. A <-> {z | [y / x]ph} e. A)
Distinct variable groups:   w,A   x,w   x,z   y,z

Proof of Theorem sbabel
StepHypRef Expression
1 sbex 1330 . . 3 |- ([y / x]E.v(v = {z | ph} /\ v e. A) <-> E.v[y / x](v = {z | ph} /\ v e. A))
2 sban 1221 . . . . 5 |- ([y / x](v = {z | ph} /\ v e. A) <-> ([y / x]v = {z | ph} /\ [y / x]v e. A))
3 sbal 1329 . . . . . . . 8 |- ([y / x]A.z(z e. v <-> ph) <-> A.z[y / x](z e. v <-> ph))
4 ax-17 1190 . . . . . . . . . . 11 |- (z e. v -> A.x z e. v)
54sbf 1169 . . . . . . . . . 10 |- ([y / x]z e. v <-> z e. v)
65sbrbis 1225 . . . . . . . . 9 |- ([y / x](z e. v <-> ph) <-> (z e. v <-> [y / x]ph))
76albii 975 . . . . . . . 8 |- (A.z[y / x](z e. v <-> ph) <-> A.z(z e. v <-> [y / x]ph))
83, 7bitr 173 . . . . . . 7 |- ([y / x]A.z(z e. v <-> ph) <-> A.z(z e. v <-> [y / x]ph))
9 abeq2 1544 . . . . . . . 8 |- (v = {z | ph} <-> A.z(z e. v <-> ph))
109sbbii 1157 . . . . . . 7 |- ([y / x]v = {z | ph} <-> [y / x]A.z(z e. v <-> ph))
11 abeq2 1544 . . . . . . 7 |- (v = {z | [y / x]ph} <-> A.z(z e. v <-> [y / x]ph))
128, 10, 113bitr4 183 . . . . . 6 |- ([y / x]v = {z | ph} <-> v = {z | [y / x]ph})
13 ax-17 1190 . . . . . . . 8 |- (w e. v -> A.x w e. v)
14 sbabel.1 . . . . . . . 8 |- (w e. A -> A.x w e. A)
1513, 14hbel 1542 . . . . . . 7 |- (v e. A -> A.x v e. A)
1615sbf 1169 . . . . . 6 |- ([y / x]v e. A <-> v e. A)
1712, 16anbi12i 481 . . . . 5 |- (([y / x]v = {z | ph} /\ [y / x]v e. A) <-> (v = {z | [y / x]ph} /\ v e. A))
182, 17bitr 173 . . . 4 |- ([y / x](v = {z | ph} /\ v e. A) <-> (v = {z | [y / x]ph} /\ v e. A))
1918exbii 1027 . . 3 |- (E.v[y / x](v = {z | ph} /\ v e. A) <-> E.v(v = {z | [y / x]ph} /\ v e. A))
201, 19bitr 173 . 2 |- ([y / x]E.v(v = {z | ph} /\ v e. A) <-> E.v(v = {z | [y / x]ph} /\ v e. A))
21 df-clel 1449 . . 3 |- ({z | ph} e. A <-> E.v(v = {z | ph} /\ v e. A))
2221sbbii 1157 . 2 |- ([y / x]{z | ph} e. A <-> [y / x]E.v(v = {z | ph} /\ v e. A))
23 df-clel 1449 . 2 |- ({z | [y / x]ph} e. A <-> E.v(v = {z | [y / x]ph} /\ v e. A))
2420, 22, 233bitr4 183 1 |- ([y / x]{z | ph} e. A <-> {z | [y / x]ph} e. A)
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
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-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-ex 957  df-sb 1155  df-clab 1441  df-cleq 1446  df-clel 1449
Copyright terms: Public domain