| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssfiexmidt | 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 |
|---|---|
| ssfiexmidt | ⊢ (∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) → (𝜑 ∨ ¬ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | p0ex 4278 | . . . 4 ⊢ {∅} ∈ V | |
| 2 | eleq1 2294 | . . . . . . 7 ⊢ (𝑥 = {∅} → (𝑥 ∈ Fin ↔ {∅} ∈ Fin)) | |
| 3 | sseq2 3251 | . . . . . . 7 ⊢ (𝑥 = {∅} → (𝑦 ⊆ 𝑥 ↔ 𝑦 ⊆ {∅})) | |
| 4 | 2, 3 | anbi12d 473 | . . . . . 6 ⊢ (𝑥 = {∅} → ((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) ↔ ({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}))) |
| 5 | 4 | imbi1d 231 | . . . . 5 ⊢ (𝑥 = {∅} → (((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) ↔ (({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin))) |
| 6 | 5 | albidv 1872 | . . . 4 ⊢ (𝑥 = {∅} → (∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) ↔ ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin))) |
| 7 | 1, 6 | spcv 2900 | . . 3 ⊢ (∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) → ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin)) |
| 8 | 0ex 4216 | . . . . 5 ⊢ ∅ ∈ V | |
| 9 | snfig 6989 | . . . . 5 ⊢ (∅ ∈ V → {∅} ∈ Fin) | |
| 10 | 8, 9 | ax-mp 5 | . . . 4 ⊢ {∅} ∈ Fin |
| 11 | ssrab2 3312 | . . . 4 ⊢ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅} | |
| 12 | 10, 11 | pm3.2i 272 | . . 3 ⊢ ({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) |
| 13 | 1 | rabex 4234 | . . . 4 ⊢ {𝑧 ∈ {∅} ∣ 𝜑} ∈ V |
| 14 | sseq1 3250 | . . . . . 6 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦 ⊆ {∅} ↔ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅})) | |
| 15 | 14 | anbi2d 464 | . . . . 5 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) ↔ ({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}))) |
| 16 | eleq1 2294 | . . . . 5 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦 ∈ Fin ↔ {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin)) | |
| 17 | 15, 16 | imbi12d 234 | . . . 4 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → ((({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin) ↔ (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin))) |
| 18 | 13, 17 | spcv 2900 | . . 3 ⊢ (∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin) → (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin)) |
| 19 | 7, 12, 18 | mpisyl 1491 | . 2 ⊢ (∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin) |
| 20 | 19 | ssfilemd 7064 | 1 ⊢ (∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) → (𝜑 ∨ ¬ 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 715 ∀wal 1395 = wceq 1397 ∈ wcel 2202 {crab 2514 Vcvv 2802 ⊆ wss 3200 ∅c0 3494 {csn 3669 Fincfn 6909 |
| 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-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-iinf 4686 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-id 4390 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-1o 6582 df-er 6702 df-en 6910 df-fin 6912 |
| This theorem is referenced by: exmidssfi 7131 |
| Copyright terms: Public domain | W3C validator |