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

Theorem ssextss 5421
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 5417 . 2 (𝐴 ⊆ 𝐵 ↔ 𝒫 𝐴 ⊆ 𝒫 𝐵)
2 df-ss 3897 . 2 (𝒫 𝐴 ⊆ 𝒫 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵))
3 velpw 4561 . . . 4 (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
4 velpw 4561 . . . 4 (𝑥 ∈ 𝒫 𝐵 ↔ 𝑥 ⊆ 𝐵)
53, 4imbi12i 353 . . 3 ((𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵) ↔ (𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵))
65albii 1851 . 2 (∀𝑥(𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝒫 𝐵) ↔ ∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵))
71, 2, 63bitri 300 1 (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   ∈ wcel 2144   ⊆ wss 3896  𝒫 cpw 4556
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3897  df-un 4150  df-pw 4558  df-sn 4585  df-pr 4587
This theorem is used by:  ssext  5422  nssss  5423
  Copyright terms: Public domain W3C validator