| 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 9965 has the curious property that for non-numerable sets (for which ndmfv 6903 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 5108 | . . . . 5 ⊢ (𝑥 = ∅ → (𝑥 ≺ 𝐴 ↔ ∅ ≺ 𝐴)) | |
| 2 | breq1 5108 | . . . . 5 ⊢ (𝑥 = 𝑛 → (𝑥 ≺ 𝐴 ↔ 𝑛 ≺ 𝐴)) | |
| 3 | breq1 5108 | . . . . 5 ⊢ (𝑥 = suc 𝑛 → (𝑥 ≺ 𝐴 ↔ suc 𝑛 ≺ 𝐴)) | |
| 4 | 0elon 6405 | . . . . . . . 8 ⊢ ∅ ∈ On | |
| 5 | breq1 5108 | . . . . . . . . 9 ⊢ (𝑦 = ∅ → (𝑦 ≈ 𝐴 ↔ ∅ ≈ 𝐴)) | |
| 6 | 5 | rspcev 3584 | . . . . . . . 8 ⊢ ((∅ ∈ On ∧ ∅ ≈ 𝐴) → ∃𝑦 ∈ On 𝑦 ≈ 𝐴) |
| 7 | 4, 6 | mpan 702 | . . . . . . 7 ⊢ (∅ ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴) |
| 8 | 7 | con3i 155 | . . . . . 6 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ¬ ∅ ≈ 𝐴) |
| 9 | card2inf.1 | . . . . . . . 8 ⊢ 𝐴 ∈ V | |
| 10 | 9 | 0dom 9083 | . . . . . . 7 ⊢ ∅ ≼ 𝐴 |
| 11 | brsdom 8959 | . . . . . . 7 ⊢ (∅ ≺ 𝐴 ↔ (∅ ≼ 𝐴 ∧ ¬ ∅ ≈ 𝐴)) | |
| 12 | 10, 11 | mpbiran 721 | . . . . . 6 ⊢ (∅ ≺ 𝐴 ↔ ¬ ∅ ≈ 𝐴) |
| 13 | 8, 12 | sylibr 237 | . . . . 5 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ∅ ≺ 𝐴) |
| 14 | sucdom2 9175 | . . . . . . . 8 ⊢ (𝑛 ≺ 𝐴 → suc 𝑛 ≼ 𝐴) | |
| 15 | 14 | ad2antll 741 | . . . . . . 7 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → suc 𝑛 ≼ 𝐴) |
| 16 | nnon 7856 | . . . . . . . . . 10 ⊢ (𝑛 ∈ ω → 𝑛 ∈ On) | |
| 17 | onsuc 7797 | . . . . . . . . . 10 ⊢ (𝑛 ∈ On → suc 𝑛 ∈ On) | |
| 18 | breq1 5108 | . . . . . . . . . . . 12 ⊢ (𝑦 = suc 𝑛 → (𝑦 ≈ 𝐴 ↔ suc 𝑛 ≈ 𝐴)) | |
| 19 | 18 | rspcev 3584 | . . . . . . . . . . 11 ⊢ ((suc 𝑛 ∈ On ∧ suc 𝑛 ≈ 𝐴) → ∃𝑦 ∈ On 𝑦 ≈ 𝐴) |
| 20 | 19 | ex 417 | . . . . . . . . . 10 ⊢ (suc 𝑛 ∈ On → (suc 𝑛 ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴)) |
| 21 | 16, 17, 20 | 3syl 19 | . . . . . . . . 9 ⊢ (𝑛 ∈ ω → (suc 𝑛 ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴)) |
| 22 | 21 | con3dimp 413 | . . . . . . . 8 ⊢ ((𝑛 ∈ ω ∧ ¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴) → ¬ suc 𝑛 ≈ 𝐴) |
| 23 | 22 | adantrr 729 | . . . . . . 7 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → ¬ suc 𝑛 ≈ 𝐴) |
| 24 | brsdom 8959 | . . . . . . 7 ⊢ (suc 𝑛 ≺ 𝐴 ↔ (suc 𝑛 ≼ 𝐴 ∧ ¬ suc 𝑛 ≈ 𝐴)) | |
| 25 | 15, 23, 24 | sylanbrc 594 | . . . . . 6 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → suc 𝑛 ≺ 𝐴) |
| 26 | 25 | exp32 425 | . . . . 5 ⊢ (𝑛 ∈ ω → (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (𝑛 ≺ 𝐴 → suc 𝑛 ≺ 𝐴))) |
| 27 | 1, 2, 3, 13, 26 | finds2 7883 | . . . 4 ⊢ (𝑥 ∈ ω → (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → 𝑥 ≺ 𝐴)) |
| 28 | 27 | com12 33 | . . 3 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (𝑥 ∈ ω → 𝑥 ≺ 𝐴)) |
| 29 | 28 | ralrimiv 3156 | . 2 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ∀𝑥 ∈ ω 𝑥 ≺ 𝐴) |
| 30 | omsson 7854 | . . 3 ⊢ ω ⊆ On | |
| 31 | ssrab 4027 | . . 3 ⊢ (ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴} ↔ (ω ⊆ On ∧ ∀𝑥 ∈ ω 𝑥 ≺ 𝐴)) | |
| 32 | 30, 31 | mpbiran 721 | . 2 ⊢ (ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴} ↔ ∀𝑥 ∈ ω 𝑥 ≺ 𝐴) |
| 33 | 29, 32 | sylibr 237 | 1 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∈ wcel 2145 ∀wral 3079 ∃wrex 3089 {crab 3417 Vcvv 3457 ⊆ wss 3907 ∅c0 4288 class class class wbr 5105 Oncon0 6350 suc csuc 6352 ωcom 7850 ≈ cen 8928 ≼ cdom 8929 ≺ csdm 8930 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-om 7851 df-1o 8441 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |