| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankelun | Structured version Visualization version GIF version | ||
| Description: Rank membership is inherited by union. (Contributed by NM, 18-Sep-2006.) (Proof shortened by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| rankelun.1 | ⊢ 𝐴 ∈ V |
| rankelun.2 | ⊢ 𝐵 ∈ V |
| rankelun.3 | ⊢ 𝐶 ∈ V |
| rankelun.4 | ⊢ 𝐷 ∈ V |
| Ref | Expression |
|---|---|
| rankelun | ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘(𝐴 ∪ 𝐵)) ∈ (rank‘(𝐶 ∪ 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rankon 9796 | . . . . 5 ⊢ (rank‘𝐶) ∈ On | |
| 2 | rankon 9796 | . . . . 5 ⊢ (rank‘𝐷) ∈ On | |
| 3 | 1, 2 | onun2i 6485 | . . . 4 ⊢ ((rank‘𝐶) ∪ (rank‘𝐷)) ∈ On |
| 4 | 3 | onordi 6475 | . . 3 ⊢ Ord ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 5 | elun1 4128 | . . 3 ⊢ ((rank‘𝐴) ∈ (rank‘𝐶) → (rank‘𝐴) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) | |
| 6 | elun2 4129 | . . 3 ⊢ ((rank‘𝐵) ∈ (rank‘𝐷) → (rank‘𝐵) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) | |
| 7 | ordunel 7836 | . . 3 ⊢ ((Ord ((rank‘𝐶) ∪ (rank‘𝐷)) ∧ (rank‘𝐴) ∈ ((rank‘𝐶) ∪ (rank‘𝐷)) ∧ (rank‘𝐵) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) | |
| 8 | 4, 5, 6, 7 | mp3an3an 1496 | . 2 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) |
| 9 | rankelun.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 10 | rankelun.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 11 | 9, 10 | rankun 9863 | . 2 ⊢ (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)) |
| 12 | rankelun.3 | . . 3 ⊢ 𝐶 ∈ V | |
| 13 | rankelun.4 | . . 3 ⊢ 𝐷 ∈ V | |
| 14 | 12, 13 | rankun 9863 | . 2 ⊢ (rank‘(𝐶 ∪ 𝐷)) = ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 15 | 8, 11, 14 | 3eltr4g 2878 | 1 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘(𝐴 ∪ 𝐵)) ∈ (rank‘(𝐶 ∪ 𝐷))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2145 Vcvv 3451 ∪ cun 3897 Ord word 6360 ‘cfv 6537 rankcrnk 9760 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-reg 9579 ax-inf2 9635 |
| 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 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 3367 df-rab 3414 df-v 3453 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-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7421 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-r1 9761 df-rank 9762 |
| This theorem is used by: rankelpr 9883 rankxplim 9889 |
| Copyright terms: Public domain | W3C validator |