| 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 9777 | . . . . 5 ⊢ (rank‘𝐶) ∈ On | |
| 2 | rankon 9777 | . . . . 5 ⊢ (rank‘𝐷) ∈ On | |
| 3 | 1, 2 | onun2i 6481 | . . . 4 ⊢ ((rank‘𝐶) ∪ (rank‘𝐷)) ∈ On |
| 4 | 3 | onordi 6471 | . . 3 ⊢ Ord ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 5 | elun1 4128 | . . 3 ⊢ ((rank‘𝐴) ∈ (rank‘𝐶) → (rank‘𝐴) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) | |
| 6 | elun2 4129 | . . 3 ⊢ ((rank‘𝐵) ∈ (rank‘𝐷) → (rank‘𝐵) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) | |
| 7 | ordunel 7823 | . . 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 9838 | . 2 ⊢ (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)) |
| 12 | rankelun.3 | . . 3 ⊢ 𝐶 ∈ V | |
| 13 | rankelun.4 | . . 3 ⊢ 𝐷 ∈ V | |
| 14 | 12, 13 | rankun 9838 | . 2 ⊢ (rank‘(𝐶 ∪ 𝐷)) = ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 15 | 8, 11, 14 | 3eltr4g 2877 | 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 3450 ∪ cun 3897 Ord word 6356 ‘cfv 6533 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 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 7736 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 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-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 7416 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-r1 9746 df-rank 9747 |
| This theorem is used by: rankelpr 9855 rankxplim 9861 |
| Copyright terms: Public domain | W3C validator |