| 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 5780 | . . 3 ⊢ (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵) | |
| 2 | rankxpl.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
| 3 | rankxpl.2 | . . . . . . 7 ⊢ 𝐵 ∈ V | |
| 4 | 2, 3 | unex 7721 | . . . . . 6 ⊢ (𝐴 ∪ 𝐵) ∈ V |
| 5 | 4 | pwex 5336 | . . . . 5 ⊢ 𝒫 (𝐴 ∪ 𝐵) ∈ V |
| 6 | 5 | pwex 5336 | . . . 4 ⊢ 𝒫 𝒫 (𝐴 ∪ 𝐵) ∈ V |
| 7 | 6 | rankss 9802 | . . 3 ⊢ ((𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝐵) → (rank‘(𝐴 × 𝐵)) ⊆ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵))) |
| 8 | 1, 7 | ax-mp 5 | . 2 ⊢ (rank‘(𝐴 × 𝐵)) ⊆ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵)) |
| 9 | 5 | rankpw 9796 | . . 3 ⊢ (rank‘𝒫 𝒫 (𝐴 ∪ 𝐵)) = suc (rank‘𝒫 (𝐴 ∪ 𝐵)) |
| 10 | 4 | rankpw 9796 | . . . 4 ⊢ (rank‘𝒫 (𝐴 ∪ 𝐵)) = suc (rank‘(𝐴 ∪ 𝐵)) |
| 11 | suceq 6408 | . . . 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 1559 ∈ wcel 2141 Vcvv 3453 ∪ cun 3902 ⊆ wss 3904 𝒫 cpw 4554 × cxp 5643 suc csuc 6342 ‘cfv 6515 rankcrnk 9716 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 ax-reg 9535 ax-inf2 9591 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-ov 7393 df-om 7841 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-r1 9717 df-rank 9718 |
| This theorem is referenced by: rankfu 9830 rankmapu 9831 rankxplim3 9834 |
| Copyright terms: Public domain | W3C validator |