| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infpss | Structured version Visualization version GIF version | ||
| Description: Every infinite set has an equinumerous proper subset, proved without AC or Infinity. Exercise 7 of [TakeutiZaring] p. 91. See also infpssALT 10430. (Contributed by NM, 23-Oct-2004.) (Revised by Mario Carneiro, 30-Apr-2015.) |
| Ref | Expression |
|---|---|
| infpss | ⊢ (ω ≼ 𝐴 → ∃𝑥(𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | infn0 9332 | . . 3 ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) | |
| 2 | n0 4303 | . . 3 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐴) | |
| 3 | 1, 2 | sylib 221 | . 2 ⊢ (ω ≼ 𝐴 → ∃𝑦 𝑦 ∈ 𝐴) |
| 4 | reldom 9017 | . . . . . 6 ⊢ Rel ≼ | |
| 5 | 4 | brrelex2i 5715 | . . . . 5 ⊢ (ω ≼ 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | difexd 5300 | . . . 4 ⊢ (ω ≼ 𝐴 → (𝐴 ∖ {𝑦}) ∈ V) |
| 7 | 6 | adantr 486 | . . 3 ⊢ ((ω ≼ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝐴 ∖ {𝑦}) ∈ V) |
| 8 | difsnpss 4772 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 ↔ (𝐴 ∖ {𝑦}) ⊊ 𝐴) | |
| 9 | 8 | bilani 510 | . . . 4 ⊢ ((ω ≼ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝐴 ∖ {𝑦}) ⊊ 𝐴) |
| 10 | infdifsn 9695 | . . . . 5 ⊢ (ω ≼ 𝐴 → (𝐴 ∖ {𝑦}) ≈ 𝐴) | |
| 11 | 10 | adantr 486 | . . . 4 ⊢ ((ω ≼ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝐴 ∖ {𝑦}) ≈ 𝐴) |
| 12 | 9, 11 | jca 521 | . . 3 ⊢ ((ω ≼ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝐴 ∖ {𝑦}) ⊊ 𝐴 ∧ (𝐴 ∖ {𝑦}) ≈ 𝐴)) |
| 13 | psseq1 4020 | . . . 4 ⊢ (𝑥 = (𝐴 ∖ {𝑦}) → (𝑥 ⊊ 𝐴 ↔ (𝐴 ∖ {𝑦}) ⊊ 𝐴)) | |
| 14 | breq1 5111 | . . . 4 ⊢ (𝑥 = (𝐴 ∖ {𝑦}) → (𝑥 ≈ 𝐴 ↔ (𝐴 ∖ {𝑦}) ≈ 𝐴)) | |
| 15 | 13, 14 | anbi12d 644 | . . 3 ⊢ (𝑥 = (𝐴 ∖ {𝑦}) → ((𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴) ↔ ((𝐴 ∖ {𝑦}) ⊊ 𝐴 ∧ (𝐴 ∖ {𝑦}) ≈ 𝐴))) |
| 16 | 7, 12, 15 | spcedv 3556 | . 2 ⊢ ((ω ≼ 𝐴 ∧ 𝑦 ∈ 𝐴) → ∃𝑥(𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴)) |
| 17 | 3, 16 | exlimddv 1970 | 1 ⊢ (ω ≼ 𝐴 → ∃𝑥(𝑥 ⊊ 𝐴 ∧ 𝑥 ≈ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ⊊ wpss 4016 ∖ cdif 4048 ∅c0 4281 {csn 4588 class class class wbr 5108 ωcom 7911 ≈ cen 9008 ≼ cdom 9009 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-om 7912 df-er 8755 df-en 9012 df-dom 9013 |
| This theorem is used by: isfin4-2 10431 |
| Copyright terms: Public domain | W3C validator |