| 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 9742 | . . . 4 ⊢ ∪ (𝑅1 “ On) = V | |
| 3 | 1, 2 | eleqtrri 2827 | . . 3 ⊢ 𝐴 ∈ ∪ (𝑅1 “ On) |
| 4 | r1fnon 9696 | . . . . . 6 ⊢ 𝑅1 Fn On | |
| 5 | fndm 6603 | . . . . . 6 ⊢ (𝑅1 Fn On → dom 𝑅1 = On) | |
| 6 | 4, 5 | ax-mp 5 | . . . . 5 ⊢ dom 𝑅1 = On |
| 7 | 6 | eleq2i 2820 | . . . 4 ⊢ (𝐵 ∈ dom 𝑅1 ↔ 𝐵 ∈ On) |
| 8 | 7 | biimpri 228 | . . 3 ⊢ (𝐵 ∈ On → 𝐵 ∈ dom 𝑅1) |
| 9 | rankr1clem 9749 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (¬ 𝐴 ∈ (𝑅1‘𝐵) ↔ 𝐵 ⊆ (rank‘𝐴))) | |
| 10 | 3, 8, 9 | sylancr 587 | . 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 1540 ∈ wcel 2109 Vcvv 3444 ⊆ wss 3911 ∪ cuni 4867 dom cdm 5631 “ cima 5634 Oncon0 6320 Fn wfn 6494 ‘cfv 6499 𝑅1cr1 9691 rankcrnk 9692 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-reg 9521 ax-inf2 9570 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 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 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-ov 7372 df-om 7823 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-r1 9693 df-rank 9694 |
| This theorem is referenced by: rankr1a 9765 onvf1odlem4 35086 |
| Copyright terms: Public domain | W3C validator |