Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  exmidcon GIF version

Theorem exmidcon 16667
Description: Excluded middle is equivalent to the form of contraposition which removes negation. Read an element of 𝒫 1o as being a truth value and 𝑥 = 1o being that 𝑥 is true. For a similar theorem, but expressed in terms of formulas rather than subsets of 1o, see dcfromcon 1493. (Contributed by Jim Kingdon, 22-Apr-2026.)
Assertion
Ref Expression
exmidcon (EXMID ↔ ∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
Distinct variable group:   𝑥,𝑦

Proof of Theorem exmidcon
StepHypRef Expression
1 exmidexmid 4288 . . . . 5 (EXMIDDECID 𝑦 = 1o)
2 condc 860 . . . . 5 (DECID 𝑦 = 1o → ((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
31, 2syl 14 . . . 4 (EXMID → ((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
43ralrimivw 2605 . . 3 (EXMID → ∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
54ralrimivw 2605 . 2 (EXMID → ∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
6 eqeq1 2237 . . . . . . . 8 (𝑥 = 1o → (𝑥 = 1o ↔ 1o = 1o))
76notbid 673 . . . . . . 7 (𝑥 = 1o → (¬ 𝑥 = 1o ↔ ¬ 1o = 1o))
87imbi2d 230 . . . . . 6 (𝑥 = 1o → ((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) ↔ (¬ 𝑦 = 1o → ¬ 1o = 1o)))
96imbi1d 231 . . . . . 6 (𝑥 = 1o → ((𝑥 = 1o𝑦 = 1o) ↔ (1o = 1o𝑦 = 1o)))
108, 9imbi12d 234 . . . . 5 (𝑥 = 1o → (((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)) ↔ ((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o))))
1110ralbidv 2531 . . . 4 (𝑥 = 1o → (∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)) ↔ ∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o))))
12 id 19 . . . 4 (∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)) → ∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
13 1oex 6595 . . . . . 6 1o ∈ V
1413pwid 3668 . . . . 5 1o ∈ 𝒫 1o
1514a1i 9 . . . 4 (∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)) → 1o ∈ 𝒫 1o)
1611, 12, 15rspcdva 2914 . . 3 (∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)) → ∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o)))
17 eqid 2230 . . . . . . 7 1o = 1o
18 ax-in2 620 . . . . . . . . 9 (¬ ¬ 𝑦 = 1o → (¬ 𝑦 = 1o → ¬ 1o = 1o))
1918adantr 276 . . . . . . . 8 ((¬ ¬ 𝑦 = 1o ∧ ((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o))) → (¬ 𝑦 = 1o → ¬ 1o = 1o))
20 simpr 110 . . . . . . . 8 ((¬ ¬ 𝑦 = 1o ∧ ((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o))) → ((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o)))
2119, 20mpd 13 . . . . . . 7 ((¬ ¬ 𝑦 = 1o ∧ ((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o))) → (1o = 1o𝑦 = 1o))
2217, 21mpi 15 . . . . . 6 ((¬ ¬ 𝑦 = 1o ∧ ((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o))) → 𝑦 = 1o)
2322expcom 116 . . . . 5 (((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o)) → (¬ ¬ 𝑦 = 1o𝑦 = 1o))
2423ralimi 2594 . . . 4 (∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o)) → ∀𝑦 ∈ 𝒫 1o(¬ ¬ 𝑦 = 1o𝑦 = 1o))
25 exmidnotnotr 16666 . . . 4 (EXMID ↔ ∀𝑦 ∈ 𝒫 1o(¬ ¬ 𝑦 = 1o𝑦 = 1o))
2624, 25sylibr 134 . . 3 (∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o)) → EXMID)
2716, 26syl 14 . 2 (∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)) → EXMID)
285, 27impbii 126 1 (EXMID ↔ ∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  DECID wdc 841   = wceq 1397  wcel 2201  wral 2509  𝒫 cpw 3653  EXMIDwem 4286  1oc1o 6580
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532
This theorem depends on definitions:  df-bi 117  df-stab 838  df-dc 842  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-rab 2518  df-v 2803  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-uni 3895  df-tr 4189  df-exmid 4287  df-iord 4465  df-on 4467  df-suc 4470  df-1o 6587
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator