Theorem zfpow 4099

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 4098	. 2 ⊢ ∃𝑥∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥)
2		elequ1 1690	. . . . . . 7 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
3		elequ1 1690	. . . . . . 7 ⊢ (𝑤 = 𝑥 → (𝑤 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧))
4	2, 3	imbi12d 233	. . . . . 6 ⊢ (𝑤 = 𝑥 → ((𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) ↔ (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧)))
5	4	cbvalv 1889	. . . . 5 ⊢ (∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) ↔ ∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧))
6	5	imbi1i 237	. . . 4 ⊢ ((∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ (∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
7	6	albii 1446	. . 3 ⊢ (∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ ∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
8	7	exbii 1584	. 2 ⊢ (∃𝑥∀𝑦(∀𝑤(𝑤 ∈ 𝑦 → 𝑤 ∈ 𝑧) → 𝑦 ∈ 𝑥) ↔ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥))
9	1, 8	mpbi 144	1 ⊢ ∃𝑥∀𝑦(∀𝑥(𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → 𝑦 ∈ 𝑥)

Syntax hints:   → wi 4  ∀wal 1329  ∃wex 1468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-4 1487  ax-13 1491  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-pow 4098

This theorem depends on definitions:  df-bi 116  df-nf 1437

This theorem is referenced by:  el  4102