Theorem ssextss 5449

Description: An extensionality-like principle defining subclass in terms of subsets. (Contributed by NM, 30-Jun-2004.)

Assertion

Ref	Expression
ssextss	⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem ssextss

Step	Hyp	Ref	Expression
1		sspwb 5445	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ 𝒫 𝐴 ⊆ 𝒫 𝐵)
2		dfss2 3966	. 2 ⊢ (𝒫 𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵))
3		velpw 4603	. . . 4 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
4		velpw 4603	. . . 4 ⊢ (𝑥 ∈ 𝒫 𝐵 ↔ 𝑥 ⊆ 𝐵)
5	3, 4	imbi12i 351	. . 3 ⊢ ((𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵) ↔ (𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵))
6	5	albii 1822	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵) ↔ ∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵))
7	1, 2, 6	3bitri 297	1 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵))

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1540   ∈ wcel 2107   ⊆ wss 3946  𝒫 cpw 4598

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5295  ax-pr 5423

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-v 3477  df-un 3951  df-in 3953  df-ss 3963  df-pw 4600  df-sn 4625  df-pr 4627

This theorem is referenced by:  ssext  5450  nssss  5451