| 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 4300 | . . . 4 ⊢ {∅} ∈ V | |
| 2 | eleq1 2295 | . . . . . . 7 ⊢ (𝑥 = {∅} → (𝑥 ∈ Fin ↔ {∅} ∈ Fin)) | |
| 3 | sseq2 3261 | . . . . . . 7 ⊢ (𝑥 = {∅} → (𝑦 ⊆ 𝑥 ↔ 𝑦 ⊆ {∅})) | |
| 4 | 2, 3 | anbi12d 473 | . . . . . 6 ⊢ (𝑥 = {∅} → ((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) ↔ ({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}))) |
| 5 | 4 | imbi1d 231 | . . . . 5 ⊢ (𝑥 = {∅} → (((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) ↔ (({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin))) |
| 6 | 5 | albidv 1873 | . . . 4 ⊢ (𝑥 = {∅} → (∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) ↔ ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin))) |
| 7 | 1, 6 | spcv 2910 | . . 3 ⊢ (∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) → ∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin)) |
| 8 | 0ex 4236 | . . . . 5 ⊢ ∅ ∈ V | |
| 9 | snfig 7055 | . . . . 5 ⊢ (∅ ∈ V → {∅} ∈ Fin) | |
| 10 | 8, 9 | ax-mp 5 | . . . 4 ⊢ {∅} ∈ Fin |
| 11 | ssrab2 3322 | . . . 4 ⊢ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅} | |
| 12 | 10, 11 | pm3.2i 272 | . . 3 ⊢ ({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) |
| 13 | 1 | rabex 4255 | . . . 4 ⊢ {𝑧 ∈ {∅} ∣ 𝜑} ∈ V |
| 14 | sseq1 3260 | . . . . . 6 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦 ⊆ {∅} ↔ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅})) | |
| 15 | 14 | anbi2d 464 | . . . . 5 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) ↔ ({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}))) |
| 16 | eleq1 2295 | . . . . 5 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → (𝑦 ∈ Fin ↔ {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin)) | |
| 17 | 15, 16 | imbi12d 234 | . . . 4 ⊢ (𝑦 = {𝑧 ∈ {∅} ∣ 𝜑} → ((({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin) ↔ (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin))) |
| 18 | 13, 17 | spcv 2910 | . . 3 ⊢ (∀𝑦(({∅} ∈ Fin ∧ 𝑦 ⊆ {∅}) → 𝑦 ∈ Fin) → (({∅} ∈ Fin ∧ {𝑧 ∈ {∅} ∣ 𝜑} ⊆ {∅}) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin)) |
| 19 | 7, 12, 18 | mpisyl 1492 | . 2 ⊢ (∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) → {𝑧 ∈ {∅} ∣ 𝜑} ∈ Fin) |
| 20 | 19 | ssfilemd 7131 | 1 ⊢ (∀𝑥∀𝑦((𝑥 ∈ Fin ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ Fin) → (𝜑 ∨ ¬ 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 716 ∀wal 1396 = wceq 1398 ∈ wcel 2203 {crab 2524 Vcvv 2812 ⊆ wss 3210 ∅c0 3507 {csn 3688 Fincfn 6974 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-iinf 4709 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-rab 2529 df-v 2814 df-sbc 3042 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-br 4109 df-opab 4171 df-id 4413 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-1o 6646 df-er 6766 df-en 6975 df-fin 6977 |
| This theorem is referenced by: exmidssfi 7198 |
| Copyright terms: Public domain | W3C validator |