| 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 9778 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)) | |
| 2 | rankelb 9806 | . . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝐶 ∈ 𝐴 → (rank‘𝐶) ∈ (rank‘𝐴))) | |
| 3 | 1, 2 | syl 18 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝐶 ∈ 𝐴 → (rank‘𝐶) ∈ (rank‘𝐴))) |
| 4 | 3 | imp 412 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → (rank‘𝐶) ∈ (rank‘𝐴)) |
| 5 | rankr1ai 9780 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) ∈ 𝐵) | |
| 6 | elfvdm 6922 | . . . . . . 7 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1) | |
| 7 | r1fnon 9749 | . . . . . . . 8 ⊢ 𝑅1 Fn On | |
| 8 | 7 | fndmi 6646 | . . . . . . 7 ⊢ dom 𝑅1 = On |
| 9 | 6, 8 | eleqtrdi 2876 | . . . . . 6 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On) |
| 10 | ontr1 6415 | . . . . . 6 ⊢ (𝐵 ∈ On → (((rank‘𝐶) ∈ (rank‘𝐴) ∧ (rank‘𝐴) ∈ 𝐵) → (rank‘𝐶) ∈ 𝐵)) | |
| 11 | 9, 10 | syl 18 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (((rank‘𝐶) ∈ (rank‘𝐴) ∧ (rank‘𝐴) ∈ 𝐵) → (rank‘𝐶) ∈ 𝐵)) |
| 12 | 5, 11 | mpan2d 707 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → ((rank‘𝐶) ∈ (rank‘𝐴) → (rank‘𝐶) ∈ 𝐵)) |
| 13 | 12 | adantr 486 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → ((rank‘𝐶) ∈ (rank‘𝐴) → (rank‘𝐶) ∈ 𝐵)) |
| 14 | 4, 13 | mpd 16 | . 2 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → (rank‘𝐶) ∈ 𝐵) |
| 15 | elwf 35515 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ ∪ (𝑅1 “ On)) | |
| 16 | 1, 15 | sylan 592 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ ∪ (𝑅1 “ On)) |
| 17 | rankr1ag 9784 | . . . . 5 ⊢ ((𝐶 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) | |
| 18 | 6, 17 | sylan2 605 | . . . 4 ⊢ ((𝐶 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ (𝑅1‘𝐵)) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) |
| 19 | 18 | ancoms 464 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ ∪ (𝑅1 “ On)) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) |
| 20 | 16, 19 | syldan 603 | . 2 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) |
| 21 | 14, 20 | mpbird 260 | 1 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ (𝑅1‘𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2146 ∪ cuni 4877 dom cdm 5666 “ cima 5669 Oncon0 6367 ‘cfv 6543 𝑅1cr1 9744 rankcrnk 9745 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-r1 9746 df-rank 9747 |
| This theorem is used by: r1filim 35523 r1omhf 35525 |
| Copyright terms: Public domain | W3C validator |