| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankelb | Structured version Visualization version GIF version | ||
| Description: The membership relation is inherited by the rank function. Proposition 9.16 of [TakeutiZaring] p. 79. (Contributed by NM, 4-Oct-2003.) (Revised by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| rankelb | ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → (rank‘𝐴) ∈ (rank‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r1elssi 9718 | . . . . . 6 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → 𝐵 ⊆ ∪ (𝑅1 “ On)) | |
| 2 | 1 | sseld 3916 | . . . . 5 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → 𝐴 ∈ ∪ (𝑅1 “ On))) |
| 3 | rankidn 9735 | . . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴))) | |
| 4 | 2, 3 | syl6 35 | . . . 4 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴)))) |
| 5 | 4 | imp 406 | . . 3 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴))) |
| 6 | rankon 9708 | . . . . 5 ⊢ (rank‘𝐵) ∈ On | |
| 7 | rankon 9708 | . . . . 5 ⊢ (rank‘𝐴) ∈ On | |
| 8 | ontri1 6346 | . . . . 5 ⊢ (((rank‘𝐵) ∈ On ∧ (rank‘𝐴) ∈ On) → ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ¬ (rank‘𝐴) ∈ (rank‘𝐵))) | |
| 9 | 6, 7, 8 | mp2an 693 | . . . 4 ⊢ ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ¬ (rank‘𝐴) ∈ (rank‘𝐵)) |
| 10 | rankdmr1 9714 | . . . . . 6 ⊢ (rank‘𝐵) ∈ dom 𝑅1 | |
| 11 | rankdmr1 9714 | . . . . . 6 ⊢ (rank‘𝐴) ∈ dom 𝑅1 | |
| 12 | r1ord3g 9692 | . . . . . 6 ⊢ (((rank‘𝐵) ∈ dom 𝑅1 ∧ (rank‘𝐴) ∈ dom 𝑅1) → ((rank‘𝐵) ⊆ (rank‘𝐴) → (𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴)))) | |
| 13 | 10, 11, 12 | mp2an 693 | . . . . 5 ⊢ ((rank‘𝐵) ⊆ (rank‘𝐴) → (𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴))) |
| 14 | r1rankidb 9717 | . . . . . 6 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → 𝐵 ⊆ (𝑅1‘(rank‘𝐵))) | |
| 15 | 14 | sselda 3917 | . . . . 5 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ (𝑅1‘(rank‘𝐵))) |
| 16 | ssel 3911 | . . . . 5 ⊢ ((𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴)) → (𝐴 ∈ (𝑅1‘(rank‘𝐵)) → 𝐴 ∈ (𝑅1‘(rank‘𝐴)))) | |
| 17 | 13, 15, 16 | syl2imc 41 | . . . 4 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → ((rank‘𝐵) ⊆ (rank‘𝐴) → 𝐴 ∈ (𝑅1‘(rank‘𝐴)))) |
| 18 | 9, 17 | biimtrrid 243 | . . 3 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → (¬ (rank‘𝐴) ∈ (rank‘𝐵) → 𝐴 ∈ (𝑅1‘(rank‘𝐴)))) |
| 19 | 5, 18 | mt3d 148 | . 2 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → (rank‘𝐴) ∈ (rank‘𝐵)) |
| 20 | 19 | ex 412 | 1 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → (rank‘𝐴) ∈ (rank‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ⊆ wss 3885 ∪ cuni 4840 dom cdm 5620 “ cima 5623 Oncon0 6312 ‘cfv 6487 𝑅1cr1 9675 rankcrnk 9676 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-ral 3050 df-rex 3060 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-ov 7359 df-om 7807 df-2nd 7932 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-r1 9677 df-rank 9678 |
| This theorem is referenced by: wfelirr 9738 rankval3b 9739 rankel 9752 rankunb 9763 rankuni2b 9766 rankcf 10689 r1elcl 35229 rankval4b 35231 rankfilimb 35233 regsfromunir1 36710 rankrelp 45375 |
| Copyright terms: Public domain | W3C validator |