Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fin4i | Structured version Visualization version GIF version |
Description: Infer that a set is IV-infinite. (Contributed by Stefan O'Rear, 16-May-2015.) |
Ref | Expression |
---|---|
fin4i | ⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ¬ 𝐴 ∈ FinIV) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isfin4 9002 | . . 3 ⊢ (𝐴 ∈ FinIV → (𝐴 ∈ FinIV ↔ ¬ ∃𝑥(𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴))) | |
2 | 1 | ibi 255 | . 2 ⊢ (𝐴 ∈ FinIV → ¬ ∃𝑥(𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴)) |
3 | relen 7846 | . . . . 5 ⊢ Rel ≈ | |
4 | 3 | brrelexi 5082 | . . . 4 ⊢ (𝑋 ≈ 𝐴 → 𝑋 ∈ V) |
5 | 4 | adantl 481 | . . 3 ⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → 𝑋 ∈ V) |
6 | psseq1 3656 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥 ⊊ 𝐴 ↔ 𝑋 ⊊ 𝐴)) | |
7 | breq1 4586 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥 ≈ 𝐴 ↔ 𝑋 ≈ 𝐴)) | |
8 | 6, 7 | anbi12d 743 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴) ↔ (𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴))) |
9 | 8 | spcegv 3267 | . . 3 ⊢ (𝑋 ∈ V → ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ∃𝑥(𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴))) |
10 | 5, 9 | mpcom 37 | . 2 ⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ∃𝑥(𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴)) |
11 | 2, 10 | nsyl3 132 | 1 ⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ¬ 𝐴 ∈ FinIV) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 = wceq 1475 ∃wex 1695 ∈ wcel 1977 Vcvv 3173 ⊊ wpss 3541 class class class wbr 4583 ≈ cen 7838 FinIVcfin4 8985 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-br 4584 df-opab 4644 df-xp 5044 df-rel 5045 df-en 7842 df-fin4 8992 |
This theorem is referenced by: fin4en1 9014 ssfin4 9015 ominf4 9017 isfin4-3 9020 |
Copyright terms: Public domain | W3C validator |