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

Theorem exmidcon 16829
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 1494. (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 4311 . . . . 5 (EXMIDDECID 𝑦 = 1o)
2 condc 861 . . . . 5 (DECID 𝑦 = 1o → ((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
31, 2syl 14 . . . 4 (EXMID → ((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
43ralrimivw 2618 . . 3 (EXMID → ∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
54ralrimivw 2618 . 2 (EXMID → ∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)))
6 eqeq1 2241 . . . . . . . 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 2544 . . . 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 6657 . . . . . 6 1o ∈ V
1413pwid 3689 . . . . 5 1o ∈ 𝒫 1o
1514a1i 9 . . . 4 (∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)) → 1o ∈ 𝒫 1o)
1611, 12, 15rspcdva 2928 . . 3 (∀𝑥 ∈ 𝒫 1o𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 𝑥 = 1o) → (𝑥 = 1o𝑦 = 1o)) → ∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o)))
17 eqid 2234 . . . . . . 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 2607 . . . 4 (∀𝑦 ∈ 𝒫 1o((¬ 𝑦 = 1o → ¬ 1o = 1o) → (1o = 1o𝑦 = 1o)) → ∀𝑦 ∈ 𝒫 1o(¬ ¬ 𝑦 = 1o𝑦 = 1o))
25 exmidnotnotr 16828 . . . 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 842   = wceq 1398  wcel 2205  wral 2522  𝒫 cpw 3671  EXMIDwem 4309  1oc1o 6642
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556
This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-uni 3917  df-tr 4211  df-exmid 4310  df-iord 4489  df-on 4491  df-suc 4494  df-1o 6649
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator