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 9614 | . . . 4 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘(𝐴 ∪ 𝐵)) ∈ (rank‘(𝐶 ∪ 𝐷))) |
6 | 1, 2 | rankun 9598 | . . . 4 ⊢ (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)) |
7 | 3, 4 | rankun 9598 | . . . 4 ⊢ (rank‘(𝐶 ∪ 𝐷)) = ((rank‘𝐶) ∪ (rank‘𝐷)) |
8 | 5, 6, 7 | 3eltr3g 2856 | . . 3 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷))) |
9 | rankon 9537 | . . . . . 6 ⊢ (rank‘𝐶) ∈ On | |
10 | rankon 9537 | . . . . . 6 ⊢ (rank‘𝐷) ∈ On | |
11 | 9, 10 | onun2i 6379 | . . . . 5 ⊢ ((rank‘𝐶) ∪ (rank‘𝐷)) ∈ On |
12 | 11 | onordi 6368 | . . . 4 ⊢ Ord ((rank‘𝐶) ∪ (rank‘𝐷)) |
13 | ordsucelsuc 7657 | . . . 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 9599 | . 2 ⊢ (rank‘{𝐴, 𝐵}) = suc ((rank‘𝐴) ∪ (rank‘𝐵)) |
17 | 3, 4 | rankpr 9599 | . 2 ⊢ (rank‘{𝐶, 𝐷}) = suc ((rank‘𝐶) ∪ (rank‘𝐷)) |
18 | 15, 16, 17 | 3eltr4g 2857 | 1 ⊢ (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘{𝐴, 𝐵}) ∈ (rank‘{𝐶, 𝐷})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∈ wcel 2109 Vcvv 3430 ∪ cun 3889 {cpr 4568 Ord word 6262 suc csuc 6265 ‘cfv 6430 rankcrnk 9505 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-rep 5213 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 ax-reg 9312 ax-inf2 9360 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-pss 3910 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4845 df-int 4885 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-tr 5196 df-id 5488 df-eprel 5494 df-po 5502 df-so 5503 df-fr 5543 df-we 5545 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-pred 6199 df-ord 6266 df-on 6267 df-lim 6268 df-suc 6269 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-ov 7271 df-om 7701 df-2nd 7818 df-frecs 8081 df-wrecs 8112 df-recs 8186 df-rdg 8225 df-r1 9506 df-rank 9507 |
This theorem is referenced by: rankelop 9616 |
Copyright terms: Public domain | W3C validator |