Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ssfiexmid | GIF version |
Description: If any subset of a finite set is finite, excluded middle follows. One direction of Theorem 2.1 of [Bauer], p. 485. (Contributed by Jim Kingdon, 19-May-2020.) |
Ref | Expression |
---|---|
ssfiexmid.1 | ⊢ ∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) |
Ref | Expression |
---|---|
ssfiexmid | ⊢ (𝜑 ∨ ¬ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0ex 4116 | . . . 4 ⊢ ∅ ∈ V | |
2 | snfig 6792 | . . . 4 ⊢ (∅ ∈ V → {∅} ∈ Fin) | |
3 | 1, 2 | ax-mp 5 | . . 3 ⊢ {∅} ∈ Fin |
4 | ssrab2 3232 | . . 3 ⊢ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅} | |
5 | ssfiexmid.1 | . . . . 5 ⊢ ∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) | |
6 | p0ex 4174 | . . . . . 6 ⊢ {∅} ∈ V | |
7 | eleq1 2233 | . . . . . . . . 9 ⊢ (𝑥 = {∅} → (𝑥 ∈ Fin ↔ {∅} ∈ Fin)) | |
8 | sseq2 3171 | . . . . . . . . 9 ⊢ (𝑥 = {∅} → (𝑦 ⊆ 𝑥 ↔ 𝑦 ⊆ {∅})) | |
9 | 7, 8 | anbi12d 470 | . . . . . . . 8 ⊢ (𝑥 = {∅} → ((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) ↔ ({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}))) |
10 | 9 | imbi1d 230 | . . . . . . 7 ⊢ (𝑥 = {∅} → (((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) ↔ (({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin))) |
11 | 10 | albidv 1817 | . . . . . 6 ⊢ (𝑥 = {∅} → (∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) ↔ ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin))) |
12 | 6, 11 | spcv 2824 | . . . . 5 ⊢ (∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) → ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin)) |
13 | 5, 12 | ax-mp 5 | . . . 4 ⊢ ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin) |
14 | 6 | rabex 4133 | . . . . 5 ⊢ {𝑧 ∈ {∅} ∣ 𝜑} ∈ V |
15 | sseq1 3170 | . . . . . . 7 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦 ⊆ {∅} ↔ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅})) | |
16 | 15 | anbi2d 461 | . . . . . 6 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) ↔ ({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}))) |
17 | eleq1 2233 | . . . . . 6 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦 ∈ Fin ↔ {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin)) | |
18 | 16, 17 | imbi12d 233 | . . . . 5 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → ((({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin) ↔ (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin))) |
19 | 14, 18 | spcv 2824 | . . . 4 ⊢ (∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin) → (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin)) |
20 | 13, 19 | ax-mp 5 | . . 3 ⊢ (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin) |
21 | 3, 4, 20 | mp2an 424 | . 2 ⊢ {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin |
22 | 21 | ssfilem 6853 | 1 ⊢ (𝜑 ∨ ¬ 𝜑) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∨ wo 703 ∀wal 1346 = wceq 1348 ∈ wcel 2141 {crab 2452 Vcvv 2730 ⊆ wss 3121 ∅c0 3414 {csn 3583 Fincfn 6718 |
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 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-nul 4115 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-iinf 4572 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-rab 2457 df-v 2732 df-sbc 2956 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-br 3990 df-opab 4051 df-id 4278 df-suc 4356 df-iom 4575 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-f1 5203 df-fo 5204 df-f1o 5205 df-fv 5206 df-1o 6395 df-er 6513 df-en 6719 df-fin 6721 |
This theorem is referenced by: infiexmid 6855 |
Copyright terms: Public domain | W3C validator |