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

Theorem nic-bijust 1603
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 1604 and nic-bi2 1605 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 ((𝜏𝜏) ⊼ ((𝜏𝜏) ⊼ (𝜏𝜏)))

Proof of Theorem nic-bijust
StepHypRef Expression
1 nic-swap 1595 1 ((𝜏𝜏) ⊼ ((𝜏𝜏) ⊼ (𝜏𝜏)))
Colors of variables: wff setvar class
Syntax hints:  wnan 1439
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 196  df-an 385  df-nan 1440
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator