ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  intmin3 Structured version   Unicode version

Theorem intmin3 3633
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  V  |^| {  |  }  C_
Distinct variable groups:   ,   ,
Allowed substitution hints:   ()    V()

Proof of Theorem intmin3
StepHypRef Expression
1 intmin3.3 . . 3
2 intmin3.2 . . . 4
32elabg 2682 . . 3  V  {  |  }
41, 3mpbiri 157 . 2  V  {  |  }
5 intss1 3621 . 2  {  |  }  |^| {  |  }  C_
64, 5syl 14 1  V  |^| {  |  }  C_
Colors of variables: wff set class
Syntax hints:   wi 4   wb 98   wceq 1242   wcel 1390   {cab 2023    C_ wss 2911   |^|cint 3606
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-v 2553  df-in 2918  df-ss 2925  df-int 3607
This theorem is referenced by:  intid  3951
  Copyright terms: Public domain W3C validator