| Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ctbnfien | Structured version Visualization version GIF version | ||
| Description: An infinite subset of a countable set is countable, without using choice. (Contributed by Stefan O'Rear, 19-Oct-2014.) (Revised by Stefan O'Rear, 6-May-2015.) |
| Ref | Expression |
|---|---|
| ctbnfien | ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ (𝐴 ⊆ 𝑋 ∧ ¬ 𝐴 ∈ Fin)) → 𝐴 ≈ 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isfinite 9605 | . . . . 5 ⊢ (𝐴 ∈ Fin ↔ 𝐴 ≺ ω) | |
| 2 | 1 | notbii 320 | . . . 4 ⊢ (¬ 𝐴 ∈ Fin ↔ ¬ 𝐴 ≺ ω) |
| 3 | relen 8923 | . . . . . . . . . . 11 ⊢ Rel ≈ | |
| 4 | 3 | brrelex1i 5694 | . . . . . . . . . 10 ⊢ (𝑋 ≈ ω → 𝑋 ∈ V) |
| 5 | ssdomg 8971 | . . . . . . . . . 10 ⊢ (𝑋 ∈ V → (𝐴 ⊆ 𝑋 → 𝐴 ≼ 𝑋)) | |
| 6 | 4, 5 | syl 17 | . . . . . . . . 9 ⊢ (𝑋 ≈ ω → (𝐴 ⊆ 𝑋 → 𝐴 ≼ 𝑋)) |
| 7 | domen2 9084 | . . . . . . . . 9 ⊢ (𝑋 ≈ ω → (𝐴 ≼ 𝑋 ↔ 𝐴 ≼ ω)) | |
| 8 | 6, 7 | sylibd 239 | . . . . . . . 8 ⊢ (𝑋 ≈ ω → (𝐴 ⊆ 𝑋 → 𝐴 ≼ ω)) |
| 9 | 8 | imp 406 | . . . . . . 7 ⊢ ((𝑋 ≈ ω ∧ 𝐴 ⊆ 𝑋) → 𝐴 ≼ ω) |
| 10 | brdom2 8953 | . . . . . . 7 ⊢ (𝐴 ≼ ω ↔ (𝐴 ≺ ω ∨ 𝐴 ≈ ω)) | |
| 11 | 9, 10 | sylib 218 | . . . . . 6 ⊢ ((𝑋 ≈ ω ∧ 𝐴 ⊆ 𝑋) → (𝐴 ≺ ω ∨ 𝐴 ≈ ω)) |
| 12 | 11 | adantlr 715 | . . . . 5 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ 𝐴 ⊆ 𝑋) → (𝐴 ≺ ω ∨ 𝐴 ≈ ω)) |
| 13 | 12 | ord 864 | . . . 4 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ 𝐴 ⊆ 𝑋) → (¬ 𝐴 ≺ ω → 𝐴 ≈ ω)) |
| 14 | 2, 13 | biimtrid 242 | . . 3 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ 𝐴 ⊆ 𝑋) → (¬ 𝐴 ∈ Fin → 𝐴 ≈ ω)) |
| 15 | 14 | impr 454 | . 2 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ (𝐴 ⊆ 𝑋 ∧ ¬ 𝐴 ∈ Fin)) → 𝐴 ≈ ω) |
| 16 | enen2 9082 | . . 3 ⊢ (𝑌 ≈ ω → (𝐴 ≈ 𝑌 ↔ 𝐴 ≈ ω)) | |
| 17 | 16 | ad2antlr 727 | . 2 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ (𝐴 ⊆ 𝑋 ∧ ¬ 𝐴 ∈ Fin)) → (𝐴 ≈ 𝑌 ↔ 𝐴 ≈ ω)) |
| 18 | 15, 17 | mpbird 257 | 1 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ (𝐴 ⊆ 𝑋 ∧ ¬ 𝐴 ∈ Fin)) → 𝐴 ≈ 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∈ wcel 2109 Vcvv 3447 ⊆ wss 3914 class class class wbr 5107 ωcom 7842 ≈ cen 8915 ≼ cdom 8916 ≺ csdm 8917 Fincfn 8918 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-inf2 9594 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 |
| This theorem is referenced by: fiphp3d 42807 irrapx1 42816 |
| Copyright terms: Public domain | W3C validator |