| 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 5796 | . . 3 ⊢ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵) | |
| 2 | rankxpl.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
| 3 | rankxpl.2 | . . . . . . 7 ⊢ 𝐵 ∈ V | |
| 4 | 2, 3 | unex 7742 | . . . . . 6 ⊢ (𝐴 ∪ 𝐵) ∈ V |
| 5 | 4 | pwex 5351 | . . . . 5 ⊢ 𝒫 (𝐴 ∪ 𝐵) ∈ V |
| 6 | 5 | pwex 5351 | . . . 4 ⊢ 𝒫 𝒫 (𝐴 ∪ 𝐵) ∈ V |
| 7 | 6 | rankss 9820 | . . 3 ⊢ ((𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵) → (rank‘(𝐴 × 𝐵)) ⊆ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵))) |
| 8 | 1, 7 | ax-mp 5 | . 2 ⊢ (rank‘(𝐴 × 𝐵)) ⊆ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵)) |
| 9 | 5 | rankpw 9814 | . . 3 ⊢ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵)) = suc (rank‘𝒫 (𝐴 ∪ 𝐵)) |
| 10 | 4 | rankpw 9814 | . . . 4 ⊢ (rank‘𝒫 (𝐴 ∪ 𝐵)) = suc (rank‘(𝐴 ∪ 𝐵)) |
| 11 | suceq 6429 | . . . 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 2784 | . 2 ⊢ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵)) = suc suc (rank‘(𝐴 ∪ 𝐵)) |
| 14 | 8, 13 | sseqtri 3984 | 1 ⊢ (rank‘(𝐴 × 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1568 ∈ wcel 2141 Vcvv 3453 ∪ cun 3902 ⊆ wss 3904 𝒫 cpw 4561 × cxp 5659 suc csuc 6362 ‘cfv 6536 rankcrnk 9734 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-reg 9553 ax-inf2 9609 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-r1 9735 df-rank 9736 |
| This theorem is referenced by: rankfu 9848 rankmapu 9849 rankxplim3 9852 |
| Copyright terms: Public domain | W3C validator |