MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssextss Structured version   Visualization version   GIF version

Theorem ssextss 5333
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
StepHypRef Expression
1 sspwb 5329 . 2 (𝐴𝐵 ↔ 𝒫 𝐴 ⊆ 𝒫 𝐵)
2 dfss2 3939 . 2 (𝒫 𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝒫 𝐴𝑥 ∈ 𝒫 𝐵))
3 velpw 4527 . . . 4 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
4 velpw 4527 . . . 4 (𝑥 ∈ 𝒫 𝐵𝑥𝐵)
53, 4imbi12i 354 . . 3 ((𝑥 ∈ 𝒫 𝐴𝑥 ∈ 𝒫 𝐵) ↔ (𝑥𝐴𝑥𝐵))
65albii 1821 . 2 (∀𝑥(𝑥 ∈ 𝒫 𝐴𝑥 ∈ 𝒫 𝐵) ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
71, 2, 63bitri 300 1 (𝐴𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wal 1536  wcel 2115  wss 3919  𝒫 cpw 4522
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5189  ax-nul 5196  ax-pr 5317
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-v 3482  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4277  df-pw 4524  df-sn 4551  df-pr 4553
This theorem is referenced by:  ssext  5334  nssss  5335
  Copyright terms: Public domain W3C validator