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

Theorem intmin2 4925
Description: Any set is the smallest of all sets that include it. (Contributed by NM, 20-Sep-2003.)
Hypothesis
Ref Expression
intmin2.1 𝐴 ∈ V
Assertion
Ref Expression
intmin2 {𝑥𝐴𝑥} = 𝐴
Distinct variable group:   𝑥,𝐴

Proof of Theorem intmin2
StepHypRef Expression
1 rabab 3467 . . 3 {𝑥 ∈ V ∣ 𝐴𝑥} = {𝑥𝐴𝑥}
21inteqi 4901 . 2 {𝑥 ∈ V ∣ 𝐴𝑥} = {𝑥𝐴𝑥}
3 intmin2.1 . . 3 𝐴 ∈ V
4 intmin 4918 . . 3 (𝐴 ∈ V → {𝑥 ∈ V ∣ 𝐴𝑥} = 𝐴)
53, 4ax-mp 5 . 2 {𝑥 ∈ V ∣ 𝐴𝑥} = 𝐴
62, 5eqtr3i 2756 1 {𝑥𝐴𝑥} = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  wcel 2111  {cab 2709  {crab 3395  Vcvv 3436  wss 3902   cint 4897
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-ss 3919  df-int 4898
This theorem is referenced by:  dfid7  43644
  Copyright terms: Public domain W3C validator