Theorem exmidnotnotr 17018

Description: Excluded middle is equivalent to double negation elimination. Read an element of 𝒫 1_o as being a truth value and 𝑥 = 1_o being that 𝑥 is true. For a similar theorem, but expressed in terms of formulas rather than subsets of 1_o, see dcfromnotnotr 1497. (Contributed by Jim Kingdon, 22-Apr-2026.)

Assertion

Ref	Expression
exmidnotnotr	⊢ (EXMID ↔ ∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o))

Proof of Theorem exmidnotnotr

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		exmidexmid 4331	. . . 4 ⊢ (EXMID → DECID 𝑥 = 1o)
2		notnotrdc 855	. . . 4 ⊢ (DECID 𝑥 = 1o → (¬ ¬ 𝑥 = 1o → 𝑥 = 1o))
3	1, 2	syl 14	. . 3 ⊢ (EXMID → (¬ ¬ 𝑥 = 1o → 𝑥 = 1o))
4	3	ralrimivw 2624	. 2 ⊢ (EXMID → ∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o))
5		eqeq1 2245	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑥 = 1o ↔ 𝑦 = 1o))
6	5	notbid 677	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 = 1o ↔ ¬ 𝑦 = 1o))
7	6	notbid 677	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (¬ ¬ 𝑥 = 1o ↔ ¬ ¬ 𝑦 = 1o))
8	7, 5	imbi12d 234	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((¬ ¬ 𝑥 = 1o → 𝑥 = 1o) ↔ (¬ ¬ 𝑦 = 1o → 𝑦 = 1o)))
9		simpl 109	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o) ∧ 𝑦 ⊆ {∅}) → ∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o))
10		velpw 3695	. . . . . . . 8 ⊢ (𝑦 ∈ 𝒫 1o ↔ 𝑦 ⊆ 1o)
11		df1o2 6695	. . . . . . . . 9 ⊢ 1o = {∅}
12	11	sseq2i 3275	. . . . . . . 8 ⊢ (𝑦 ⊆ 1o ↔ 𝑦 ⊆ {∅})
13	10, 12	sylbbr 136	. . . . . . 7 ⊢ (𝑦 ⊆ {∅} → 𝑦 ∈ 𝒫 1o)
14	13	adantl 277	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o) ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ 𝒫 1o)
15	8, 9, 14	rspcdva 2934	. . . . 5 ⊢ ((∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o) ∧ 𝑦 ⊆ {∅}) → (¬ ¬ 𝑦 = 1o → 𝑦 = 1o))
16		df-stab 843	. . . . 5 ⊢ (STAB 𝑦 = 1o ↔ (¬ ¬ 𝑦 = 1o → 𝑦 = 1o))
17	15, 16	sylibr 134	. . . 4 ⊢ ((∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o) ∧ 𝑦 ⊆ {∅}) → STAB 𝑦 = 1o)
18	11	eqeq2i 2249	. . . . . 6 ⊢ (𝑦 = 1o ↔ 𝑦 = {∅})
19	18	a1i 9	. . . . 5 ⊢ ((∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o) ∧ 𝑦 ⊆ {∅}) → (𝑦 = 1o ↔ 𝑦 = {∅}))
20	19	stbid 844	. . . 4 ⊢ ((∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o) ∧ 𝑦 ⊆ {∅}) → (STAB 𝑦 = 1o ↔ STAB 𝑦 = {∅}))
21	17, 20	mpbid 147	. . 3 ⊢ ((∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o) ∧ 𝑦 ⊆ {∅}) → STAB 𝑦 = {∅})
22	21	exmid1stab 4343	. 2 ⊢ (∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o) → EXMID)
23	4, 22	impbii 126	1 ⊢ (EXMID ↔ ∀𝑥 ∈ 𝒫 1o(¬ ¬ 𝑥 = 1o → 𝑥 = 1o))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  STAB wstab 842  DECID wdc 846   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  ∅c0 3520  𝒫 cpw 3688  {csn 3708  EXMIDwem 4329  1_oc1o 6674

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-nul 4257  ax-pow 4309

This theorem depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-exmid 4330  df-suc 4514  df-1o 6681

This theorem is referenced by:  exmidcon  17019  exmidpeirce  17020