![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > inf5 | Structured version Visualization version GIF version |
Description: The statement "there exists a set that is a proper subset of its union" is equivalent to the Axiom of Infinity (see theorem infeq5 8699). This provides us with a very compact way to express the Axiom of Infinity using only elementary symbols. (Contributed by NM, 3-Jun-2005.) |
Ref | Expression |
---|---|
inf5 | ⊢ ∃𝑥 𝑥 ⊊ ∪ 𝑥 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | omex 8705 | . 2 ⊢ ω ∈ V | |
2 | infeq5i 8698 | . 2 ⊢ (ω ∈ V → ∃𝑥 𝑥 ⊊ ∪ 𝑥) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ ∃𝑥 𝑥 ⊊ ∪ 𝑥 |
Colors of variables: wff setvar class |
Syntax hints: ∃wex 1845 ∈ wcel 2131 Vcvv 3332 ⊊ wpss 3708 ∪ cuni 4580 ωcom 7222 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1863 ax-4 1878 ax-5 1980 ax-6 2046 ax-7 2082 ax-8 2133 ax-9 2140 ax-10 2160 ax-11 2175 ax-12 2188 ax-13 2383 ax-ext 2732 ax-sep 4925 ax-nul 4933 ax-pr 5047 ax-un 7106 ax-inf2 8703 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1627 df-ex 1846 df-nf 1851 df-sb 2039 df-eu 2603 df-mo 2604 df-clab 2739 df-cleq 2745 df-clel 2748 df-nfc 2883 df-ne 2925 df-ral 3047 df-rex 3048 df-rab 3051 df-v 3334 df-sbc 3569 df-dif 3710 df-un 3712 df-in 3714 df-ss 3721 df-pss 3723 df-nul 4051 df-if 4223 df-pw 4296 df-sn 4314 df-pr 4316 df-tp 4318 df-op 4320 df-uni 4581 df-br 4797 df-opab 4857 df-tr 4897 df-eprel 5171 df-po 5179 df-so 5180 df-fr 5217 df-we 5219 df-ord 5879 df-on 5880 df-lim 5881 df-suc 5882 df-om 7223 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |