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

Theorem nelss 3216
Description: Demonstrate by witnesses that two classes lack a subclass relation. (Contributed by Stefan O'Rear, 5-Feb-2015.)
Assertion
Ref Expression
nelss  |-  ( ( A  e.  B  /\  -.  A  e.  C
)  ->  -.  B  C_  C )

Proof of Theorem nelss
StepHypRef Expression
1 ssel 3149 . . 3  |-  ( B 
C_  C  ->  ( A  e.  B  ->  A  e.  C ) )
21com12 30 . 2  |-  ( A  e.  B  ->  ( B  C_  C  ->  A  e.  C ) )
32con3dimp 635 1  |-  ( ( A  e.  B  /\  -.  A  e.  C
)  ->  -.  B  C_  C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    e. wcel 2148    C_ wss 3129
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-11 1506  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-in 3135  df-ss 3142
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator