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

Theorem intmin2 4951
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 3491 . . 3 {𝑥 ∈ V ∣ 𝐴𝑥} = {𝑥𝐴𝑥}
21inteqi 4926 . 2 {𝑥 ∈ V ∣ 𝐴𝑥} = {𝑥𝐴𝑥}
3 intmin2.1 . . 3 𝐴 ∈ V
4 intmin 4944 . . 3 (𝐴 ∈ V → {𝑥 ∈ V ∣ 𝐴𝑥} = 𝐴)
53, 4ax-mp 5 . 2 {𝑥 ∈ V ∣ 𝐴𝑥} = 𝐴
62, 5eqtr3i 2760 1 {𝑥𝐴𝑥} = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1540  wcel 2108  {cab 2713  {crab 3415  Vcvv 3459  wss 3926   cint 4922
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-ss 3943  df-int 4923
This theorem is referenced by:  dfid7  43636
  Copyright terms: Public domain W3C validator