| 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 9790 | . . . . . 6 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → 𝐵 ⊆ ∪ (𝑅1 “ On)) | |
| 2 | 1 | sseld 3933 | . . . . 5 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → 𝐴 ∈ ∪ (𝑅1 “ On))) |
| 3 | rankidn 9807 | . . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴))) | |
| 4 | 2, 3 | syl6 36 | . . . 4 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴)))) |
| 5 | 4 | imp 412 | . . 3 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴))) |
| 6 | rankon 9780 | . . . . 5 ⊢ (rank‘𝐵) ∈ On | |
| 7 | rankon 9780 | . . . . 5 ⊢ (rank‘𝐴) ∈ On | |
| 8 | ontri1 6396 | . . . . 5 ⊢ (((rank‘𝐵) ∈ On ∧ (rank‘𝐴) ∈ On) → ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ¬ (rank‘𝐴) ∈ (rank‘𝐵))) | |
| 9 | 6, 7, 8 | mp2an 705 | . . . 4 ⊢ ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ¬ (rank‘𝐴) ∈ (rank‘𝐵)) |
| 10 | rankdmr1 9786 | . . . . . 6 ⊢ (rank‘𝐵) ∈ dom 𝑅1 | |
| 11 | rankdmr1 9786 | . . . . . 6 ⊢ (rank‘𝐴) ∈ dom 𝑅1 | |
| 12 | r1ord3g 9764 | . . . . . 6 ⊢ (((rank‘𝐵) ∈ dom 𝑅1 ∧ (rank‘𝐴) ∈ dom 𝑅1) → ((rank‘𝐵) ⊆ (rank‘𝐴) → (𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴)))) | |
| 13 | 10, 11, 12 | mp2an 705 | . . . . 5 ⊢ ((rank‘𝐵) ⊆ (rank‘𝐴) → (𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴))) |
| 14 | r1rankidb 9789 | . . . . . 6 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → 𝐵 ⊆ (𝑅1‘(rank‘𝐵))) | |
| 15 | 14 | sselda 3934 | . . . . 5 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ (𝑅1‘(rank‘𝐵))) |
| 16 | ssel 3928 | . . . . 5 ⊢ ((𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴)) → (𝐴 ∈ (𝑅1‘(rank‘𝐵)) → 𝐴 ∈ (𝑅1‘(rank‘𝐴)))) | |
| 17 | 13, 15, 16 | syl2imc 42 | . . . 4 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → ((rank‘𝐵) ⊆ (rank‘𝐴) → 𝐴 ∈ (𝑅1‘(rank‘𝐴)))) |
| 18 | 9, 17 | biimtrrid 246 | . . 3 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → (¬ (rank‘𝐴) ∈ (rank‘𝐵) → 𝐴 ∈ (𝑅1‘(rank‘𝐴)))) |
| 19 | 5, 18 | mt3d 149 | . 2 ⊢ ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → (rank‘𝐴) ∈ (rank‘𝐵)) |
| 20 | 19 | ex 418 | 1 ⊢ (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → (rank‘𝐴) ∈ (rank‘𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 ⊆ wss 3902 ∪ cuni 4870 dom cdm 5659 “ cima 5662 Oncon0 6361 ‘cfv 6537 𝑅1cr1 9747 rankcrnk 9748 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7419 df-om 7866 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-r1 9749 df-rank 9750 |
| This theorem is used by: wfelirr 9810 rankval3b 9811 rankel 9824 rankunb 9835 rankuni2b 9838 rankcf 10789 r1elcl 35592 rankval4b 35594 rankfilimb 35597 regsfromunir1 37146 rankrelp 45770 |
| Copyright terms: Public domain | W3C validator |