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

Theorem dn1OLD 856
Description: A single axiom for Boolean algebra known as DN1. See http://www-unix.mcs.anl.gov/~mccune/papers/basax/v12.pdf. (Contributed by Jeffrey Hankins, 3-Jul-2009.)
Assertion
Ref Expression
dn1OLD |- (-. (-. (-. (ph \/ ps) \/ ch) \/ -. (ph \/ -. (-. ch \/ -. (ch \/ th)))) <-> ch)

Proof of Theorem dn1OLD
StepHypRef Expression
1 anor 328 . 2 |- (((-. (ph \/ ps) \/ ch) /\ (ph \/ -. (-. ch \/ -. (ch \/ th)))) <-> -. (-. (-. (ph \/ ps) \/ ch) \/ -. (ph \/ -. (-. ch \/ -. (ch \/ th)))))
2 ioran 331 . . . . . 6 |- (-. (ph \/ ps) <-> (-. ph /\ -. ps))
3 pm2.24 95 . . . . . . . . . 10 |- (ph -> (-. ph -> (-. ps -> ch)))
43com23 36 . . . . . . . . 9 |- (ph -> (-. ps -> (-. ph -> ch)))
5 anor 328 . . . . . . . . . 10 |- ((ch /\ (ch \/ th)) <-> -. (-. ch \/ -. (ch \/ th)))
6 ax-1 4 . . . . . . . . . . . 12 |- (ch -> (-. ph -> ch))
76a1d 15 . . . . . . . . . . 11 |- (ch -> (-. ps -> (-. ph -> ch)))
87adantr 425 . . . . . . . . . 10 |- ((ch /\ (ch \/ th)) -> (-. ps -> (-. ph -> ch)))
95, 8sylbir 218 . . . . . . . . 9 |- (-. (-. ch \/ -. (ch \/ th)) -> (-. ps -> (-. ph -> ch)))
104, 9jaoi 368 . . . . . . . 8 |- ((ph \/ -. (-. ch \/ -. (ch \/ th))) -> (-. ps -> (-. ph -> ch)))
1110com13 37 . . . . . . 7 |- (-. ph -> (-. ps -> ((ph \/ -. (-. ch \/ -. (ch \/ th))) -> ch)))
1211imp 377 . . . . . 6 |- ((-. ph /\ -. ps) -> ((ph \/ -. (-. ch \/ -. (ch \/ th))) -> ch))
132, 12sylbi 216 . . . . 5 |- (-. (ph \/ ps) -> ((ph \/ -. (-. ch \/ -. (ch \/ th))) -> ch))
14 ax-1 4 . . . . 5 |- (ch -> ((ph \/ -. (-. ch \/ -. (ch \/ th))) -> ch))
1513, 14jaoi 368 . . . 4 |- ((-. (ph \/ ps) \/ ch) -> ((ph \/ -. (-. ch \/ -. (ch \/ th))) -> ch))
1615imp 377 . . 3 |- (((-. (ph \/ ps) \/ ch) /\ (ph \/ -. (-. ch \/ -. (ch \/ th)))) -> ch)
17 olc 290 . . . 4 |- (ch -> (-. (ph \/ ps) \/ ch))
18 pm2.24 95 . . . . . . 7 |- (ch -> (-. ch -> ph))
19 pm2.24 95 . . . . . . . . 9 |- (ch -> (-. ch -> (-. th -> ph)))
2019imp3a 388 . . . . . . . 8 |- (ch -> ((-. ch /\ -. th) -> ph))
21 ioran 331 . . . . . . . 8 |- (-. (ch \/ th) <-> (-. ch /\ -. th))
2220, 21syl5ib 223 . . . . . . 7 |- (ch -> (-. (ch \/ th) -> ph))
2318, 22jaod 469 . . . . . 6 |- (ch -> ((-. ch \/ -. (ch \/ th)) -> ph))
2423con3d 111 . . . . 5 |- (ch -> (-. ph -> -. (-. ch \/ -. (ch \/ th))))
2524orrd 250 . . . 4 |- (ch -> (ph \/ -. (-. ch \/ -. (ch \/ th))))
2617, 25jca 310 . . 3 |- (ch -> ((-. (ph \/ ps) \/ ch) /\ (ph \/ -. (-. ch \/ -. (ch \/ th)))))
2716, 26impbii 174 . 2 |- (((-. (ph \/ ps) \/ ch) /\ (ph \/ -. (-. ch \/ -. (ch \/ th)))) <-> ch)
281, 27bitr3i 192 1 |- (-. (-. (-. (ph \/ ps) \/ ch) \/ -. (ph \/ -. (-. ch \/ -. (ch \/ th)))) <-> ch)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 163   \/ wo 239   /\ 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-or 241  df-an 242
Copyright terms: Public domain