MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nic-bijust Unicode version

Theorem nic-bijust 1442
Description: For nic-* definitions, the biconditional connective is not used. Instead, definitions are made based on this form. nic-bi1 1443 and nic-bi2 1444 are used to convert the definitions into usable theorems about one side of the implication. (Contributed by Jeff Hoffman, 18-Nov-2007.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
nic-bijust  |-  ( ( ta  -/\  ta )  -/\  ( ( ta  -/\  ta )  -/\  ( ta  -/\ 
ta ) ) )

Proof of Theorem nic-bijust
StepHypRef Expression
1 nic-swap 1434 1  |-  ( ( ta  -/\  ta )  -/\  ( ( ta  -/\  ta )  -/\  ( ta  -/\ 
ta ) ) )
Colors of variables: wff set class
Syntax hints:    -/\ wnan 1287
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 177  df-an 360  df-nan 1288
  Copyright terms: Public domain W3C validator