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

Theorem 19.21t 1156
Description: Closed form of Theorem 19.21 of [Margaris] p. 90.
Assertion
Ref Expression
19.21t |- (A.x(ph -> A.xph) -> (A.x(ph -> ps) <-> (ph -> A.xps)))

Proof of Theorem 19.21t
StepHypRef Expression
1 19.20 1035 . . . . 5 |- (A.x(ph -> ps) -> (A.xph -> A.xps))
21imim2d 25 . . . 4 |- (A.x(ph -> ps) -> ((ph -> A.xph) -> (ph -> A.xps)))
32com12 11 . . 3 |- ((ph -> A.xph) -> (A.x(ph -> ps) -> (ph -> A.xps)))
43a4s 1025 . 2 |- (A.x(ph -> A.xph) -> (A.x(ph -> ps) -> (ph -> A.xps)))
5 hba1 1044 . . . 4 |- (A.x(ph -> A.xph) -> A.xA.x(ph -> A.xph))
6 ax-4 1014 . . . 4 |- (A.x(ph -> A.xph) -> (ph -> A.xph))
7 hba1 1044 . . . . 5 |- (A.xps -> A.xA.xps)
87a1i 8 . . . 4 |- (A.x(ph -> A.xph) -> (A.xps -> A.xA.xps))
95, 6, 8hbimd 1151 . . 3 |- (A.x(ph -> A.xph) -> ((ph -> A.xps) -> A.x(ph -> A.xps)))
10 ax-4 1014 . . . . 5 |- (A.xps -> ps)
1110imim2i 17 . . . 4 |- ((ph -> A.xps) -> (ph -> ps))
121119.20i 1033 . . 3 |- (A.x(ph -> A.xps) -> A.x(ph -> ps))
139, 12syl6 22 . 2 |- (A.x(ph -> A.xph) -> ((ph -> A.xps) -> A.x(ph -> ps)))
144, 13impbid 527 1 |- (A.x(ph -> A.xph) -> (A.x(ph -> ps) <-> (ph -> A.xps)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 153  A.wal 995
This theorem is referenced by:  sbcom 1300  sbal2 1400  ax11indalem 1410  ax11inda2ALT 1411  r19.21t 1762  sbciegft 2009
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 1004  ax-4 1014  ax-5o 1016  ax-6o 1019
This theorem depends on definitions:  df-bi 154  df-an 232
Copyright terms: Public domain