| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > exmidac | GIF version | ||
| Description: The axiom of choice implies excluded middle. See acexmid 6006 for more discussion of this theorem and a way of stating it without using CHOICE or EXMID. (Contributed by Jim Kingdon, 21-Nov-2023.) |
| Ref | Expression |
|---|---|
| exmidac | ⊢ (CHOICE → EXMID) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2236 | . . . 4 ⊢ (𝑢 = 𝑥 → (𝑢 = ∅ ↔ 𝑥 = ∅)) | |
| 2 | 1 | orbi1d 796 | . . 3 ⊢ (𝑢 = 𝑥 → ((𝑢 = ∅ ∨ 𝑦 = {∅}) ↔ (𝑥 = ∅ ∨ 𝑦 = {∅}))) |
| 3 | 2 | cbvrabv 2798 | . 2 ⊢ {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})} = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝑦 = {∅})} |
| 4 | eqeq1 2236 | . . . 4 ⊢ (𝑢 = 𝑥 → (𝑢 = {∅} ↔ 𝑥 = {∅})) | |
| 5 | 4 | orbi1d 796 | . . 3 ⊢ (𝑢 = 𝑥 → ((𝑢 = {∅} ∨ 𝑦 = {∅}) ↔ (𝑥 = {∅} ∨ 𝑦 = {∅}))) |
| 6 | 5 | cbvrabv 2798 | . 2 ⊢ {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})} = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝑦 = {∅})} |
| 7 | eqid 2229 | . 2 ⊢ {{𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})}, {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})}} = {{𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})}, {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})}} | |
| 8 | 3, 6, 7 | exmidaclem 7401 | 1 ⊢ (CHOICE → EXMID) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ wo 713 = wceq 1395 {crab 2512 ∅c0 3491 {csn 3666 {cpr 3667 EXMIDwem 4278 CHOICEwac 7398 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-exmid 4279 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-ac 7399 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |