Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > r1elss | Structured version Visualization version GIF version |
Description: The range of the 𝑅1 function is transitive. Lemma 2.10 of [Kunen] p. 97. (Contributed by Mario Carneiro, 22-Mar-2013.) (Revised by Mario Carneiro, 16-Nov-2014.) |
Ref | Expression |
---|---|
r1elss.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
r1elss | ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝐴 ⊆ ∪ (𝑅1 “ On)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r1elssi 9234 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ⊆ ∪ (𝑅1 “ On)) | |
2 | r1elss.1 | . . . 4 ⊢ 𝐴 ∈ V | |
3 | 2 | tz9.12 9219 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)) |
4 | dfss3 3956 | . . . 4 ⊢ (𝐴 ⊆ ∪ (𝑅1 “ On) ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ ∪ (𝑅1 “ On)) | |
5 | r1fnon 9196 | . . . . . . . 8 ⊢ 𝑅1 Fn On | |
6 | fnfun 6453 | . . . . . . . 8 ⊢ (𝑅1 Fn On → Fun 𝑅1) | |
7 | funiunfv 7007 | . . . . . . . 8 ⊢ (Fun 𝑅1 → ∪ 𝑥 ∈ On (𝑅1‘𝑥) = ∪ (𝑅1 “ On)) | |
8 | 5, 6, 7 | mp2b 10 | . . . . . . 7 ⊢ ∪ 𝑥 ∈ On (𝑅1‘𝑥) = ∪ (𝑅1 “ On) |
9 | 8 | eleq2i 2904 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ 𝑦 ∈ ∪ (𝑅1 “ On)) |
10 | eliun 4923 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥)) | |
11 | 9, 10 | bitr3i 279 | . . . . 5 ⊢ (𝑦 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥)) |
12 | 11 | ralbii 3165 | . . . 4 ⊢ (∀𝑦 ∈ 𝐴 𝑦 ∈ ∪ (𝑅1 “ On) ↔ ∀𝑦 ∈ 𝐴 ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥)) |
13 | 4, 12 | bitri 277 | . . 3 ⊢ (𝐴 ⊆ ∪ (𝑅1 “ On) ↔ ∀𝑦 ∈ 𝐴 ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥)) |
14 | 8 | eleq2i 2904 | . . . 4 ⊢ (𝐴 ∈ ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ 𝐴 ∈ ∪ (𝑅1 “ On)) |
15 | eliun 4923 | . . . 4 ⊢ (𝐴 ∈ ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)) | |
16 | 14, 15 | bitr3i 279 | . . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)) |
17 | 3, 13, 16 | 3imtr4i 294 | . 2 ⊢ (𝐴 ⊆ ∪ (𝑅1 “ On) → 𝐴 ∈ ∪ (𝑅1 “ On)) |
18 | 1, 17 | impbii 211 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝐴 ⊆ ∪ (𝑅1 “ On)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 = wceq 1537 ∈ wcel 2114 ∀wral 3138 ∃wrex 3139 Vcvv 3494 ⊆ wss 3936 ∪ cuni 4838 ∪ ciun 4919 “ cima 5558 Oncon0 6191 Fun wfun 6349 Fn wfn 6350 ‘cfv 6355 𝑅1cr1 9191 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-r1 9193 |
This theorem is referenced by: unir1 9242 tcwf 9312 tcrank 9313 rankcf 10199 wfgru 10238 |
Copyright terms: Public domain | W3C validator |