Theorem axpow3 4314

Description: A variant of the Axiom of Power Sets ax-pow 4311. For any set 𝑥, there exists a set 𝑦 whose members are exactly the subsets of 𝑥 i.e. the power set of 𝑥. Axiom Pow of [BellMachover] p. 466. (Contributed by NM, 4-Jun-2006.)

Assertion

Ref	Expression
axpow3	⊢ ∃𝑦∀𝑧(𝑧 ⊆ 𝑥 ↔ 𝑧 ∈ 𝑦)

Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem axpow3

Step	Hyp	Ref	Expression
1		axpow2 4313	. . 3 ⊢ ∃𝑦∀𝑧(𝑧 ⊆ 𝑥 → 𝑧 ∈ 𝑦)
2	1	bm1.3ii 4254	. 2 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ⊆ 𝑥)
3		bicom 140	. . . 4 ⊢ ((𝑧 ⊆ 𝑥 ↔ 𝑧 ∈ 𝑦) ↔ (𝑧 ∈ 𝑦 ↔ 𝑧 ⊆ 𝑥))
4	3	albii 1523	. . 3 ⊢ (∀𝑧(𝑧 ⊆ 𝑥 ↔ 𝑧 ∈ 𝑦) ↔ ∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ⊆ 𝑥))
5	4	exbii 1658	. 2 ⊢ (∃𝑦∀𝑧(𝑧 ⊆ 𝑥 ↔ 𝑧 ∈ 𝑦) ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 ⊆ 𝑥))
6	2, 5	mpbir 146	1 ⊢ ∃𝑦∀𝑧(𝑧 ⊆ 𝑥 ↔ 𝑧 ∈ 𝑦)

This proof depends on syntax axioms:   ↔ wb 105  ∀wal 1400  ∃wex 1545   ⊆ wss 3220

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311

This proof depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-in 3226  df-ss 3233

This theorem is used by: (None)