Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ssrankr1 | Structured version Visualization version GIF version |
Description: A relationship between an ordinal number less than or equal to a rank, and the cumulative hierarchy of sets 𝑅1. Proposition 9.15(3) of [TakeutiZaring] p. 79. (Contributed by NM, 8-Oct-2003.) (Revised by Mario Carneiro, 17-Nov-2014.) |
Ref | Expression |
---|---|
rankid.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
ssrankr1 | ⊢ (𝐵 ∈ On → (𝐵 ⊆ (rank‘𝐴) ↔ ¬ 𝐴 ∈ (𝑅1‘𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rankid.1 | . . . 4 ⊢ 𝐴 ∈ V | |
2 | unir1 9502 | . . . 4 ⊢ ∪ (𝑅1 “ On) = V | |
3 | 1, 2 | eleqtrri 2838 | . . 3 ⊢ 𝐴 ∈ ∪ (𝑅1 “ On) |
4 | r1fnon 9456 | . . . . . 6 ⊢ 𝑅1 Fn On | |
5 | fndm 6520 | . . . . . 6 ⊢ (𝑅1 Fn On → dom 𝑅1 = On) | |
6 | 4, 5 | ax-mp 5 | . . . . 5 ⊢ dom 𝑅1 = On |
7 | 6 | eleq2i 2830 | . . . 4 ⊢ (𝐵 ∈ dom 𝑅1 ↔ 𝐵 ∈ On) |
8 | 7 | biimpri 227 | . . 3 ⊢ (𝐵 ∈ On → 𝐵 ∈ dom 𝑅1) |
9 | rankr1clem 9509 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (¬ 𝐴 ∈ (𝑅1‘𝐵) ↔ 𝐵 ⊆ (rank‘𝐴))) | |
10 | 3, 8, 9 | sylancr 586 | . 2 ⊢ (𝐵 ∈ On → (¬ 𝐴 ∈ (𝑅1‘𝐵) ↔ 𝐵 ⊆ (rank‘𝐴))) |
11 | 10 | bicomd 222 | 1 ⊢ (𝐵 ∈ On → (𝐵 ⊆ (rank‘𝐴) ↔ ¬ 𝐴 ∈ (𝑅1‘𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ⊆ wss 3883 ∪ cuni 4836 dom cdm 5580 “ cima 5583 Oncon0 6251 Fn wfn 6413 ‘cfv 6418 𝑅1cr1 9451 rankcrnk 9452 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-reg 9281 ax-inf2 9329 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-r1 9453 df-rank 9454 |
This theorem is referenced by: rankr1a 9525 |
Copyright terms: Public domain | W3C validator |