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

Theorem ssext 5421
Description: An extensionality-like principle that uses the subset instead of the membership relation: two classes are equal iff they have the same subsets. (Contributed by NM, 30-Jun-2004.)
Assertion
Ref Expression
ssext (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 ↔ 𝑥 ⊆ 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem ssext
StepHypRef Expression
1 ssextss 5420 . . 3 (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵))
2 ssextss 5420 . . 3 (𝐵 ⊆ 𝐴 ↔ ∀𝑥(𝑥 ⊆ 𝐵 → 𝑥 ⊆ 𝐴))
31, 2anbi12i 640 . 2 ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴) ↔ (∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵) ∧ ∀𝑥(𝑥 ⊆ 𝐵 → 𝑥 ⊆ 𝐴)))
4 eqss 3923 . 2 (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))
5 albiim 1921 . 2 (∀𝑥(𝑥 ⊆ 𝐴 ↔ 𝑥 ⊆ 𝐵) ↔ (∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵) ∧ ∀𝑥(𝑥 ⊆ 𝐵 → 𝑥 ⊆ 𝐴)))
63, 4, 53bitr4i 306 1 (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 ↔ 𝑥 ⊆ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569   ⊆ wss 3895
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 5390
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 3896  df-un 4151  df-pw 4558  df-sn 4585  df-pr 4587
This theorem is used by:  extssr  39615
  Copyright terms: Public domain W3C validator