![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fin45 | Structured version Visualization version GIF version |
Description: Every IV-finite set is V-finite: if we can pack two copies of the set into itself, we can certainly leave space. (Contributed by Stefan O'Rear, 30-Oct-2014.) (Proof shortened by Mario Carneiro, 18-May-2015.) |
Ref | Expression |
---|---|
fin45 | ⊢ (𝐴 ∈ FinIV → 𝐴 ∈ FinV) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 486 | . . . . . . . 8 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → 𝐴 ≠ ∅) | |
2 | relen 8497 | . . . . . . . . . . 11 ⊢ Rel ≈ | |
3 | 2 | brrelex1i 5572 | . . . . . . . . . 10 ⊢ (𝐴 ≈ (𝐴 ⊔ 𝐴) → 𝐴 ∈ V) |
4 | 3 | adantl 485 | . . . . . . . . 9 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → 𝐴 ∈ V) |
5 | 0sdomg 8630 | . . . . . . . . 9 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) | |
6 | 4, 5 | syl 17 | . . . . . . . 8 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) |
7 | 1, 6 | mpbird 260 | . . . . . . 7 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → ∅ ≺ 𝐴) |
8 | 0sdom1dom 8700 | . . . . . . 7 ⊢ (∅ ≺ 𝐴 ↔ 1o ≼ 𝐴) | |
9 | 7, 8 | sylib 221 | . . . . . 6 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → 1o ≼ 𝐴) |
10 | djudom2 9594 | . . . . . 6 ⊢ ((1o ≼ 𝐴 ∧ 𝐴 ∈ V) → (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 𝐴)) | |
11 | 9, 4, 10 | syl2anc 587 | . . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 𝐴)) |
12 | domen2 8644 | . . . . . 6 ⊢ (𝐴 ≈ (𝐴 ⊔ 𝐴) → ((𝐴 ⊔ 1o) ≼ 𝐴 ↔ (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 𝐴))) | |
13 | 12 | adantl 485 | . . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → ((𝐴 ⊔ 1o) ≼ 𝐴 ↔ (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 𝐴))) |
14 | 11, 13 | mpbird 260 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → (𝐴 ⊔ 1o) ≼ 𝐴) |
15 | domnsym 8627 | . . . 4 ⊢ ((𝐴 ⊔ 1o) ≼ 𝐴 → ¬ 𝐴 ≺ (𝐴 ⊔ 1o)) | |
16 | 14, 15 | syl 17 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → ¬ 𝐴 ≺ (𝐴 ⊔ 1o)) |
17 | isfin4p1 9726 | . . . 4 ⊢ (𝐴 ∈ FinIV ↔ 𝐴 ≺ (𝐴 ⊔ 1o)) | |
18 | 17 | biimpi 219 | . . 3 ⊢ (𝐴 ∈ FinIV → 𝐴 ≺ (𝐴 ⊔ 1o)) |
19 | 16, 18 | nsyl3 140 | . 2 ⊢ (𝐴 ∈ FinIV → ¬ (𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴))) |
20 | isfin5-2 9802 | . 2 ⊢ (𝐴 ∈ FinIV → (𝐴 ∈ FinV ↔ ¬ (𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)))) | |
21 | 19, 20 | mpbird 260 | 1 ⊢ (𝐴 ∈ FinIV → 𝐴 ∈ FinV) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∈ wcel 2111 ≠ wne 2987 Vcvv 3441 ∅c0 4243 class class class wbr 5030 1oc1o 8078 ≈ cen 8489 ≼ cdom 8490 ≺ csdm 8491 ⊔ cdju 9311 FinIVcfin4 9691 FinVcfin5 9693 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-dju 9314 df-fin4 9698 df-fin5 9700 |
This theorem is referenced by: fin2so 35044 |
Copyright terms: Public domain | W3C validator |