Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > zfpow | Structured version Visualization version GIF version |
Description: Axiom of Power Sets expressed with the fewest number of different variables. (Contributed by NM, 14-Aug-2003.) |
Ref | Expression |
---|---|
zfpow | ⊢ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-pow 4843 | . 2 ⊢ ∃𝑥∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) | |
2 | elequ1 1997 | . . . . . . 7 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦)) | |
3 | elequ1 1997 | . . . . . . 7 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧)) | |
4 | 2, 3 | imbi12d 334 | . . . . . 6 ⊢ (𝑤 = 𝑥 → ((𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) ↔ (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧))) |
5 | 4 | cbvalv 2273 | . . . . 5 ⊢ (∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) ↔ ∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧)) |
6 | 5 | imbi1i 339 | . . . 4 ⊢ ((∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ (∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)) |
7 | 6 | albii 1747 | . . 3 ⊢ (∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)) |
8 | 7 | exbii 1774 | . 2 ⊢ (∃𝑥∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)) |
9 | 1, 8 | mpbi 220 | 1 ⊢ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1481 ∃wex 1704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-11 2034 ax-12 2047 ax-13 2246 ax-pow 4843 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 |
This theorem is referenced by: el 4847 axpowndlem2 9420 |
Copyright terms: Public domain | W3C validator |