| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankxpu | Structured version Visualization version GIF version | ||
| Description: An upper bound on the rank of a Cartesian product. (Contributed by NM, 18-Sep-2006.) |
| Ref | Expression |
|---|---|
| rankxpl.1 | ⊢ 𝐴 ∈ V |
| rankxpl.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| rankxpu | ⊢ (rank‘(𝐴 × 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpsspw 5801 | . . 3 ⊢ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵) | |
| 2 | rankxpl.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
| 3 | rankxpl.2 | . . . . . . 7 ⊢ 𝐵 ∈ V | |
| 4 | 2, 3 | unex 7755 | . . . . . 6 ⊢ (𝐴 ∪ 𝐵) ∈ V |
| 5 | 4 | pwex 5356 | . . . . 5 ⊢ 𝒫 (𝐴 ∪ 𝐵) ∈ V |
| 6 | 5 | pwex 5356 | . . . 4 ⊢ 𝒫 𝒫 (𝐴 ∪ 𝐵) ∈ V |
| 7 | 6 | rankss 9831 | . . 3 ⊢ ((𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵) → (rank‘(𝐴 × 𝐵)) ⊆ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵))) |
| 8 | 1, 7 | ax-mp 5 | . 2 ⊢ (rank‘(𝐴 × 𝐵)) ⊆ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵)) |
| 9 | 5 | rankpw 9825 | . . 3 ⊢ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵)) = suc (rank‘𝒫 (𝐴 ∪ 𝐵)) |
| 10 | 4 | rankpw 9825 | . . . 4 ⊢ (rank‘𝒫 (𝐴 ∪ 𝐵)) = suc (rank‘(𝐴 ∪ 𝐵)) |
| 11 | suceq 6436 | . . . 4 ⊢ ((rank‘𝒫 (𝐴 ∪ 𝐵)) = suc (rank‘(𝐴 ∪ 𝐵)) → suc (rank‘𝒫 (𝐴 ∪ 𝐵)) = suc suc (rank‘(𝐴 ∪ 𝐵))) | |
| 12 | 10, 11 | ax-mp 5 | . . 3 ⊢ suc (rank‘𝒫 (𝐴 ∪ 𝐵)) = suc suc (rank‘(𝐴 ∪ 𝐵)) |
| 13 | 9, 12 | eqtri 2789 | . 2 ⊢ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵)) = suc suc (rank‘(𝐴 ∪ 𝐵)) |
| 14 | 8, 13 | sseqtri 3988 | 1 ⊢ (rank‘(𝐴 × 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 Vcvv 3458 ∪ cun 3906 ⊆ wss 3908 𝒫 cpw 4567 × cxp 5664 suc csuc 6369 ‘cfv 6543 rankcrnk 9745 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-reg 9564 ax-inf2 9620 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-r1 9746 df-rank 9747 |
| This theorem is used by: rankfu 9859 rankmapu 9860 rankxplim3 9863 |
| Copyright terms: Public domain | W3C validator |