![]() |
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 482 | . . . . . . . 8 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → 𝐴 ≠ ∅) | |
2 | relen 8988 | . . . . . . . . . . 11 ⊢ Rel ≈ | |
3 | 2 | brrelex1i 5744 | . . . . . . . . . 10 ⊢ (𝐴 ≈ (𝐴 ⊔ 𝐴) → 𝐴 ∈ V) |
4 | 3 | adantl 481 | . . . . . . . . 9 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → 𝐴 ∈ V) |
5 | 0sdomg 9142 | . . . . . . . . 9 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) | |
6 | 4, 5 | syl 17 | . . . . . . . 8 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) |
7 | 1, 6 | mpbird 257 | . . . . . . 7 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → ∅ ≺ 𝐴) |
8 | 0sdom1dom 9271 | . . . . . . 7 ⊢ (∅ ≺ 𝐴 ↔ 1o ≼ 𝐴) | |
9 | 7, 8 | sylib 218 | . . . . . 6 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → 1o ≼ 𝐴) |
10 | djudom2 10221 | . . . . . 6 ⊢ ((1o ≼ 𝐴 ∧ 𝐴 ∈ V) → (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 𝐴)) | |
11 | 9, 4, 10 | syl2anc 584 | . . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 𝐴)) |
12 | domen2 9158 | . . . . . 6 ⊢ (𝐴 ≈ (𝐴 ⊔ 𝐴) → ((𝐴 ⊔ 1o) ≼ 𝐴 ↔ (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 𝐴))) | |
13 | 12 | adantl 481 | . . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → ((𝐴 ⊔ 1o) ≼ 𝐴 ↔ (𝐴 ⊔ 1o) ≼ (𝐴 ⊔ 𝐴))) |
14 | 11, 13 | mpbird 257 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → (𝐴 ⊔ 1o) ≼ 𝐴) |
15 | domnsym 9137 | . . . 4 ⊢ ((𝐴 ⊔ 1o) ≼ 𝐴 → ¬ 𝐴 ≺ (𝐴 ⊔ 1o)) | |
16 | 14, 15 | syl 17 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)) → ¬ 𝐴 ≺ (𝐴 ⊔ 1o)) |
17 | isfin4p1 10352 | . . . 4 ⊢ (𝐴 ∈ FinIV ↔ 𝐴 ≺ (𝐴 ⊔ 1o)) | |
18 | 17 | biimpi 216 | . . 3 ⊢ (𝐴 ∈ FinIV → 𝐴 ≺ (𝐴 ⊔ 1o)) |
19 | 16, 18 | nsyl3 138 | . 2 ⊢ (𝐴 ∈ FinIV → ¬ (𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴))) |
20 | isfin5-2 10428 | . 2 ⊢ (𝐴 ∈ FinIV → (𝐴 ∈ FinV ↔ ¬ (𝐴 ≠ ∅ ∧ 𝐴 ≈ (𝐴 ⊔ 𝐴)))) | |
21 | 19, 20 | mpbird 257 | 1 ⊢ (𝐴 ∈ FinIV → 𝐴 ∈ FinV) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2105 ≠ wne 2937 Vcvv 3477 ∅c0 4338 class class class wbr 5147 1oc1o 8497 ≈ cen 8980 ≼ cdom 8981 ≺ csdm 8982 ⊔ cdju 9935 FinIVcfin4 10317 FinVcfin5 10319 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-ral 3059 df-rex 3068 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-int 4951 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-ov 7433 df-om 7887 df-1st 8012 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-1o 8504 df-er 8743 df-en 8984 df-dom 8985 df-sdom 8986 df-dju 9938 df-fin4 10324 df-fin5 10326 |
This theorem is referenced by: fin2so 37593 |
Copyright terms: Public domain | W3C validator |