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

Theorem exmidac 7303
Description: The axiom of choice implies excluded middle. See acexmid 5933 for more discussion of this theorem and a way of stating it without using CHOICE or EXMID. (Contributed by Jim Kingdon, 21-Nov-2023.)
Assertion
Ref Expression
exmidac (CHOICEEXMID)

Proof of Theorem exmidac
Dummy variables 𝑥 𝑢 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqeq1 2211 . . . 4 (𝑢 = 𝑥 → (𝑢 = ∅ ↔ 𝑥 = ∅))
21orbi1d 792 . . 3 (𝑢 = 𝑥 → ((𝑢 = ∅ ∨ 𝑦 = {∅}) ↔ (𝑥 = ∅ ∨ 𝑦 = {∅})))
32cbvrabv 2770 . 2 {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})} = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝑦 = {∅})}
4 eqeq1 2211 . . . 4 (𝑢 = 𝑥 → (𝑢 = {∅} ↔ 𝑥 = {∅}))
54orbi1d 792 . . 3 (𝑢 = 𝑥 → ((𝑢 = {∅} ∨ 𝑦 = {∅}) ↔ (𝑥 = {∅} ∨ 𝑦 = {∅})))
65cbvrabv 2770 . 2 {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})} = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝑦 = {∅})}
7 eqid 2204 . 2 {{𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})}, {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})}} = {{𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})}, {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})}}
83, 6, 7exmidaclem 7302 1 (CHOICEEXMID)
Colors of variables: wff set class
Syntax hints:  wi 4  wo 709   = wceq 1372  {crab 2487  c0 3459  {csn 3632  {cpr 3633  EXMIDwem 4237  CHOICEwac 7299
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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-nul 4169  ax-pow 4217  ax-pr 4252  ax-un 4478
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-exmid 4238  df-id 4338  df-xp 4679  df-rel 4680  df-cnv 4681  df-co 4682  df-dm 4683  df-rn 4684  df-res 4685  df-ima 4686  df-iota 5229  df-fun 5270  df-fn 5271  df-f 5272  df-f1 5273  df-fo 5274  df-f1o 5275  df-fv 5276  df-ac 7300
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator