| 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 9622). 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 9628 | . 2 ⊢ ω ∈ V | |
| 2 | infeq5i 9621 | . 2 ⊢ (ω ∈ V → ∃𝑥 𝑥 ⊊ ∪ 𝑥) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ∃𝑥 𝑥 ⊊ ∪ 𝑥 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∃wex 1812 ∈ wcel 2145 Vcvv 3451 ⊊ wpss 3900 ∪ cuni 4867 ωcom 7866 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7740 ax-inf2 9626 |
| 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 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-om 7867 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |