| 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 9774 | . . . . 5 ⊢ (rank‘𝐶) ∈ On | |
| 2 | rankon 9774 | . . . . 5 ⊢ (rank‘𝐷) ∈ On | |
| 3 | 1, 2 | onun2i 6488 | . . . 4 ⊢ ((rank‘𝐶) ∪ (rank‘𝐷)) ∈ On |
| 4 | 3 | onordi 6478 | . . 3 ⊢ Ord ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 5 | elun1 4135 | . . 3 ⊢ ((rank‘𝐴) ∈ (rank‘𝐶) → (rank‘𝐴) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) | |
| 6 | elun2 4136 | . . 3 ⊢ ((rank‘𝐵) ∈ (rank‘𝐷) → (rank‘𝐵) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) | |
| 7 | ordunel 7829 | . . 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 9835 | . 2 ⊢ (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)) |
| 12 | rankelun.3 | . . 3 ⊢ 𝐶 ∈ V | |
| 13 | rankelun.4 | . . 3 ⊢ 𝐷 ∈ V | |
| 14 | 12, 13 | rankun 9835 | . 2 ⊢ (rank‘(𝐶 ∪ 𝐷)) = ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 15 | 8, 11, 14 | 3eltr4g 2882 | 1 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘(𝐴 ∪ 𝐵)) ∈ (rank‘(𝐶 ∪ 𝐷))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2146 Vcvv 3457 ∪ cun 3904 Ord word 6363 ‘cfv 6540 rankcrnk 9742 |
| 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 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-reg 9561 ax-inf2 9617 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-r1 9743 df-rank 9744 |
| This theorem is used by: rankelpr 9852 rankxplim 9858 |
| Copyright terms: Public domain | W3C validator |