| 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 9708 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)) | |
| 2 | rankelb 9736 | . . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝐶 ∈ 𝐴 → (rank‘𝐶) ∈ (rank‘𝐴))) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝐶 ∈ 𝐴 → (rank‘𝐶) ∈ (rank‘𝐴))) |
| 4 | 3 | imp 406 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → (rank‘𝐶) ∈ (rank‘𝐴)) |
| 5 | rankr1ai 9710 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) ∈ 𝐵) | |
| 6 | elfvdm 6868 | . . . . . . 7 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1) | |
| 7 | r1fnon 9679 | . . . . . . . 8 ⊢ 𝑅1 Fn On | |
| 8 | 7 | fndmi 6596 | . . . . . . 7 ⊢ dom 𝑅1 = On |
| 9 | 6, 8 | eleqtrdi 2846 | . . . . . 6 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On) |
| 10 | ontr1 6364 | . . . . . 6 ⊢ (𝐵 ∈ On → (((rank‘𝐶) ∈ (rank‘𝐴) ∧ (rank‘𝐴) ∈ 𝐵) → (rank‘𝐶) ∈ 𝐵)) | |
| 11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (((rank‘𝐶) ∈ (rank‘𝐴) ∧ (rank‘𝐴) ∈ 𝐵) → (rank‘𝐶) ∈ 𝐵)) |
| 12 | 5, 11 | mpan2d 694 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → ((rank‘𝐶) ∈ (rank‘𝐴) → (rank‘𝐶) ∈ 𝐵)) |
| 13 | 12 | adantr 480 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → ((rank‘𝐶) ∈ (rank‘𝐴) → (rank‘𝐶) ∈ 𝐵)) |
| 14 | 4, 13 | mpd 15 | . 2 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → (rank‘𝐶) ∈ 𝐵) |
| 15 | elwf 35253 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ ∪ (𝑅1 “ On)) | |
| 16 | 1, 15 | sylan 580 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ ∪ (𝑅1 “ On)) |
| 17 | rankr1ag 9714 | . . . . 5 ⊢ ((𝐶 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) | |
| 18 | 6, 17 | sylan2 593 | . . . 4 ⊢ ((𝐶 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ (𝑅1‘𝐵)) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) |
| 19 | 18 | ancoms 458 | . . 3 ⊢ ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝐶 ∈ ∪ (𝑅1 “ On)) → (𝐶 ∈ (𝑅1‘𝐵) ↔ (rank‘𝐶) ∈ 𝐵)) |
| 20 | 16, 19 | syldan 591 | . 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 2113 ∪ cuni 4863 dom cdm 5624 “ cima 5627 Oncon0 6317 ‘cfv 6492 𝑅1cr1 9674 rankcrnk 9675 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-r1 9676 df-rank 9677 |
| This theorem is referenced by: r1filim 35260 r1omhf 35262 |
| Copyright terms: Public domain | W3C validator |