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

Theorem nelss 3664
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 3597 . . 3  |-  ( B 
C_  C  ->  ( A  e.  B  ->  A  e.  C ) )
21com12 32 . 2  |-  ( A  e.  B  ->  ( B  C_  C  ->  A  e.  C ) )
32con3dimp 457 1  |-  ( ( A  e.  B  /\  -.  A  e.  C
)  ->  -.  B  C_  C )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 384    e. wcel 1990    C_ wss 3574
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-in 3581  df-ss 3588
This theorem is referenced by:  nrelv  5244  ordtr3  5769  frlmssuvc2  20134  clsk1indlem1  38343  mapssbi  39405  fourierdlem10  40334  salgensscntex  40562
  Copyright terms: Public domain W3C validator