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

Theorem intmin2 4912
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 3463 . . 3 {𝑥 ∈ V ∣ 𝐴𝑥} = {𝑥𝐴𝑥}
21inteqi 4888 . 2 {𝑥 ∈ V ∣ 𝐴𝑥} = {𝑥𝐴𝑥}
3 intmin2.1 . . 3 𝐴 ∈ V
4 intmin 4905 . . 3 (𝐴 ∈ V → {𝑥 ∈ V ∣ 𝐴𝑥} = 𝐴)
53, 4ax-mp 5 . 2 {𝑥 ∈ V ∣ 𝐴𝑥} = 𝐴
62, 5eqtr3i 2765 1 {𝑥𝐴𝑥} = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1547  wcel 2119  {cab 2718  {crab 3392  Vcvv 3432  wss 3890   cint 4884
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-ss 3907  df-int 4885
This theorem is referenced by:  dfid7  44063
  Copyright terms: Public domain W3C validator