HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem intmin2 1984
Description: Any set is the smallest of all sets that include it.
Hypothesis
Ref Expression
intmin2.1 |- A e. V
Assertion
Ref Expression
intmin2 |- A = |^|{x | A (_ x}
Distinct variable group(s):   x,A

Proof of Theorem intmin2
StepHypRef Expression
1 intmin2.1 . . 3 |- A e. V
2 intmin 1982 . . 3 |- (A e. V -> A = |^|{x e. V | A (_ x})
31, 2ax-mp 6 . 2 |- A = |^|{x e. V | A (_ x}
4 df-rab 1208 . . . 4 |- {x e. V | A (_ x} = {x | (x e. V /\ A (_ x)}
5 visset 1350 . . . . . 6 |- x e. V
65biantrur 544 . . . . 5 |- (A (_ x <-> (x e. V /\ A (_ x))
76biabi 1181 . . . 4 |- {x | A (_ x} = {x | (x e. V /\ A (_ x)}
84, 7eqtr4 1122 . . 3 |- {x e. V | A (_ x} = {x | A (_ x}
98inteqi 1969 . 2 |- |^|{x e. V | A (_ x} = |^|{x | A (_ x}
103, 9eqtr 1119 1 |- A = |^|{x | A (_ x}
Colors of variables: wff set class
Syntax hints:   /\ wa 196  {cab 1090   = wceq 1091   e. wcel 1092  {crab 1204  Vcvv 1348   (_ wss 1487  |^|cint 1965
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rab 1208  df-v 1349  df-in 1491  df-ss 1492  df-int 1966
metamath.org