Theorem zfpow 3949

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 3948	. 2 ⊢ ∃𝑥∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥)
2		elequ1 1640	. . . . . . 7 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
3		elequ1 1640	. . . . . . 7 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧))
4	2, 3	imbi12d 232	. . . . . 6 ⊢ (𝑤 = 𝑥 → ((𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) ↔ (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧)))
5	4	cbvalv 1835	. . . . 5 ⊢ (∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) ↔ ∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧))
6	5	imbi1i 236	. . . 4 ⊢ ((∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ (∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
7	6	albii 1399	. . 3 ⊢ (∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
8	7	exbii 1536	. 2 ⊢ (∃𝑥∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
9	1, 8	mpbi 143	1 ⊢ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)

Syntax hints:   → wi 4  ∀wal 1282  ∃wex 1421

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-4 1440  ax-13 1444  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-pow 3948

This theorem depends on definitions:  df-bi 115  df-nf 1390

This theorem is referenced by:  el  3952