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

Theorem dedlem0aOLD 835
Description: Lemma for an alternate version of weak deduction theorem.
Assertion
Ref Expression
dedlem0aOLD |- (ph -> (ps <-> ((ch -> ph) -> (ps /\ ph))))

Proof of Theorem dedlem0aOLD
StepHypRef Expression
1 ax-1 4 . . 3 |- (ps -> ((ch -> ph) -> ps))
2 ax-1 4 . . . . 5 |- (ph -> (ch -> ph))
32imim1i 19 . . . 4 |- (((ch -> ph) -> ps) -> (ph -> ps))
43com12 14 . . 3 |- (ph -> (((ch -> ph) -> ps) -> ps))
51, 4impbid2 576 . 2 |- (ph -> (ps <-> ((ch -> ph) -> ps)))
6 iba 704 . . 3 |- (ph -> (ps <-> (ps /\ ph)))
76imbi2d 674 . 2 |- (ph -> (((ch -> ph) -> ps) <-> ((ch -> ph) -> (ps /\ ph))))
85, 7bitrd 587 1 |- (ph -> (ps <-> ((ch -> ph) -> (ps /\ ph))))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 164  df-an 242
Copyright terms: Public domain