| Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rankkardu | Structured version Visualization version GIF version | ||
| Description: An upper bound on the rank of a kard cardinal. (Contributed by BTernaryTau, 4-Jul-2026.) |
| Ref | Expression |
|---|---|
| rankkardu | ⊢ (rank‘(kard‘𝐴)) ⊆ suc (rank‘𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | kardval 35681 | . . . 4 ⊢ (kard‘𝐴) = Scott {𝑥 ∣ 𝑥 ≈ 𝐴} | |
| 2 | 1 | fveq2i 6882 | . . 3 ⊢ (rank‘(kard‘𝐴)) = (rank‘Scott {𝑥 ∣ 𝑥 ≈ 𝐴}) |
| 3 | enrefg 8993 | . . . . 5 ⊢ (𝐴 ∈ V → 𝐴 ≈ 𝐴) | |
| 4 | breq1 5106 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝐴 ↔ 𝐴 ≈ 𝐴)) | |
| 5 | 4 | elabg 3630 | . . . . 5 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝑥 ∣ 𝑥 ≈ 𝐴} ↔ 𝐴 ≈ 𝐴)) |
| 6 | 3, 5 | mpbird 260 | . . . 4 ⊢ (𝐴 ∈ V → 𝐴 ∈ {𝑥 ∣ 𝑥 ≈ 𝐴}) |
| 7 | rankscottu 35639 | . . . 4 ⊢ (𝐴 ∈ {𝑥 ∣ 𝑥 ≈ 𝐴} → (rank‘Scott {𝑥 ∣ 𝑥 ≈ 𝐴}) ⊆ suc (rank‘𝐴)) | |
| 8 | 6, 7 | syl 18 | . . 3 ⊢ (𝐴 ∈ V → (rank‘Scott {𝑥 ∣ 𝑥 ≈ 𝐴}) ⊆ suc (rank‘𝐴)) |
| 9 | 2, 8 | eqsstrid 3969 | . 2 ⊢ (𝐴 ∈ V → (rank‘(kard‘𝐴)) ⊆ suc (rank‘𝐴)) |
| 10 | kardeq0 35685 | . . 3 ⊢ ((kard‘𝐴) = ∅ ↔ ¬ 𝐴 ∈ V) | |
| 11 | fvex 6892 | . . . . 5 ⊢ (kard‘𝐴) ∈ V | |
| 12 | 11 | rankeq0 9846 | . . . 4 ⊢ ((kard‘𝐴) = ∅ ↔ (rank‘(kard‘𝐴)) = ∅) |
| 13 | 0ss 4350 | . . . . 5 ⊢ ∅ ⊆ suc (rank‘𝐴) | |
| 14 | sseq1 3956 | . . . . 5 ⊢ ((rank‘(kard‘𝐴)) = ∅ → ((rank‘(kard‘𝐴)) ⊆ suc (rank‘𝐴) ↔ ∅ ⊆ suc (rank‘𝐴))) | |
| 15 | 13, 14 | mpbiri 261 | . . . 4 ⊢ ((rank‘(kard‘𝐴)) = ∅ → (rank‘(kard‘𝐴)) ⊆ suc (rank‘𝐴)) |
| 16 | 12, 15 | sylbi 220 | . . 3 ⊢ ((kard‘𝐴) = ∅ → (rank‘(kard‘𝐴)) ⊆ suc (rank‘𝐴)) |
| 17 | 10, 16 | sylbir 238 | . 2 ⊢ (¬ 𝐴 ∈ V → (rank‘(kard‘𝐴)) ⊆ suc (rank‘𝐴)) |
| 18 | 9, 17 | pm2.61i 184 | 1 ⊢ (rank‘(kard‘𝐴)) ⊆ suc (rank‘𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2145 {cab 2738 Vcvv 3450 ⊆ wss 3899 ∅c0 4279 class class class wbr 5103 suc csuc 6359 ‘cfv 6533 ≈ cen 8952 rankcrnk 9748 Scott cscott 9870 kardckard 35678 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-reg 9567 ax-inf2 9623 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-om 7864 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-en 8956 df-r1 9749 df-rank 9750 df-scott 9871 df-kard 35679 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |