| Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > r1elcl | Structured version Visualization version GIF version | ||
| Description: Each set of the cumulative hierarchy is closed under membership. (Contributed by BTernaryTau, 30-Dec-2025.) |
| Ref | Expression |
|---|---|
| r1elcl | ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ (𝑅1‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r1elwf 9720 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)) | |
| 2 | rankelb 9748 | . . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝐶 ∈ 𝐴 → (rank‘𝐶) ∈ (rank‘𝐴))) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝐶 ∈ 𝐴 → (rank‘𝐶) ∈ (rank‘𝐴))) |
| 4 | 3 | imp 406 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → (rank‘𝐶) ∈ (rank‘𝐴)) |
| 5 | rankr1ai 9722 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) ∈ 𝐵) | |
| 6 | elfvdm 6876 | . . . . . . 7 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1) | |
| 7 | r1fnon 9691 | . . . . . . . 8 ⊢ 𝑅1 Fn On | |
| 8 | 7 | fndmi 6604 | . . . . . . 7 ⊢ dom 𝑅1 = On |
| 9 | 6, 8 | eleqtrdi 2847 | . . . . . 6 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On) |
| 10 | ontr1 6372 | . . . . . 6 ⊢ (𝐵 ∈ On → (((rank‘𝐶) ∈ (rank‘𝐴) ∧ (rank‘𝐴) ∈ 𝐵) → (rank‘𝐶) ∈ 𝐵)) | |
| 11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (((rank‘𝐶) ∈ (rank‘𝐴) ∧ (rank‘𝐴) ∈ 𝐵) → (rank‘𝐶) ∈ 𝐵)) |
| 12 | 5, 11 | mpan2d 695 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → ((rank‘𝐶) ∈ (rank‘𝐴) → (rank‘𝐶) ∈ 𝐵)) |
| 13 | 12 | adantr 480 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → ((rank‘𝐶) ∈ (rank‘𝐴) → (rank‘𝐶) ∈ 𝐵)) |
| 14 | 4, 13 | mpd 15 | . 2 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → (rank‘𝐶) ∈ 𝐵) |
| 15 | elwf 35272 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ ∪ (𝑅1 “ On)) | |
| 16 | 1, 15 | sylan 581 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ ∪ (𝑅1 “ On)) |
| 17 | rankr1ag 9726 | . . . . 5 ⊢ ((𝐶 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) | |
| 18 | 6, 17 | sylan2 594 | . . . 4 ⊢ ((𝐶 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ (𝑅1‘𝐵)) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) |
| 19 | 18 | ancoms 458 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ ∪ (𝑅1 “ On)) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) |
| 20 | 16, 19 | syldan 592 | . 2 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) |
| 21 | 14, 20 | mpbird 257 | 1 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ (𝑅1‘𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ∪ cuni 4865 dom cdm 5632 “ cima 5635 Oncon0 6325 ‘cfv 6500 𝑅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 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-r1 9688 df-rank 9689 |
| This theorem is referenced by: r1filim 35279 r1omhf 35281 |
| Copyright terms: Public domain | W3C validator |