![]() |
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 8717 | . . . . 5 ⊢ (𝐴 ∈ Fin ↔ 𝐴 ≺ ω) | |
2 | 1 | notbii 309 | . . . 4 ⊢ (¬ 𝐴 ∈ Fin ↔ ¬ 𝐴 ≺ ω) |
3 | relen 8118 | . . . . . . . . . . 11 ⊢ Rel ≈ | |
4 | 3 | brrelexi 5297 | . . . . . . . . . 10 ⊢ (𝑋 ≈ ω → 𝑋 ∈ V) |
5 | ssdomg 8159 | . . . . . . . . . 10 ⊢ (𝑋 ∈ V → (𝐴 ⊆ 𝑋 → 𝐴 ≼ 𝑋)) | |
6 | 4, 5 | syl 17 | . . . . . . . . 9 ⊢ (𝑋 ≈ ω → (𝐴 ⊆ 𝑋 → 𝐴 ≼ 𝑋)) |
7 | domen2 8263 | . . . . . . . . 9 ⊢ (𝑋 ≈ ω → (𝐴 ≼ 𝑋 ↔ 𝐴 ≼ ω)) | |
8 | 6, 7 | sylibd 229 | . . . . . . . 8 ⊢ (𝑋 ≈ ω → (𝐴 ⊆ 𝑋 → 𝐴 ≼ ω)) |
9 | 8 | imp 393 | . . . . . . 7 ⊢ ((𝑋 ≈ ω ∧ 𝐴 ⊆ 𝑋) → 𝐴 ≼ ω) |
10 | brdom2 8143 | . . . . . . 7 ⊢ (𝐴 ≼ ω ↔ (𝐴 ≺ ω ∨ 𝐴 ≈ ω)) | |
11 | 9, 10 | sylib 208 | . . . . . 6 ⊢ ((𝑋 ≈ ω ∧ 𝐴 ⊆ 𝑋) → (𝐴 ≺ ω ∨ 𝐴 ≈ ω)) |
12 | 11 | adantlr 694 | . . . . 5 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ 𝐴 ⊆ 𝑋) → (𝐴 ≺ ω ∨ 𝐴 ≈ ω)) |
13 | 12 | ord 853 | . . . 4 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ 𝐴 ⊆ 𝑋) → (¬ 𝐴 ≺ ω → 𝐴 ≈ ω)) |
14 | 2, 13 | syl5bi 232 | . . 3 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ 𝐴 ⊆ 𝑋) → (¬ 𝐴 ∈ Fin → 𝐴 ≈ ω)) |
15 | 14 | impr 442 | . 2 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ (𝐴 ⊆ 𝑋 ∧ ¬ 𝐴 ∈ Fin)) → 𝐴 ≈ ω) |
16 | enen2 8261 | . . 3 ⊢ (𝑌 ≈ ω → (𝐴 ≈ 𝑌 ↔ 𝐴 ≈ ω)) | |
17 | 16 | ad2antlr 706 | . 2 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ (𝐴 ⊆ 𝑋 ∧ ¬ 𝐴 ∈ Fin)) → (𝐴 ≈ 𝑌 ↔ 𝐴 ≈ ω)) |
18 | 15, 17 | mpbird 247 | 1 ⊢ (((𝑋 ≈ ω ∧ 𝑌 ≈ ω) ∧ (𝐴 ⊆ 𝑋 ∧ ¬ 𝐴 ∈ Fin)) → 𝐴 ≈ 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 382 ∨ wo 836 ∈ wcel 2145 Vcvv 3351 ⊆ wss 3723 class class class wbr 4787 ωcom 7216 ≈ cen 8110 ≼ cdom 8111 ≺ csdm 8112 Fincfn 8113 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7100 ax-inf2 8706 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-tp 4322 df-op 4324 df-uni 4576 df-int 4613 df-iun 4657 df-br 4788 df-opab 4848 df-mpt 4865 df-tr 4888 df-id 5158 df-eprel 5163 df-po 5171 df-so 5172 df-fr 5209 df-we 5211 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-pred 5822 df-ord 5868 df-on 5869 df-lim 5870 df-suc 5871 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-om 7217 df-wrecs 7563 df-recs 7625 df-rdg 7663 df-er 7900 df-en 8114 df-dom 8115 df-sdom 8116 df-fin 8117 |
This theorem is referenced by: fiphp3d 37909 irrapx1 37918 |
Copyright terms: Public domain | W3C validator |