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

Theorem 0inp0 4211
Description: Something cannot be equal to both the null set and the power set of the null set. (Contributed by NM, 30-Sep-2003.)
Assertion
Ref Expression
0inp0  |-  ( A  =  (/)  ->  -.  A  =  { (/) } )

Proof of Theorem 0inp0
StepHypRef Expression
1 0nep0 4210 . . 3  |-  (/)  =/=  { (/)
}
2 neeq1 2389 . . 3  |-  ( A  =  (/)  ->  ( A  =/=  { (/) }  <->  (/)  =/=  { (/)
} ) )
31, 2mpbiri 168 . 2  |-  ( A  =  (/)  ->  A  =/= 
{ (/) } )
43neneqd 2397 1  |-  ( A  =  (/)  ->  -.  A  =  { (/) } )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1373    =/= wne 2376   (/)c0 3460   {csn 3633
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187  ax-nul 4171
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-v 2774  df-dif 3168  df-nul 3461  df-sn 3639
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator