Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfom5 | Structured version Visualization version GIF version |
Description: ω is the smallest limit ordinal and can be defined as such (although the Axiom of Infinity is needed to ensure that at least one limit ordinal exists). (Contributed by FL, 22-Feb-2011.) (Revised by Mario Carneiro, 2-Feb-2013.) |
Ref | Expression |
---|---|
dfom5 | ⊢ ω = ∩ {𝑥 ∣ Lim 𝑥} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elom3 9111 | . . 3 ⊢ (𝑦 ∈ ω ↔ ∀𝑥(Lim 𝑥 → 𝑦 ∈ 𝑥)) | |
2 | vex 3497 | . . . 4 ⊢ 𝑦 ∈ V | |
3 | 2 | elintab 4887 | . . 3 ⊢ (𝑦 ∈ ∩ {𝑥 ∣ Lim 𝑥} ↔ ∀𝑥(Lim 𝑥 → 𝑦 ∈ 𝑥)) |
4 | 1, 3 | bitr4i 280 | . 2 ⊢ (𝑦 ∈ ω ↔ 𝑦 ∈ ∩ {𝑥 ∣ Lim 𝑥}) |
5 | 4 | eqriv 2818 | 1 ⊢ ω = ∩ {𝑥 ∣ Lim 𝑥} |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1535 = wceq 1537 ∈ wcel 2114 {cab 2799 ∩ cint 4876 Lim wlim 6192 ωcom 7580 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 ax-un 7461 ax-inf2 9104 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-br 5067 df-opab 5129 df-tr 5173 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-om 7581 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |