![]() |
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 5781 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 2147 | . . . 4 ⊢ (𝑢 = 𝑥 → (𝑢 = ∅ ↔ 𝑥 = ∅)) | |
2 | 1 | orbi1d 781 | . . 3 ⊢ (𝑢 = 𝑥 → ((𝑢 = ∅ ∨ 𝑦 = {∅}) ↔ (𝑥 = ∅ ∨ 𝑦 = {∅}))) |
3 | 2 | cbvrabv 2688 | . 2 ⊢ {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})} = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝑦 = {∅})} |
4 | eqeq1 2147 | . . . 4 ⊢ (𝑢 = 𝑥 → (𝑢 = {∅} ↔ 𝑥 = {∅})) | |
5 | 4 | orbi1d 781 | . . 3 ⊢ (𝑢 = 𝑥 → ((𝑢 = {∅} ∨ 𝑦 = {∅}) ↔ (𝑥 = {∅} ∨ 𝑦 = {∅}))) |
6 | 5 | cbvrabv 2688 | . 2 ⊢ {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})} = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝑦 = {∅})} |
7 | eqid 2140 | . 2 ⊢ {{𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})}, {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})}} = {{𝑢 ∈ {∅, {∅}} ∣ (𝑢 = ∅ ∨ 𝑦 = {∅})}, {𝑢 ∈ {∅, {∅}} ∣ (𝑢 = {∅} ∨ 𝑦 = {∅})}} | |
8 | 3, 6, 7 | exmidaclem 7081 | 1 ⊢ (CHOICE → EXMID) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∨ wo 698 = wceq 1332 {crab 2421 ∅c0 3368 {csn 3532 {cpr 3533 EXMIDwem 4126 CHOICEwac 7078 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-coll 4051 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-reu 2424 df-rab 2426 df-v 2691 df-sbc 2914 df-csb 3008 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-iun 3823 df-br 3938 df-opab 3998 df-mpt 3999 df-exmid 4127 df-id 4223 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-ima 4560 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fo 5137 df-f1o 5138 df-fv 5139 df-ac 7079 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |