![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > r1elssi | Structured version Visualization version GIF version |
Description: The range of the 𝑅1 function is transitive. Lemma 2.10 of [Kunen] p. 97. One direction of r1elss 8968 that doesn't need 𝐴 to be a set. (Contributed by Mario Carneiro, 22-Mar-2013.) (Revised by Mario Carneiro, 16-Nov-2014.) |
Ref | Expression |
---|---|
r1elssi | ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ⊆ ∪ (𝑅1 “ On)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | triun 5002 | . . . 4 ⊢ (∀𝑥 ∈ On Tr (𝑅1‘𝑥) → Tr ∪ 𝑥 ∈ On (𝑅1‘𝑥)) | |
2 | r1tr 8938 | . . . . 5 ⊢ Tr (𝑅1‘𝑥) | |
3 | 2 | a1i 11 | . . . 4 ⊢ (𝑥 ∈ On → Tr (𝑅1‘𝑥)) |
4 | 1, 3 | mprg 3108 | . . 3 ⊢ Tr ∪ 𝑥 ∈ On (𝑅1‘𝑥) |
5 | r1funlim 8928 | . . . . . 6 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
6 | 5 | simpli 478 | . . . . 5 ⊢ Fun 𝑅1 |
7 | funiunfv 6780 | . . . . 5 ⊢ (Fun 𝑅1 → ∪ 𝑥 ∈ On (𝑅1‘𝑥) = ∪ (𝑅1 “ On)) | |
8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ ∪ 𝑥 ∈ On (𝑅1‘𝑥) = ∪ (𝑅1 “ On) |
9 | treq 4995 | . . . 4 ⊢ (∪ 𝑥 ∈ On (𝑅1‘𝑥) = ∪ (𝑅1 “ On) → (Tr ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ Tr ∪ (𝑅1 “ On))) | |
10 | 8, 9 | ax-mp 5 | . . 3 ⊢ (Tr ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ Tr ∪ (𝑅1 “ On)) |
11 | 4, 10 | mpbi 222 | . 2 ⊢ Tr ∪ (𝑅1 “ On) |
12 | trss 4998 | . 2 ⊢ (Tr ∪ (𝑅1 “ On) → (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ⊆ ∪ (𝑅1 “ On))) | |
13 | 11, 12 | ax-mp 5 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ⊆ ∪ (𝑅1 “ On)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 = wceq 1601 ∈ wcel 2107 ⊆ wss 3792 ∪ cuni 4673 ∪ ciun 4755 Tr wtr 4989 dom cdm 5357 “ cima 5360 Oncon0 5978 Lim wlim 5979 Fun wfun 6131 ‘cfv 6137 𝑅1cr1 8924 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-reu 3097 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4674 df-iun 4757 df-br 4889 df-opab 4951 df-mpt 4968 df-tr 4990 df-id 5263 df-eprel 5268 df-po 5276 df-so 5277 df-fr 5316 df-we 5318 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-pred 5935 df-ord 5981 df-on 5982 df-lim 5983 df-suc 5984 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-om 7346 df-wrecs 7691 df-recs 7753 df-rdg 7791 df-r1 8926 |
This theorem is referenced by: r1elss 8968 pwwf 8969 rankelb 8986 rankval3b 8988 r1pw 9007 rankuni2b 9015 tcwf 9045 tcrank 9046 hsmexlem4 9588 rankcf 9936 wfgru 9975 grur1 9979 |
Copyright terms: Public domain | W3C validator |