| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > card2inf | Structured version Visualization version GIF version | ||
| Description: The alternate definition of the cardinal of a set given in cardval2 9950 has the curious property that for non-numerable sets (for which ndmfv 6895 yields ∅), it still evaluates to a nonempty set, and indeed it contains ω. (Contributed by Mario Carneiro, 15-Jan-2013.) (Revised by Mario Carneiro, 27-Apr-2015.) |
| Ref | Expression |
|---|---|
| card2inf.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| card2inf | ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 5112 | . . . . 5 ⊢ (𝑥 = ∅ → (𝑥 ≺ 𝐴 ↔ ∅ ≺ 𝐴)) | |
| 2 | breq1 5112 | . . . . 5 ⊢ (𝑥 = 𝑛 → (𝑥 ≺ 𝐴 ↔ 𝑛 ≺ 𝐴)) | |
| 3 | breq1 5112 | . . . . 5 ⊢ (𝑥 = suc 𝑛 → (𝑥 ≺ 𝐴 ↔ suc 𝑛 ≺ 𝐴)) | |
| 4 | 0elon 6389 | . . . . . . . 8 ⊢ ∅ ∈ On | |
| 5 | breq1 5112 | . . . . . . . . 9 ⊢ (𝑦 = ∅ → (𝑦 ≈ 𝐴 ↔ ∅ ≈ 𝐴)) | |
| 6 | 5 | rspcev 3591 | . . . . . . . 8 ⊢ ((∅ ∈ On ∧ ∅ ≈ 𝐴) → ∃𝑦 ∈ On 𝑦 ≈ 𝐴) |
| 7 | 4, 6 | mpan 690 | . . . . . . 7 ⊢ (∅ ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴) |
| 8 | 7 | con3i 154 | . . . . . 6 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ¬ ∅ ≈ 𝐴) |
| 9 | card2inf.1 | . . . . . . . 8 ⊢ 𝐴 ∈ V | |
| 10 | 9 | 0dom 9076 | . . . . . . 7 ⊢ ∅ ≼ 𝐴 |
| 11 | brsdom 8948 | . . . . . . 7 ⊢ (∅ ≺ 𝐴 ↔ (∅ ≼ 𝐴 ∧ ¬ ∅ ≈ 𝐴)) | |
| 12 | 10, 11 | mpbiran 709 | . . . . . 6 ⊢ (∅ ≺ 𝐴 ↔ ¬ ∅ ≈ 𝐴) |
| 13 | 8, 12 | sylibr 234 | . . . . 5 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ∅ ≺ 𝐴) |
| 14 | sucdom2 9172 | . . . . . . . 8 ⊢ (𝑛 ≺ 𝐴 → suc 𝑛 ≼ 𝐴) | |
| 15 | 14 | ad2antll 729 | . . . . . . 7 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → suc 𝑛 ≼ 𝐴) |
| 16 | nnon 7850 | . . . . . . . . . 10 ⊢ (𝑛 ∈ ω → 𝑛 ∈ On) | |
| 17 | onsuc 7789 | . . . . . . . . . 10 ⊢ (𝑛 ∈ On → suc 𝑛 ∈ On) | |
| 18 | breq1 5112 | . . . . . . . . . . . 12 ⊢ (𝑦 = suc 𝑛 → (𝑦 ≈ 𝐴 ↔ suc 𝑛 ≈ 𝐴)) | |
| 19 | 18 | rspcev 3591 | . . . . . . . . . . 11 ⊢ ((suc 𝑛 ∈ On ∧ suc 𝑛 ≈ 𝐴) → ∃𝑦 ∈ On 𝑦 ≈ 𝐴) |
| 20 | 19 | ex 412 | . . . . . . . . . 10 ⊢ (suc 𝑛 ∈ On → (suc 𝑛 ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴)) |
| 21 | 16, 17, 20 | 3syl 18 | . . . . . . . . 9 ⊢ (𝑛 ∈ ω → (suc 𝑛 ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴)) |
| 22 | 21 | con3dimp 408 | . . . . . . . 8 ⊢ ((𝑛 ∈ ω ∧ ¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴) → ¬ suc 𝑛 ≈ 𝐴) |
| 23 | 22 | adantrr 717 | . . . . . . 7 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → ¬ suc 𝑛 ≈ 𝐴) |
| 24 | brsdom 8948 | . . . . . . 7 ⊢ (suc 𝑛 ≺ 𝐴 ↔ (suc 𝑛 ≼ 𝐴 ∧ ¬ suc 𝑛 ≈ 𝐴)) | |
| 25 | 15, 23, 24 | sylanbrc 583 | . . . . . 6 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → suc 𝑛 ≺ 𝐴) |
| 26 | 25 | exp32 420 | . . . . 5 ⊢ (𝑛 ∈ ω → (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (𝑛 ≺ 𝐴 → suc 𝑛 ≺ 𝐴))) |
| 27 | 1, 2, 3, 13, 26 | finds2 7876 | . . . 4 ⊢ (𝑥 ∈ ω → (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → 𝑥 ≺ 𝐴)) |
| 28 | 27 | com12 32 | . . 3 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (𝑥 ∈ ω → 𝑥 ≺ 𝐴)) |
| 29 | 28 | ralrimiv 3125 | . 2 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ∀𝑥 ∈ ω 𝑥 ≺ 𝐴) |
| 30 | omsson 7848 | . . 3 ⊢ ω ⊆ On | |
| 31 | ssrab 4038 | . . 3 ⊢ (ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴} ↔ (ω ⊆ On ∧ ∀𝑥 ∈ ω 𝑥 ≺ 𝐴)) | |
| 32 | 30, 31 | mpbiran 709 | . 2 ⊢ (ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴} ↔ ∀𝑥 ∈ ω 𝑥 ≺ 𝐴) |
| 33 | 29, 32 | sylibr 234 | 1 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∈ wcel 2109 ∀wral 3045 ∃wrex 3054 {crab 3408 Vcvv 3450 ⊆ wss 3916 ∅c0 4298 class class class wbr 5109 Oncon0 6334 suc csuc 6336 ωcom 7844 ≈ cen 8917 ≼ cdom 8918 ≺ csdm 8919 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5253 ax-nul 5263 ax-pr 5389 ax-un 7713 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5110 df-opab 5172 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-om 7845 df-1o 8436 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |