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

Theorem abss 3990
Description: Class abstraction in a subclass relationship. (Contributed by NM, 16-Aug-2006.)
Assertion
Ref Expression
abss ({𝑥 ∣ 𝜑} ⊆ 𝐴 ↔ ∀𝑥(𝜑 → 𝑥 ∈ 𝐴))
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem abss
StepHypRef Expression
1 abid2 2901 . . 3 {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴
21sseq2i 3942 . 2 ({𝑥 ∣ 𝜑} ⊆ {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ {𝑥 ∣ 𝜑} ⊆ 𝐴)
3 ss2ab 3989 . 2 ({𝑥 ∣ 𝜑} ⊆ {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ ∀𝑥(𝜑 → 𝑥 ∈ 𝐴))
42, 3bitr3i 280 1 ({𝑥 ∣ 𝜑} ⊆ 𝐴 ↔ ∀𝑥(𝜑 → 𝑥 ∈ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   ∈ wcel 2147  {cab 2741   ⊆ wss 3900
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ss 3901
This theorem is used by:  rabss  3998  uniiunlem  4015  iunssfOLD  5005  iunssOLD  5007  moabexOLD  5432  mpteleeOLD  29506
  Copyright terms: Public domain W3C validator