| 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 9753 | . . 3 ⊢ (rank‘𝑥) ∈ On | |
| 2 | inaex 44873 | . . 3 ⊢ ((rank‘𝑥) ∈ On → ∃𝑧 ∈ Inacc (rank‘𝑥) ∈ 𝑧) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ∃𝑧 ∈ Inacc (rank‘𝑥) ∈ 𝑧 |
| 4 | simplr 778 | . . . . . 6 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → (rank‘𝑥) ∈ 𝑧) | |
| 5 | inawina 10648 | . . . . . . . . 9 ⊢ (𝑧 ∈ Inacc → 𝑧 ∈ Inaccw) | |
| 6 | winaon 10646 | . . . . . . . . 9 ⊢ (𝑧 ∈ Inaccw → 𝑧 ∈ On) | |
| 7 | 5, 6 | syl 17 | . . . . . . . 8 ⊢ (𝑧 ∈ Inacc → 𝑧 ∈ On) |
| 8 | 7 | ad2antrr 736 | . . . . . . 7 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑧 ∈ On) |
| 9 | vex 3458 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 10 | 9 | rankr1a 9794 | . . . . . . 7 ⊢ (𝑧 ∈ On → (𝑥 ∈ (𝑅1‘𝑧) ↔ (rank‘𝑥) ∈ 𝑧)) |
| 11 | 8, 10 | syl 17 | . . . . . 6 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → (𝑥 ∈ (𝑅1‘𝑧) ↔ (rank‘𝑥) ∈ 𝑧)) |
| 12 | 4, 11 | mpbird 259 | . . . . 5 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑥 ∈ (𝑅1‘𝑧)) |
| 13 | simpr 488 | . . . . 5 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑦 = (𝑅1‘𝑧)) | |
| 14 | 12, 13 | eleqtrrd 2865 | . . . 4 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑥 ∈ 𝑦) |
| 15 | simpl 486 | . . . . 5 ⊢ ((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) → 𝑧 ∈ Inacc) | |
| 16 | 15 | inagrud 44872 | . . . 4 ⊢ ((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) → (𝑅1‘𝑧) ∈ Univ) |
| 17 | 14, 16 | rspcime 3586 | . . 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 |
| Syntax hints: ↔ wb 208 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ∃wrex 3086 Oncon0 6346 ‘cfv 6521 𝑅1cr1 9720 rankcrnk 9721 Inaccwcwina 10640 Inacccina 10641 Univcgru 10748 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-reg 9540 ax-inf2 9596 ax-ac2 10420 ax-groth 10781 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-iin 4952 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-se 5601 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-isom 6530 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-smo 8317 df-recs 8342 df-rdg 8381 df-1o 8437 df-2o 8438 df-er 8678 df-map 8810 df-ixp 8880 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-oi 9458 df-har 9505 df-r1 9722 df-rank 9723 df-card 9897 df-aleph 9898 df-cf 9899 df-acn 9900 df-ac 10072 df-wina 10642 df-ina 10643 df-tsk 10707 df-gru 10749 |
| This theorem is referenced by: rr-groth 44875 rr-grothprim 44876 rr-grothshort 44880 |
| Copyright terms: Public domain | W3C validator |