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

Theorem nic-bijust 1612
Description: Biconditional justification from Nicod's axiom. For nic-* definitions, the biconditional connective is not used. Instead, definitions are made based on this form. nic-bi1 1613 and nic-bi2 1614 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 1604 1  |-  ( ( ta  -/\  ta )  -/\  ( ( ta  -/\  ta )  -/\  ( ta  -/\ 
ta ) ) )
Colors of variables: wff setvar class
Syntax hints:    -/\ wnan 1447
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 197  df-an 386  df-nan 1448
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator