Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rankr1ag | Structured version Visualization version GIF version |
Description: A version of rankr1a 8582 that is suitable without assuming Regularity or Replacement. (Contributed by Mario Carneiro, 3-Jun-2013.) (Revised by Mario Carneiro, 17-Nov-2014.) |
Ref | Expression |
---|---|
rankr1ag | ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐴) ∈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rankr1ai 8544 | . 2 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) ∈ 𝐵) | |
2 | r1funlim 8512 | . . . . . . . 8 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
3 | 2 | simpri 477 | . . . . . . 7 ⊢ Lim dom 𝑅1 |
4 | limord 5701 | . . . . . . 7 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1) | |
5 | 3, 4 | ax-mp 5 | . . . . . 6 ⊢ Ord dom 𝑅1 |
6 | ordelord 5662 | . . . . . 6 ⊢ ((Ord dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → Ord 𝐵) | |
7 | 5, 6 | mpan 702 | . . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 → Ord 𝐵) |
8 | 7 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → Ord 𝐵) |
9 | ordsucss 6910 | . . . 4 ⊢ (Ord 𝐵 → ((rank‘𝐴) ∈ 𝐵 → suc (rank‘𝐴) ⊆ 𝐵)) | |
10 | 8, 9 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → ((rank‘𝐴) ∈ 𝐵 → suc (rank‘𝐴) ⊆ 𝐵)) |
11 | rankidb 8546 | . . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) | |
12 | elfvdm 6130 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘suc (rank‘𝐴)) → suc (rank‘𝐴) ∈ dom 𝑅1) | |
13 | 11, 12 | syl 17 | . . . 4 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → suc (rank‘𝐴) ∈ dom 𝑅1) |
14 | r1ord3g 8525 | . . . 4 ⊢ ((suc (rank‘𝐴) ∈ dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → (suc (rank‘𝐴) ⊆ 𝐵 → (𝑅1‘suc (rank‘𝐴)) ⊆ (𝑅1‘𝐵))) | |
15 | 13, 14 | sylan 487 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (suc (rank‘𝐴) ⊆ 𝐵 → (𝑅1‘suc (rank‘𝐴)) ⊆ (𝑅1‘𝐵))) |
16 | 11 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) |
17 | ssel 3562 | . . . 4 ⊢ ((𝑅1‘suc (rank‘𝐴)) ⊆ (𝑅1‘𝐵) → (𝐴 ∈ (𝑅1‘suc (rank‘𝐴)) → 𝐴 ∈ (𝑅1‘𝐵))) | |
18 | 16, 17 | syl5com 31 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → ((𝑅1‘suc (rank‘𝐴)) ⊆ (𝑅1‘𝐵) → 𝐴 ∈ (𝑅1‘𝐵))) |
19 | 10, 15, 18 | 3syld 58 | . 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → ((rank‘𝐴) ∈ 𝐵 → 𝐴 ∈ (𝑅1‘𝐵))) |
20 | 1, 19 | impbid2 215 | 1 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐴) ∈ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∈ wcel 1977 ⊆ wss 3540 ∪ cuni 4372 dom cdm 5038 “ cima 5041 Ord word 5639 Oncon0 5640 Lim wlim 5641 suc csuc 5642 Fun wfun 5798 ‘cfv 5804 𝑅1cr1 8508 rankcrnk 8509 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-r1 8510 df-rank 8511 |
This theorem is referenced by: rankr1bg 8549 rankr1clem 8566 rankr1c 8567 rankval3b 8572 onssr1 8577 r1pw 8591 r1pwcl 8593 hsmexlem6 9136 r1limwun 9437 inatsk 9479 grur1 9521 |
Copyright terms: Public domain | W3C validator |