| 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 9668). 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 9674 | . 2 ⊢ ω ∈ V | |
| 2 | infeq5i 9667 | . 2 ⊢ (ω ∈ V → ∃𝑥 𝑥 ⊊ ∪ 𝑥) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ∃𝑥 𝑥 ⊊ ∪ 𝑥 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∃wex 1812 ∈ wcel 2147 Vcvv 3454 ⊊ wpss 4016 ∪ cuni 4870 ωcom 7904 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pr 5396 ax-un 7778 ax-inf2 9672 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-tr 5217 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-om 7905 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |