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

Theorem bnj48OLD 12423
Description: First-order logic and set theory.
Hypotheses
Ref Expression
bnj48.1 |- (ch <-> A.x e. A (ps -> ph))
bnj48.2 |- B C_ A
Assertion
Ref Expression
bnj48OLD |- ((ch /\ E.y e. B [y / x]ps) -> E.y e. B [y / x]ph)
Distinct variable groups:   x,B,y   ph,y   ps,y

Proof of Theorem bnj48OLD
StepHypRef Expression
1 bnj48.1 . . . . . 6 |- (ch <-> A.x e. A (ps -> ph))
2 bnj48.2 . . . . . . 7 |- B C_ A
32bnj49 12421 . . . . . 6 |- (A.x e. A (ps -> ph) -> A.x e. B (ps -> ph))
41, 3sylbi 216 . . . . 5 |- (ch -> A.x e. B (ps -> ph))
5 df-ral 2109 . . . . . 6 |- (A.x e. B (ps -> ph) <-> A.x(x e. B -> (ps -> ph)))
6 ax-17 1317 . . . . . . 7 |- ((x e. B -> (ps -> ph)) -> A.y(x e. B -> (ps -> ph)))
76sb8 1637 . . . . . 6 |- (A.x(x e. B -> (ps -> ph)) <-> A.y[y / x](x e. B -> (ps -> ph)))
8 bnj45 12415 . . . . . . . 8 |- ([y / x](x e. B -> (ps -> ph)) <-> (y e. B -> [y / x](ps -> ph)))
9 sbim 1604 . . . . . . . . 9 |- ([y / x](ps -> ph) <-> ([y / x]ps -> [y / x]ph))
109imbi2i 202 . . . . . . . 8 |- ((y e. B -> [y / x](ps -> ph)) <-> (y e. B -> ([y / x]ps -> [y / x]ph)))
118, 10bitri 190 . . . . . . 7 |- ([y / x](x e. B -> (ps -> ph)) <-> (y e. B -> ([y / x]ps -> [y / x]ph)))
1211albii 1346 . . . . . 6 |- (A.y[y / x](x e. B -> (ps -> ph)) <-> A.y(y e. B -> ([y / x]ps -> [y / x]ph)))
135, 7, 123bitri 194 . . . . 5 |- (A.x e. B (ps -> ph) <-> A.y(y e. B -> ([y / x]ps -> [y / x]ph)))
144, 13sylib 215 . . . 4 |- (ch -> A.y(y e. B -> ([y / x]ps -> [y / x]ph)))
15 df-ral 2109 . . . 4 |- (A.y e. B ([y / x]ps -> [y / x]ph) <-> A.y(y e. B -> ([y / x]ps -> [y / x]ph)))
1614, 15sylibr 217 . . 3 |- (ch -> A.y e. B ([y / x]ps -> [y / x]ph))
17 rexim 2194 . . 3 |- (A.y e. B ([y / x]ps -> [y / x]ph) -> (E.y e. B [y / x]ps -> E.y e. B [y / x]ph))
1816, 17syl 12 . 2 |- (ch -> (E.y e. B [y / x]ps -> E.y e. B [y / x]ph))
1918imp 377 1 |- ((ch /\ E.y e. B [y / x]ps) -> E.y e. B [y / x]ph)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240  A.wal 1296   e. wcel 1300  [wsbc 1534  A.wral 2105  E.wrex 2106   C_ wss 2593
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-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ral 2109  df-rex 2110  df-in 2603  df-ss 2605
Copyright terms: Public domain