Theorem zfpow 4187

Description: Axiom of Power Sets expressed with the fewest number of different variables. (Contributed by NM, 14-Aug-2003.)

Assertion

Ref	Expression
zfpow	⊢ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)

Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem zfpow

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-pow 4186	. 2 ⊢ ∃𝑥∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥)
2		elequ1 2162	. . . . . . 7 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
3		elequ1 2162	. . . . . . 7 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧))
4	2, 3	imbi12d 234	. . . . . 6 ⊢ (𝑤 = 𝑥 → ((𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) ↔ (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧)))
5	4	cbvalv 1927	. . . . 5 ⊢ (∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) ↔ ∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧))
6	5	imbi1i 238	. . . 4 ⊢ ((∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ (∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
7	6	albii 1480	. . 3 ⊢ (∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
8	7	exbii 1615	. 2 ⊢ (∃𝑥∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
9	1, 8	mpbi 145	1 ⊢ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)

Syntax hints:   → wi 4  ∀wal 1361  ∃wex 1502

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-13 2160  ax-pow 4186

This theorem depends on definitions:  df-bi 117  df-nf 1471

This theorem is referenced by:  el  4190