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

Theorem hbsbcgdOLD 2518
Description: Deduction version of hbsbcg 2466.
Hypotheses
Ref Expression
hbsbcgd.1 |- (ph -> A.xph)
hbsbcgd.2 |- (ph -> A.yph)
hbsbcgd.3 |- (ph -> (z e. A -> A.x z e. A))
hbsbcgd.4 |- (ph -> (ps -> A.xps))
Assertion
Ref Expression
hbsbcgdOLD |- ((ph /\ A e. C) -> ([A / y]ps -> A.x[A / y]ps))
Distinct variable groups:   z,A   ph,z   x,z

Proof of Theorem hbsbcgdOLD
StepHypRef Expression
1 ax-4 1319 . . . . . . . . 9 |- (A.x z e. A -> z e. A)
2 hbsbcgd.3 . . . . . . . . 9 |- (ph -> (z e. A -> A.x z e. A))
31, 2impbid2 576 . . . . . . . 8 |- (ph -> (A.x z e. A <-> z e. A))
43abbidv 2008 . . . . . . 7 |- (ph -> {z | A.x z e. A} = {z | z e. A})
5 eleq1 1957 . . . . . . . . 9 |- (z = w -> (z e. A <-> w e. A))
65albidv 1656 . . . . . . . 8 |- (z = w -> (A.x z e. A <-> A.x w e. A))
76cbvabv 2420 . . . . . . 7 |- {z | A.x z e. A} = {w | A.x w e. A}
8 abid2 2011 . . . . . . 7 |- {z | z e. A} = A
94, 7, 83eqtr3g 1952 . . . . . 6 |- (ph -> {w | A.x w e. A} = A)
109eleq1d 1963 . . . . 5 |- (ph -> ({w | A.x w e. A} e. _V <-> A e. _V))
1110biimpar 461 . . . 4 |- ((ph /\ A e. _V) -> {w | A.x w e. A} e. _V)
12 hba1 1350 . . . . . 6 |- (A.x w e. A -> A.xA.x w e. A)
1312hbab 1875 . . . . 5 |- (z e. {w | A.x w e. A} -> A.x z e. {w | A.x w e. A})
14 hba1 1350 . . . . 5 |- (A.xps -> A.xA.xps)
1513, 14hbsbcg 2466 . . . 4 |- ({w | A.x w e. A} e. _V -> ([{w | A.x w e. A} / y]A.xps -> A.x[{w | A.x w e. A} / y]A.xps))
1611, 15syl 12 . . 3 |- ((ph /\ A e. _V) -> ([{w | A.x w e. A} / y]A.xps -> A.x[{w | A.x w e. A} / y]A.xps))
17219.21aiv 1664 . . . . . 6 |- (ph -> A.z(z e. A -> A.x z e. A))
18 abidhb 2423 . . . . . 6 |- (A.z(z e. A -> A.x z e. A) -> {w | A.x w e. A} = A)
19 dfsbcq 2455 . . . . . 6 |- ({w | A.x w e. A} = A -> ([{w | A.x w e. A} / y]A.xps <-> [A / y]A.xps))
2017, 18, 193syl 24 . . . . 5 |- (ph -> ([{w | A.x w e. A} / y]A.xps <-> [A / y]A.xps))
2120adantr 425 . . . 4 |- ((ph /\ A e. _V) -> ([{w | A.x w e. A} / y]A.xps <-> [A / y]A.xps))
22 hbsbcgd.2 . . . . 5 |- (ph -> A.yph)
23 ax-4 1319 . . . . . 6 |- (A.xps -> ps)
24 hbsbcgd.4 . . . . . 6 |- (ph -> (ps -> A.xps))
2523, 24impbid2 576 . . . . 5 |- (ph -> (A.xps <-> ps))
2622, 25sbcbid 2504 . . . 4 |- ((ph /\ A e. _V) -> ([A / y]A.xps <-> [A / y]ps))
2721, 26bitrd 587 . . 3 |- ((ph /\ A e. _V) -> ([{w | A.x w e. A} / y]A.xps <-> [A / y]ps))
28 hbsbcgd.1 . . . . . . 7 |- (ph -> A.xph)
2928a1d 15 . . . . . 6 |- (ph -> (ph -> A.xph))
30 ax-17 1317 . . . . . . . 8 |- (z e. _V -> A.x z e. _V)
3130a1i 8 . . . . . . 7 |- (ph -> (z e. _V -> A.x z e. _V))
3228, 2, 31hbeld 2425 . . . . . 6 |- (ph -> (A e. _V -> A.x A e. _V))
3329, 32hband 1469 . . . . 5 |- (ph -> ((ph /\ A e. _V) -> A.x(ph /\ A e. _V)))
3433anabsi5 553 . . . 4 |- ((ph /\ A e. _V) -> A.x(ph /\ A e. _V))
3534, 27albid 1459 . . 3 |- ((ph /\ A e. _V) -> (A.x[{w | A.x w e. A} / y]A.xps <-> A.x[A / y]ps))
3616, 27, 353imtr3d 601 . 2 |- ((ph /\ A e. _V) -> ([A / y]ps -> A.x[A / y]ps))
37 elisset 2299 . 2 |- (A e. C -> A e. _V)
3836, 37sylan2 500 1 |- ((ph /\ A e. C) -> ([A / y]ps -> A.x[A / y]ps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240  A.wal 1296   = wceq 1298   e. wcel 1300  [wsbc 1534  {cab 1871  _Vcvv 2292
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-5 1302  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-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-v 2294  df-sbc 2454
Copyright terms: Public domain