Theorem pw1dc1 7111

Description: If, in the set of truth values (the powerset of 1o), equality to 1o is decidable, then excluded middle holds (and conversely). (Contributed by BJ and Jim Kingdon, 8-Aug-2024.)

Assertion

Ref	Expression
pw1dc1	⊢ (EXMID ↔ ∀𝑥 ∈ 𝒫 1oDECID 𝑥 = 1o)

Proof of Theorem pw1dc1

Step	Hyp	Ref	Expression
1		pw1dc0el 7108	. 2 ⊢ (EXMID ↔ ∀𝑥 ∈ 𝒫 1oDECID ∅ ∈ 𝑥)
2		elpwi 3662	. . . . 5 ⊢ (𝑥 ∈ 𝒫 1o → 𝑥 ⊆ 1o)
3		ss1o0el1o 7110	. . . . 5 ⊢ (𝑥 ⊆ 1o → (∅ ∈ 𝑥 ↔ 𝑥 = 1o))
4	2, 3	syl 14	. . . 4 ⊢ (𝑥 ∈ 𝒫 1o → (∅ ∈ 𝑥 ↔ 𝑥 = 1o))
5	4	dcbid 845	. . 3 ⊢ (𝑥 ∈ 𝒫 1o → (DECID ∅ ∈ 𝑥 ↔ DECID 𝑥 = 1o))
6	5	ralbiia 2545	. 2 ⊢ (∀𝑥 ∈ 𝒫 1oDECID ∅ ∈ 𝑥 ↔ ∀𝑥 ∈ 𝒫 1oDECID 𝑥 = 1o)
7	1, 6	bitri 184	1 ⊢ (EXMID ↔ ∀𝑥 ∈ 𝒫 1oDECID 𝑥 = 1o)

Syntax hints:   ↔ wb 105  DECID wdc 841   = wceq 1397   ∈ wcel 2201  ∀wral 2509   ⊆ wss 3199  ∅c0 3493  𝒫 cpw 3653  EXMIDwem 4286  1_oc1o 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-ext 2212  ax-nul 4216

This theorem depends on definitions:  df-bi 117  df-dc 842  df-tru 1400  df-nf 1509  df-sb 1810  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  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-exmid 4287  df-suc 4470  df-1o 6587

This theorem is referenced by:  pw1dceq  16665