![]() |
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 9838 | . . 3 ⊢ (rank‘𝑥) ∈ On | |
2 | inaex 43971 | . . 3 ⊢ ((rank‘𝑥) ∈ On → ∃𝑧 ∈ Inacc (rank‘𝑥) ∈ 𝑧) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ ∃𝑧 ∈ Inacc (rank‘𝑥) ∈ 𝑧 |
4 | simplr 767 | . . . . . 6 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → (rank‘𝑥) ∈ 𝑧) | |
5 | inawina 10733 | . . . . . . . . 9 ⊢ (𝑧 ∈ Inacc → 𝑧 ∈ Inaccw) | |
6 | winaon 10731 | . . . . . . . . 9 ⊢ (𝑧 ∈ Inaccw → 𝑧 ∈ On) | |
7 | 5, 6 | syl 17 | . . . . . . . 8 ⊢ (𝑧 ∈ Inacc → 𝑧 ∈ On) |
8 | 7 | ad2antrr 724 | . . . . . . 7 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑧 ∈ On) |
9 | vex 3466 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
10 | 9 | rankr1a 9879 | . . . . . . 7 ⊢ (𝑧 ∈ On → (𝑥 ∈ (𝑅1‘𝑧) ↔ (rank‘𝑥) ∈ 𝑧)) |
11 | 8, 10 | syl 17 | . . . . . 6 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → (𝑥 ∈ (𝑅1‘𝑧) ↔ (rank‘𝑥) ∈ 𝑧)) |
12 | 4, 11 | mpbird 256 | . . . . 5 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑥 ∈ (𝑅1‘𝑧)) |
13 | simpr 483 | . . . . 5 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑦 = (𝑅1‘𝑧)) | |
14 | 12, 13 | eleqtrrd 2829 | . . . 4 ⊢ (((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) ∧ 𝑦 = (𝑅1‘𝑧)) → 𝑥 ∈ 𝑦) |
15 | simpl 481 | . . . . 5 ⊢ ((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) → 𝑧 ∈ Inacc) | |
16 | 15 | inagrud 43970 | . . . 4 ⊢ ((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) → (𝑅1‘𝑧) ∈ Univ) |
17 | 14, 16 | rspcime 3613 | . . 3 ⊢ ((𝑧 ∈ Inacc ∧ (rank‘𝑥) ∈ 𝑧) → ∃𝑦 ∈ Univ 𝑥 ∈ 𝑦) |
18 | 17 | rexlimiva 3137 | . 2 ⊢ (∃𝑧 ∈ Inacc (rank‘𝑥) ∈ 𝑧 → ∃𝑦 ∈ Univ 𝑥 ∈ 𝑦) |
19 | 3, 18 | ax-mp 5 | 1 ⊢ ∃𝑦 ∈ Univ 𝑥 ∈ 𝑦 |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 394 = wceq 1534 ∈ wcel 2099 ∃wrex 3060 Oncon0 6376 ‘cfv 6554 𝑅1cr1 9805 rankcrnk 9806 Inaccwcwina 10725 Inacccina 10726 Univcgru 10833 |
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 2697 ax-rep 5290 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-reg 9635 ax-inf2 9684 ax-ac2 10506 ax-groth 10866 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-int 4955 df-iun 5003 df-iin 5004 df-br 5154 df-opab 5216 df-mpt 5237 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-se 5638 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6312 df-ord 6379 df-on 6380 df-lim 6381 df-suc 6382 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-isom 6563 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7877 df-1st 8003 df-2nd 8004 df-frecs 8296 df-wrecs 8327 df-smo 8376 df-recs 8401 df-rdg 8440 df-1o 8496 df-2o 8497 df-er 8734 df-map 8857 df-ixp 8927 df-en 8975 df-dom 8976 df-sdom 8977 df-fin 8978 df-oi 9553 df-har 9600 df-r1 9807 df-rank 9808 df-card 9982 df-aleph 9983 df-cf 9984 df-acn 9985 df-ac 10159 df-wina 10727 df-ina 10728 df-tsk 10792 df-gru 10834 |
This theorem is referenced by: rr-groth 43973 rr-grothprim 43974 rr-grothshort 43978 |
Copyright terms: Public domain | W3C validator |