![]() |
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 9864 | . . . 4 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘(𝐴 ∪ 𝐵)) ∈ (rank‘(𝐶 ∪ 𝐷))) |
6 | 1, 2 | rankun 9848 | . . . 4 ⊢ (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)) |
7 | 3, 4 | rankun 9848 | . . . 4 ⊢ (rank‘(𝐶 ∪ 𝐷)) = ((rank‘𝐶) ∪ (rank‘𝐷)) |
8 | 5, 6, 7 | 3eltr3g 2850 | . . 3 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) |
9 | rankon 9787 | . . . . . 6 ⊢ (rank‘𝐶) ∈ On | |
10 | rankon 9787 | . . . . . 6 ⊢ (rank‘𝐷) ∈ On | |
11 | 9, 10 | onun2i 6484 | . . . . 5 ⊢ ((rank‘𝐶) ∪ (rank‘𝐷)) ∈ On |
12 | 11 | onordi 6473 | . . . 4 ⊢ Ord ((rank‘𝐶) ∪ (rank‘𝐷)) |
13 | ordsucelsuc 7807 | . . . 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 217 | . 2 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → suc ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ suc ((rank‘𝐶) ∪ (rank‘𝐷))) |
16 | 1, 2 | rankpr 9849 | . 2 ⊢ (rank‘{𝐴, 𝐵}) = suc ((rank‘𝐴) ∪ (rank‘𝐵)) |
17 | 3, 4 | rankpr 9849 | . 2 ⊢ (rank‘{𝐶, 𝐷}) = suc ((rank‘𝐶) ∪ (rank‘𝐷)) |
18 | 15, 16, 17 | 3eltr4g 2851 | 1 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘{𝐴, 𝐵}) ∈ (rank‘{𝐶, 𝐷})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∈ wcel 2107 Vcvv 3475 ∪ cun 3946 {cpr 4630 Ord word 6361 suc csuc 6364 ‘cfv 6541 rankcrnk 9755 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-reg 9584 ax-inf2 9633 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-ov 7409 df-om 7853 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-r1 9756 df-rank 9757 |
This theorem is referenced by: rankelop 9866 |
Copyright terms: Public domain | W3C validator |