Theorem biijust 570

Description: Theorem used to justify definition of intuitionistic biconditional df-bi 110. (Contributed by NM, 24-Nov-2017.)

Assertion

Ref	Expression
biijust	⊢ ((((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) → ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑))) ∧ (((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) → ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑))))

Proof of Theorem biijust

Step	Hyp	Ref	Expression
1		id 19	. 2 ⊢ (((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) → ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)))
2	1, 1	pm3.2i 257	1 ⊢ ((((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) → ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑))) ∧ (((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) → ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑))))

Syntax hints:   → wi 4   ∧ wa 97

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia3 101

This theorem is referenced by: (None)