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

Theorem intmin3 4980
Description: Under subset ordering, the intersection of a class abstraction is less than or equal to any of its members. (Contributed by NM, 3-Jul-2005.)
Hypotheses
Ref Expression
intmin3.2 (𝑥 = 𝐴 → (𝜑𝜓))
intmin3.3 𝜓
Assertion
Ref Expression
intmin3 (𝐴𝑉 {𝑥𝜑} ⊆ 𝐴)
Distinct variable groups:   𝑥,𝐴   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥)

Proof of Theorem intmin3
StepHypRef Expression
1 intmin3.3 . . 3 𝜓
2 intmin3.2 . . . 4 (𝑥 = 𝐴 → (𝜑𝜓))
32elabg 3666 . . 3 (𝐴𝑉 → (𝐴 ∈ {𝑥𝜑} ↔ 𝜓))
41, 3mpbiri 258 . 2 (𝐴𝑉𝐴 ∈ {𝑥𝜑})
5 intss1 4967 . 2 (𝐴 ∈ {𝑥𝜑} → {𝑥𝜑} ⊆ 𝐴)
64, 5syl 17 1 (𝐴𝑉 {𝑥𝜑} ⊆ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1540  wcel 2105  {cab 2708  wss 3948   cint 4950
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2702
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1543  df-ex 1781  df-sb 2067  df-clab 2709  df-cleq 2723  df-clel 2809  df-v 3475  df-in 3955  df-ss 3965  df-int 4951
This theorem is referenced by:  intabs  5342  intidOLD  5458
  Copyright terms: Public domain W3C validator