| Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > gruex | Structured version Visualization version GIF version | ||
| Description: Assuming the Tarski-Grothendieck axiom, every set is contained in a Grothendieck universe. (Contributed by Rohan Ridenour, 13-Aug-2023.) |
| Ref | Expression |
|---|---|
| gruex | ⊢ ∃𝑦 ∈ Univ 𝑥 ∈ 𝑦 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rankon 9780 | . . 3 ⊢ (rank‘𝑥) ∈ On | |
| 2 | inaex 45124 | . . 3 ⊢ ((rank‘𝑥) ∈ On → ∃𝑧 ∈ Inacc (rank‘𝑥) ∈ 𝑧) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ∃𝑧 ∈ Inacc (rank‘𝑥) ∈ 𝑧 |
| 4 | simplr 781 | . . . . . 6 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → (rank‘𝑥) ∈ 𝑧) | |
| 5 | inawina 10702 | . . . . . . . . 9 ⊢ (𝑧 ∈ Inacc → 𝑧 ∈ Inaccw) | |
| 6 | winaon 10700 | . . . . . . . . 9 ⊢ (𝑧 ∈ Inaccw → 𝑧 ∈ On) | |
| 7 | 5, 6 | syl 18 | . . . . . . . 8 ⊢ (𝑧 ∈ Inacc → 𝑧 ∈ On) |
| 8 | 7 | ad2antrr 739 | . . . . . . 7 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑧 ∈ On) |
| 9 | vex 3454 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 10 | 9 | rankr1a 9821 | . . . . . . 7 ⊢ (𝑧 ∈ On → (𝑥 ∈ (𝑅1‘𝑧) ↔ (rank‘𝑥) ∈ 𝑧)) |
| 11 | 8, 10 | syl 18 | . . . . . 6 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → (𝑥 ∈ (𝑅1‘𝑧) ↔ (rank‘𝑥) ∈ 𝑧)) |
| 12 | 4, 11 | mpbird 260 | . . . . 5 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑥 ∈ (𝑅1‘𝑧)) |
| 13 | simpr 490 | . . . . 5 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑦 = (𝑅1‘𝑧)) | |
| 14 | 12, 13 | eleqtrrd 2863 | . . . 4 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑥 ∈ 𝑦) |
| 15 | simpl 488 | . . . . 5 ⊢ ((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) → 𝑧 ∈ Inacc) | |
| 16 | 15 | inagrud 45123 | . . . 4 ⊢ ((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) → (𝑅1‘𝑧) ∈ Univ) |
| 17 | 14, 16 | rspcime 3581 | . . 3 ⊢ ((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) → ∃𝑦 ∈ Univ 𝑥 ∈ 𝑦) |
| 18 | 17 | rexlimiva 3155 | . 2 ⊢ (∃𝑧 ∈ Inacc (rank‘𝑥) ∈ 𝑧 → ∃𝑦 ∈ Univ 𝑥 ∈ 𝑦) |
| 19 | 3, 18 | ax-mp 5 | 1 ⊢ ∃𝑦 ∈ Univ 𝑥 ∈ 𝑦 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3086 Oncon0 6357 ‘cfv 6533 𝑅1cr1 9747 rankcrnk 9748 Inaccwcwina 10694 Inacccina 10695 Univcgru 10802 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-reg 9567 ax-inf2 9623 ax-ac2 10468 ax-groth 10835 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-smo 8336 df-recs 8361 df-rdg 8400 df-1o 8458 df-2o 8459 df-er 8699 df-map 8831 df-ixp 8908 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-oi 9485 df-har 9532 df-r1 9749 df-rank 9750 df-card 9947 df-aleph 9948 df-cf 9949 df-acn 9950 df-ac 10122 df-wina 10696 df-ina 10697 df-tsk 10761 df-gru 10803 |
| This theorem is used by: rr-groth 45126 rr-grothprim 45127 rr-grothshort 45131 |
| Copyright terms: Public domain | W3C validator |