![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > domfi | Structured version Visualization version GIF version |
Description: A set dominated by a finite set is finite. (Contributed by NM, 23-Mar-2006.) (Revised by Mario Carneiro, 12-Mar-2015.) |
Ref | Expression |
---|---|
domfi | ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴) → 𝐵 ∈ Fin) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | domeng 8899 | . . 3 ⊢ (𝐴 ∈ Fin → (𝐵 ≼ 𝐴 ↔ ∃𝑥(𝐵 ≈ 𝑥 ∧ 𝑥 ⊆ 𝐴))) | |
2 | ssfi 9114 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ⊆ 𝐴) → 𝑥 ∈ Fin) | |
3 | 2 | adantrl 714 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ (𝐵 ≈ 𝑥 ∧ 𝑥 ⊆ 𝐴)) → 𝑥 ∈ Fin) |
4 | enfii 9130 | . . . . . . 7 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≈ 𝑥) → 𝐵 ∈ Fin) | |
5 | 4 | adantrr 715 | . . . . . 6 ⊢ ((𝑥 ∈ Fin ∧ (𝐵 ≈ 𝑥 ∧ 𝑥 ⊆ 𝐴)) → 𝐵 ∈ Fin) |
6 | 3, 5 | sylancom 588 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ (𝐵 ≈ 𝑥 ∧ 𝑥 ⊆ 𝐴)) → 𝐵 ∈ Fin) |
7 | 6 | ex 413 | . . . 4 ⊢ (𝐴 ∈ Fin → ((𝐵 ≈ 𝑥 ∧ 𝑥 ⊆ 𝐴) → 𝐵 ∈ Fin)) |
8 | 7 | exlimdv 1936 | . . 3 ⊢ (𝐴 ∈ Fin → (∃𝑥(𝐵 ≈ 𝑥 ∧ 𝑥 ⊆ 𝐴) → 𝐵 ∈ Fin)) |
9 | 1, 8 | sylbid 239 | . 2 ⊢ (𝐴 ∈ Fin → (𝐵 ≼ 𝐴 → 𝐵 ∈ Fin)) |
10 | 9 | imp 407 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ≼ 𝐴) → 𝐵 ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∃wex 1781 ∈ wcel 2106 ⊆ wss 3909 class class class wbr 5104 ≈ cen 8877 ≼ cdom 8878 Fincfn 8880 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5255 ax-nul 5262 ax-pr 5383 ax-un 7669 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2888 df-ne 2943 df-ral 3064 df-rex 3073 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3739 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-pss 3928 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-br 5105 df-opab 5167 df-tr 5222 df-id 5530 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5587 df-we 5589 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6446 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-om 7800 df-1o 8409 df-en 8881 df-dom 8882 df-fin 8884 |
This theorem is referenced by: domtrfi 9137 domtrfir 9138 sdomdomtrfi 9145 php3 9153 onomeneq 9169 xpfir 9207 findcard3 9226 dmfi 9271 fofi 9279 pwfilemOLD 9287 pwfiOLD 9288 sdom2en01 10235 isfin1-2 10318 fin67 10328 fin1a2lem9 10341 gchdju1 10589 hashdomi 14277 symggen 19248 cmpsub 22747 ufinffr 23276 alexsubALT 23398 ovolicc2lem4 24880 aannenlem1 25684 ffsrn 31541 locfinreflem 32312 lindsenlbs 36062 harinf 41334 kelac2lem 41367 disjinfi 43386 |
Copyright terms: Public domain | W3C validator |