![]() |
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 9829 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ⊆ ∪ (𝑅1 “ On)) | |
2 | r1elss.1 | . . . 4 ⊢ 𝐴 ∈ V | |
3 | 2 | tz9.12 9814 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)) |
4 | dfss3 3968 | . . . 4 ⊢ (𝐴 ⊆ ∪ (𝑅1 “ On) ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ ∪ (𝑅1 “ On)) | |
5 | r1fnon 9791 | . . . . . . . 8 ⊢ 𝑅1 Fn On | |
6 | fnfun 6654 | . . . . . . . 8 ⊢ (𝑅1 Fn On → Fun 𝑅1) | |
7 | funiunfv 7258 | . . . . . . . 8 ⊢ (Fun 𝑅1 → ∪ 𝑥 ∈ On (𝑅1‘𝑥) = ∪ (𝑅1 “ On)) | |
8 | 5, 6, 7 | mp2b 10 | . . . . . . 7 ⊢ ∪ 𝑥 ∈ On (𝑅1‘𝑥) = ∪ (𝑅1 “ On) |
9 | 8 | eleq2i 2821 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ 𝑦 ∈ ∪ (𝑅1 “ On)) |
10 | eliun 5000 | . . . . . 6 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥)) | |
11 | 9, 10 | bitr3i 277 | . . . . 5 ⊢ (𝑦 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥)) |
12 | 11 | ralbii 3090 | . . . 4 ⊢ (∀𝑦 ∈ 𝐴 𝑦 ∈ ∪ (𝑅1 “ On) ↔ ∀𝑦 ∈ 𝐴 ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥)) |
13 | 4, 12 | bitri 275 | . . 3 ⊢ (𝐴 ⊆ ∪ (𝑅1 “ On) ↔ ∀𝑦 ∈ 𝐴 ∃𝑥 ∈ On 𝑦 ∈ (𝑅1‘𝑥)) |
14 | 8 | eleq2i 2821 | . . . 4 ⊢ (𝐴 ∈ ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ 𝐴 ∈ ∪ (𝑅1 “ On)) |
15 | eliun 5000 | . . . 4 ⊢ (𝐴 ∈ ∪ 𝑥 ∈ On (𝑅1‘𝑥) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)) | |
16 | 14, 15 | bitr3i 277 | . . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)) |
17 | 3, 13, 16 | 3imtr4i 292 | . 2 ⊢ (𝐴 ⊆ ∪ (𝑅1 “ On) → 𝐴 ∈ ∪ (𝑅1 “ On)) |
18 | 1, 17 | impbii 208 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝐴 ⊆ ∪ (𝑅1 “ On)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1534 ∈ wcel 2099 ∀wral 3058 ∃wrex 3067 Vcvv 3471 ⊆ wss 3947 ∪ cuni 4908 ∪ ciun 4996 “ cima 5681 Oncon0 6369 Fun wfun 6542 Fn wfn 6543 ‘cfv 6548 𝑅1cr1 9786 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-ov 7423 df-om 7871 df-2nd 7994 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-r1 9788 |
This theorem is referenced by: unir1 9837 tcwf 9907 tcrank 9908 rankcf 10801 wfgru 10840 |
Copyright terms: Public domain | W3C validator |