| 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 9737 | . . . 4 ⊢ ∪ (𝑅1 “ On) = V | |
| 3 | 1, 2 | eleqtrri 2835 | . . 3 ⊢ 𝐴 ∈ ∪ (𝑅1 “ On) |
| 4 | r1fnon 9691 | . . . . . 6 ⊢ 𝑅1 Fn On | |
| 5 | fndm 6601 | . . . . . 6 ⊢ (𝑅1 Fn On → dom 𝑅1 = On) | |
| 6 | 4, 5 | ax-mp 5 | . . . . 5 ⊢ dom 𝑅1 = On |
| 7 | 6 | eleq2i 2828 | . . . 4 ⊢ (𝐵 ∈ dom 𝑅1 ↔ 𝐵 ∈ On) |
| 8 | 7 | biimpri 228 | . . 3 ⊢ (𝐵 ∈ On → 𝐵 ∈ dom 𝑅1) |
| 9 | rankr1clem 9744 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (¬ 𝐴 ∈ (𝑅1‘𝐵) ↔ 𝐵 ⊆ (rank‘𝐴))) | |
| 10 | 3, 8, 9 | sylancr 588 | . 2 ⊢ (𝐵 ∈ On → (¬ 𝐴 ∈ (𝑅1‘𝐵) ↔ 𝐵 ⊆ (rank‘𝐴))) |
| 11 | 10 | bicomd 223 | 1 ⊢ (𝐵 ∈ On → (𝐵 ⊆ (rank‘𝐴) ↔ ¬ 𝐴 ∈ (𝑅1‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 Vcvv 3429 ⊆ wss 3889 ∪ cuni 4850 dom cdm 5631 “ cima 5634 Oncon0 6323 Fn wfn 6493 ‘cfv 6498 𝑅1cr1 9686 rankcrnk 9687 |
| 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 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-reg 9507 ax-inf2 9562 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-r1 9688 df-rank 9689 |
| This theorem is referenced by: rankr1a 9760 onvf1odlem4 35288 |
| Copyright terms: Public domain | W3C validator |