| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > inf2 | Structured version Visualization version GIF version | ||
| Description: Variation of Axiom of Infinity. There exists a nonempty set that is a subset of its union (using zfinf 9558 as a hypothesis). Abbreviated version of the Axiom of Infinity in [FreydScedrov] p. 283. (Contributed by NM, 28-Oct-1996.) |
| Ref | Expression |
|---|---|
| inf1.1 | ⊢ ∃𝑥(𝑦 ∈ 𝑥 ∧ ∀𝑦(𝑦 ∈ 𝑥 → ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥))) |
| Ref | Expression |
|---|---|
| inf2 | ⊢ ∃𝑥(𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inf1.1 | . . 3 ⊢ ∃𝑥(𝑦 ∈ 𝑥 ∧ ∀𝑦(𝑦 ∈ 𝑥 → ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥))) | |
| 2 | 1 | inf1 9541 | . 2 ⊢ ∃𝑥(𝑥 ≠ ∅ ∧ ∀𝑦(𝑦 ∈ 𝑥 → ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥))) |
| 3 | df-ss 3907 | . . . . 5 ⊢ (𝑥 ⊆ ∪ 𝑥 ↔ ∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝑥)) | |
| 4 | eluni 4848 | . . . . . . 7 ⊢ (𝑦 ∈ ∪ 𝑥 ↔ ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥)) | |
| 5 | 4 | imbi2i 337 | . . . . . 6 ⊢ ((𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝑥) ↔ (𝑦 ∈ 𝑥 → ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥))) |
| 6 | 5 | albii 1826 | . . . . 5 ⊢ (∀𝑦(𝑦 ∈ 𝑥 → 𝑦 ∈ ∪ 𝑥) ↔ ∀𝑦(𝑦 ∈ 𝑥 → ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥))) |
| 7 | 3, 6 | bitri 276 | . . . 4 ⊢ (𝑥 ⊆ ∪ 𝑥 ↔ ∀𝑦(𝑦 ∈ 𝑥 → ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥))) |
| 8 | 7 | anbi2i 629 | . . 3 ⊢ ((𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ↔ (𝑥 ≠ ∅ ∧ ∀𝑦(𝑦 ∈ 𝑥 → ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥)))) |
| 9 | 8 | exbii 1855 | . 2 ⊢ (∃𝑥(𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) ↔ ∃𝑥(𝑥 ≠ ∅ ∧ ∀𝑦(𝑦 ∈ 𝑥 → ∃𝑧(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑥)))) |
| 10 | 2, 9 | mpbir 232 | 1 ⊢ ∃𝑥(𝑥 ≠ ∅ ∧ 𝑥 ⊆ ∪ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∀wal 1545 ∃wex 1786 ∈ wcel 2119 ≠ wne 2935 ⊆ wss 3890 ∅c0 4268 ∪ cuni 4845 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ne 2936 df-v 3434 df-dif 3893 df-ss 3907 df-nul 4269 df-uni 4846 |
| This theorem is referenced by: axinf2 9559 |
| Copyright terms: Public domain | W3C validator |