| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankelpr | Structured version Visualization version GIF version | ||
| Description: Rank membership is inherited by unordered pairs. (Contributed by NM, 18-Sep-2006.) (Revised by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| rankelun.1 | ⊢ 𝐴 ∈ V |
| rankelun.2 | ⊢ 𝐵 ∈ V |
| rankelun.3 | ⊢ 𝐶 ∈ V |
| rankelun.4 | ⊢ 𝐷 ∈ V |
| Ref | Expression |
|---|---|
| rankelpr | ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘{𝐴, 𝐵}) ∈ (rank‘{𝐶, 𝐷})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rankelun.1 | . . . . 5 ⊢ 𝐴 ∈ V | |
| 2 | rankelun.2 | . . . . 5 ⊢ 𝐵 ∈ V | |
| 3 | rankelun.3 | . . . . 5 ⊢ 𝐶 ∈ V | |
| 4 | rankelun.4 | . . . . 5 ⊢ 𝐷 ∈ V | |
| 5 | 1, 2, 3, 4 | rankelun 9889 | . . . 4 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘(𝐴 ∪ 𝐵)) ∈ (rank‘(𝐶 ∪ 𝐷))) |
| 6 | 1, 2 | rankun 9870 | . . . 4 ⊢ (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)) |
| 7 | 3, 4 | rankun 9870 | . . . 4 ⊢ (rank‘(𝐶 ∪ 𝐷)) = ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 8 | 5, 6, 7 | 3eltr3g 2876 | . . 3 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) |
| 9 | rankon 9803 | . . . . . 6 ⊢ (rank‘𝐶) ∈ On | |
| 10 | rankon 9803 | . . . . . 6 ⊢ (rank‘𝐷) ∈ On | |
| 11 | 9, 10 | onun2i 6486 | . . . . 5 ⊢ ((rank‘𝐶) ∪ (rank‘𝐷)) ∈ On |
| 12 | 11 | onordi 6476 | . . . 4 ⊢ Ord ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 13 | ordsucelsuc 7833 | . . . 4 ⊢ (Ord ((rank‘𝐶) ∪ (rank‘𝐷)) → (((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷)) ↔ suc ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ suc ((rank‘𝐶) ∪ (rank‘𝐷)))) | |
| 14 | 12, 13 | ax-mp 5 | . . 3 ⊢ (((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷)) ↔ suc ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ suc ((rank‘𝐶) ∪ (rank‘𝐷))) |
| 15 | 8, 14 | sylib 221 | . 2 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → suc ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ suc ((rank‘𝐶) ∪ (rank‘𝐷))) |
| 16 | 1, 2 | rankpr 9871 | . 2 ⊢ (rank‘{𝐴, 𝐵}) = suc ((rank‘𝐴) ∪ (rank‘𝐵)) |
| 17 | 3, 4 | rankpr 9871 | . 2 ⊢ (rank‘{𝐶, 𝐷}) = suc ((rank‘𝐶) ∪ (rank‘𝐷)) |
| 18 | 15, 16, 17 | 3eltr4g 2877 | 1 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘{𝐴, 𝐵}) ∈ (rank‘{𝐶, 𝐷})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2144 Vcvv 3450 ∪ cun 4149 {cpr 4585 Ord word 6361 suc csuc 6364 ‘cfv 6538 rankcrnk 9767 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-reg 9586 ax-inf2 9642 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-r1 9768 df-rank 9769 |
| This theorem is used by: rankelop 9891 |
| Copyright terms: Public domain | W3C validator |