Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > grutsk | Structured version Visualization version GIF version |
Description: Grothendieck universes are the same as transitive Tarski classes. (The proof in the forward direction requires Foundation.) (Contributed by Mario Carneiro, 24-Jun-2013.) |
Ref | Expression |
---|---|
grutsk | ⊢ Univ = {𝑥 ∈ Tarski ∣ Tr 𝑥} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0tsk 10169 | . . . . . . . 8 ⊢ ∅ ∈ Tarski | |
2 | eleq1 2898 | . . . . . . . 8 ⊢ (𝑦 = ∅ → (𝑦 ∈ Tarski ↔ ∅ ∈ Tarski)) | |
3 | 1, 2 | mpbiri 260 | . . . . . . 7 ⊢ (𝑦 = ∅ → 𝑦 ∈ Tarski) |
4 | 3 | a1i 11 | . . . . . 6 ⊢ (𝑦 ∈ Univ → (𝑦 = ∅ → 𝑦 ∈ Tarski)) |
5 | vex 3496 | . . . . . . . . . . 11 ⊢ 𝑦 ∈ V | |
6 | unir1 9234 | . . . . . . . . . . 11 ⊢ ∪ (𝑅1 “ On) = V | |
7 | 5, 6 | eleqtrri 2910 | . . . . . . . . . 10 ⊢ 𝑦 ∈ ∪ (𝑅1 “ On) |
8 | eqid 2819 | . . . . . . . . . . 11 ⊢ (𝑦 ∩ On) = (𝑦 ∩ On) | |
9 | 8 | grur1 10234 | . . . . . . . . . 10 ⊢ ((𝑦 ∈ Univ ∧ 𝑦 ∈ ∪ (𝑅1 “ On)) → 𝑦 = (𝑅1‘(𝑦 ∩ On))) |
10 | 7, 9 | mpan2 689 | . . . . . . . . 9 ⊢ (𝑦 ∈ Univ → 𝑦 = (𝑅1‘(𝑦 ∩ On))) |
11 | 10 | adantr 483 | . . . . . . . 8 ⊢ ((𝑦 ∈ Univ ∧ 𝑦 ≠ ∅) → 𝑦 = (𝑅1‘(𝑦 ∩ On))) |
12 | 8 | gruina 10232 | . . . . . . . . 9 ⊢ ((𝑦 ∈ Univ ∧ 𝑦 ≠ ∅) → (𝑦 ∩ On) ∈ Inacc) |
13 | inatsk 10192 | . . . . . . . . 9 ⊢ ((𝑦 ∩ On) ∈ Inacc → (𝑅1‘(𝑦 ∩ On)) ∈ Tarski) | |
14 | 12, 13 | syl 17 | . . . . . . . 8 ⊢ ((𝑦 ∈ Univ ∧ 𝑦 ≠ ∅) → (𝑅1‘(𝑦 ∩ On)) ∈ Tarski) |
15 | 11, 14 | eqeltrd 2911 | . . . . . . 7 ⊢ ((𝑦 ∈ Univ ∧ 𝑦 ≠ ∅) → 𝑦 ∈ Tarski) |
16 | 15 | ex 415 | . . . . . 6 ⊢ (𝑦 ∈ Univ → (𝑦 ≠ ∅ → 𝑦 ∈ Tarski)) |
17 | 4, 16 | pm2.61dne 3101 | . . . . 5 ⊢ (𝑦 ∈ Univ → 𝑦 ∈ Tarski) |
18 | grutr 10207 | . . . . 5 ⊢ (𝑦 ∈ Univ → Tr 𝑦) | |
19 | 17, 18 | jca 514 | . . . 4 ⊢ (𝑦 ∈ Univ → (𝑦 ∈ Tarski ∧ Tr 𝑦)) |
20 | grutsk1 10235 | . . . 4 ⊢ ((𝑦 ∈ Tarski ∧ Tr 𝑦) → 𝑦 ∈ Univ) | |
21 | 19, 20 | impbii 211 | . . 3 ⊢ (𝑦 ∈ Univ ↔ (𝑦 ∈ Tarski ∧ Tr 𝑦)) |
22 | treq 5169 | . . . 4 ⊢ (𝑥 = 𝑦 → (Tr 𝑥 ↔ Tr 𝑦)) | |
23 | 22 | elrab 3678 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∈ Tarski ∣ Tr 𝑥} ↔ (𝑦 ∈ Tarski ∧ Tr 𝑦)) |
24 | 21, 23 | bitr4i 280 | . 2 ⊢ (𝑦 ∈ Univ ↔ 𝑦 ∈ {𝑥 ∈ Tarski ∣ Tr 𝑥}) |
25 | 24 | eqriv 2816 | 1 ⊢ Univ = {𝑥 ∈ Tarski ∣ Tr 𝑥} |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1531 ∈ wcel 2108 ≠ wne 3014 {crab 3140 Vcvv 3493 ∩ cin 3933 ∅c0 4289 ∪ cuni 4830 Tr wtr 5163 “ cima 5551 Oncon0 6184 ‘cfv 6348 𝑅1cr1 9183 Inacccina 10097 Tarskictsk 10162 Univcgru 10204 |
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 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-reg 9048 ax-inf2 9096 ax-ac2 9877 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-ral 3141 df-rex 3142 df-reu 3143 df-rmo 3144 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-om 7573 df-1st 7681 df-2nd 7682 df-wrecs 7939 df-smo 7975 df-recs 8000 df-rdg 8038 df-1o 8094 df-2o 8095 df-oadd 8098 df-er 8281 df-map 8400 df-ixp 8454 df-en 8502 df-dom 8503 df-sdom 8504 df-fin 8505 df-oi 8966 df-har 9014 df-tc 9171 df-r1 9185 df-rank 9186 df-card 9360 df-aleph 9361 df-cf 9362 df-acn 9363 df-ac 9534 df-wina 10098 df-ina 10099 df-tsk 10163 df-gru 10205 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |