![]() |
Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > inaex | Structured version Visualization version GIF version |
Description: Assuming the Tarski-Grothendieck axiom, every ordinal is contained in an inaccessible ordinal. (Contributed by Rohan Ridenour, 13-Aug-2023.) |
Ref | Expression |
---|---|
inaex | ⊢ (𝐴 ∈ On → ∃𝑥 ∈ Inacc 𝐴 ∈ 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inawina 10634 | . . . . . . 7 ⊢ (𝑥 ∈ Inacc → 𝑥 ∈ Inaccw) | |
2 | winaon 10632 | . . . . . . 7 ⊢ (𝑥 ∈ Inaccw → 𝑥 ∈ On) | |
3 | 1, 2 | syl 17 | . . . . . 6 ⊢ (𝑥 ∈ Inacc → 𝑥 ∈ On) |
4 | 3 | ssriv 3952 | . . . . 5 ⊢ Inacc ⊆ On |
5 | onmindif 6413 | . . . . 5 ⊢ ((Inacc ⊆ On ∧ 𝐴 ∈ On) → 𝐴 ∈ ∩ (Inacc ∖ suc 𝐴)) | |
6 | 4, 5 | mpan 689 | . . . 4 ⊢ (𝐴 ∈ On → 𝐴 ∈ ∩ (Inacc ∖ suc 𝐴)) |
7 | 6 | adantr 482 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝑥 = ∩ (Inacc ∖ suc 𝐴)) → 𝐴 ∈ ∩ (Inacc ∖ suc 𝐴)) |
8 | simpr 486 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝑥 = ∩ (Inacc ∖ suc 𝐴)) → 𝑥 = ∩ (Inacc ∖ suc 𝐴)) | |
9 | 7, 8 | eleqtrrd 2837 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝑥 = ∩ (Inacc ∖ suc 𝐴)) → 𝐴 ∈ 𝑥) |
10 | difss 4095 | . . . . 5 ⊢ (Inacc ∖ suc 𝐴) ⊆ Inacc | |
11 | 10, 4 | sstri 3957 | . . . 4 ⊢ (Inacc ∖ suc 𝐴) ⊆ On |
12 | inaprc 10780 | . . . . . . 7 ⊢ Inacc ∉ V | |
13 | 12 | neli 3048 | . . . . . 6 ⊢ ¬ Inacc ∈ V |
14 | ssdif0 4327 | . . . . . . 7 ⊢ (Inacc ⊆ suc 𝐴 ↔ (Inacc ∖ suc 𝐴) = ∅) | |
15 | sucexg 7744 | . . . . . . . 8 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ V) | |
16 | ssexg 5284 | . . . . . . . . 9 ⊢ ((Inacc ⊆ suc 𝐴 ∧ suc 𝐴 ∈ V) → Inacc ∈ V) | |
17 | 16 | expcom 415 | . . . . . . . 8 ⊢ (suc 𝐴 ∈ V → (Inacc ⊆ suc 𝐴 → Inacc ∈ V)) |
18 | 15, 17 | syl 17 | . . . . . . 7 ⊢ (𝐴 ∈ On → (Inacc ⊆ suc 𝐴 → Inacc ∈ V)) |
19 | 14, 18 | biimtrrid 242 | . . . . . 6 ⊢ (𝐴 ∈ On → ((Inacc ∖ suc 𝐴) = ∅ → Inacc ∈ V)) |
20 | 13, 19 | mtoi 198 | . . . . 5 ⊢ (𝐴 ∈ On → ¬ (Inacc ∖ suc 𝐴) = ∅) |
21 | 20 | neqned 2947 | . . . 4 ⊢ (𝐴 ∈ On → (Inacc ∖ suc 𝐴) ≠ ∅) |
22 | onint 7729 | . . . 4 ⊢ (((Inacc ∖ suc 𝐴) ⊆ On ∧ (Inacc ∖ suc 𝐴) ≠ ∅) → ∩ (Inacc ∖ suc 𝐴) ∈ (Inacc ∖ suc 𝐴)) | |
23 | 11, 21, 22 | sylancr 588 | . . 3 ⊢ (𝐴 ∈ On → ∩ (Inacc ∖ suc 𝐴) ∈ (Inacc ∖ suc 𝐴)) |
24 | 23 | eldifad 3926 | . 2 ⊢ (𝐴 ∈ On → ∩ (Inacc ∖ suc 𝐴) ∈ Inacc) |
25 | 9, 24 | rspcime 3586 | 1 ⊢ (𝐴 ∈ On → ∃𝑥 ∈ Inacc 𝐴 ∈ 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2940 ∃wrex 3070 Vcvv 3447 ∖ cdif 3911 ⊆ wss 3914 ∅c0 4286 ∩ cint 4911 Oncon0 6321 suc csuc 6323 Inaccwcwina 10626 Inacccina 10627 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5246 ax-sep 5260 ax-nul 5267 ax-pow 5324 ax-pr 5388 ax-un 7676 ax-inf2 9585 ax-ac2 10407 ax-groth 10767 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3449 df-sbc 3744 df-csb 3860 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3933 df-nul 4287 df-if 4491 df-pw 4566 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4870 df-int 4912 df-iun 4960 df-iin 4961 df-br 5110 df-opab 5172 df-mpt 5193 df-tr 5227 df-id 5535 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5592 df-se 5593 df-we 5594 df-xp 5643 df-rel 5644 df-cnv 5645 df-co 5646 df-dm 5647 df-rn 5648 df-res 5649 df-ima 5650 df-pred 6257 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6452 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7317 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7807 df-1st 7925 df-2nd 7926 df-frecs 8216 df-wrecs 8247 df-smo 8296 df-recs 8321 df-rdg 8360 df-1o 8416 df-2o 8417 df-er 8654 df-map 8773 df-ixp 8842 df-en 8890 df-dom 8891 df-sdom 8892 df-fin 8893 df-oi 9454 df-har 9501 df-r1 9708 df-card 9883 df-aleph 9884 df-cf 9885 df-acn 9886 df-ac 10060 df-wina 10628 df-ina 10629 df-tsk 10693 |
This theorem is referenced by: gruex 42670 |
Copyright terms: Public domain | W3C validator |