ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dn1dc GIF version

Theorem dn1dc 973
Description: DN1 for decidable propositions. Without the decidability conditions, DN1 can serve as a single axiom for Boolean algebra. See http://www-unix.mcs.anl.gov/~mccune/papers/basax/v12.pdf. (Contributed by Jim Kingdon, 22-Apr-2018.)
Assertion
Ref Expression
dn1dc ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → (¬ (¬ (¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∨ ¬ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))) ↔ 𝜒))

Proof of Theorem dn1dc
StepHypRef Expression
1 pm2.45 750 . . . . 5 (¬ (𝜑 ∨ 𝜓) → ¬ 𝜑)
2 imnan 701 . . . . 5 ((¬ (𝜑 ∨ 𝜓) → ¬ 𝜑) ↔ ¬ (¬ (𝜑 ∨ 𝜓) ∧ 𝜑))
31, 2mpbi 145 . . . 4 ¬ (¬ (𝜑 ∨ 𝜓) ∧ 𝜑)
43biorfi 758 . . 3 (𝜒 ↔ (𝜒 ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝜑)))
5 orcom 740 . . 3 ((𝜒 ∨ (¬ (𝜑 ∨ 𝜓) ∧ 𝜑)) ↔ ((¬ (𝜑 ∨ 𝜓) ∧ 𝜑) ∨ 𝜒))
6 ordir 829 . . 3 (((¬ (𝜑 ∨ 𝜓) ∧ 𝜑) ∨ 𝜒) ↔ ((¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∧ (𝜑 ∨ 𝜒)))
74, 5, 63bitri 206 . 2 (𝜒 ↔ ((¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∧ (𝜑 ∨ 𝜒)))
8 pm4.45 796 . . . . . 6 (𝜒 ↔ (𝜒 ∧ (𝜒 ∨ 𝜃)))
9 simprrl 545 . . . . . . 7 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID 𝜒)
10 dcor 948 . . . . . . . . 9 (DECID 𝜒 → (DECID 𝜃 → DECID (𝜒 ∨ 𝜃)))
1110imp 124 . . . . . . . 8 ((DECID 𝜒 ∧ DECID 𝜃) → DECID (𝜒 ∨ 𝜃))
1211ad2antll 495 . . . . . . 7 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID (𝜒 ∨ 𝜃))
13 anordc 969 . . . . . . 7 (DECID 𝜒 → (DECID (𝜒 ∨ 𝜃) → ((𝜒 ∧ (𝜒 ∨ 𝜃)) ↔ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))))
149, 12, 13sylc 62 . . . . . 6 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → ((𝜒 ∧ (𝜒 ∨ 𝜃)) ↔ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))))
158, 14bitrid 192 . . . . 5 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → (𝜒 ↔ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))))
1615orbi2d 802 . . . 4 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → ((𝜑 ∨ 𝜒) ↔ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))))
1716anbi2d 468 . . 3 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → (((¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∧ (𝜑 ∨ 𝜒)) ↔ ((¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∧ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))))))
18 dcor 948 . . . . . . . 8 (DECID 𝜑 → (DECID 𝜓 → DECID (𝜑 ∨ 𝜓)))
19 dcn 854 . . . . . . . 8 (DECID (𝜑 ∨ 𝜓) → DECID ¬ (𝜑 ∨ 𝜓))
2018, 19syl6 33 . . . . . . 7 (DECID 𝜑 → (DECID 𝜓 → DECID ¬ (𝜑 ∨ 𝜓)))
2120imp 124 . . . . . 6 ((DECID 𝜑 ∧ DECID 𝜓) → DECID ¬ (𝜑 ∨ 𝜓))
2221adantrr 483 . . . . 5 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID ¬ (𝜑 ∨ 𝜓))
23 dcor 948 . . . . 5 (DECID ¬ (𝜑 ∨ 𝜓) → (DECID 𝜒 → DECID (¬ (𝜑 ∨ 𝜓) ∨ 𝜒)))
2422, 9, 23sylc 62 . . . 4 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID (¬ (𝜑 ∨ 𝜓) ∨ 𝜒))
25 dcn 854 . . . . . . . 8 (DECID 𝜒 → DECID ¬ 𝜒)
269, 25syl 14 . . . . . . 7 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID ¬ 𝜒)
27 dcn 854 . . . . . . . 8 (DECID (𝜒 ∨ 𝜃) → DECID ¬ (𝜒 ∨ 𝜃))
2812, 27syl 14 . . . . . . 7 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID ¬ (𝜒 ∨ 𝜃))
29 dcor 948 . . . . . . 7 (DECID ¬ 𝜒 → (DECID ¬ (𝜒 ∨ 𝜃) → DECID (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))))
3026, 28, 29sylc 62 . . . . . 6 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))
31 dcn 854 . . . . . 6 (DECID (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)) → DECID ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))
3230, 31syl 14 . . . . 5 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))
33 dcor 948 . . . . . 6 (DECID 𝜑 → (DECID ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)) → DECID (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))))
3433imp 124 . . . . 5 ((DECID 𝜑 ∧ DECID ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))) → DECID (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))))
3532, 34syldan 282 . . . 4 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → DECID (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))))
36 anordc 969 . . . 4 (DECID (¬ (𝜑 ∨ 𝜓) ∨ 𝜒) → (DECID (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))) → (((¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∧ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))) ↔ ¬ (¬ (¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∨ ¬ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))))))
3724, 35, 36sylc 62 . . 3 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → (((¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∧ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))) ↔ ¬ (¬ (¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∨ ¬ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))))))
3817, 37bitrd 188 . 2 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → (((¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∧ (𝜑 ∨ 𝜒)) ↔ ¬ (¬ (¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∨ ¬ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃))))))
397, 38bitr2id 193 1 ((DECID 𝜑 ∧ (DECID 𝜓 ∧ (DECID 𝜒 ∧ DECID 𝜃))) → (¬ (¬ (¬ (𝜑 ∨ 𝜓) ∨ 𝜒) ∨ ¬ (𝜑 ∨ ¬ (¬ 𝜒 ∨ ¬ (𝜒 ∨ 𝜃)))) ↔ 𝜒))
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  DECID wdc 846
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721
This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator