Theorem wl-nannan 32477

Description: Lemma for handling nested 'nand's. (Contributed by Jeff Hoffman, 19-Nov-2007.) (Revised by Wolf Lammen, 26-Jun-2020.)

Assertion

Ref	Expression
wl-nannan	⊢ ((𝜑 ⊼ (𝜓 ⊼ 𝜒)) ↔ (𝜑 → (𝜓 ∧ 𝜒)))

Proof of Theorem wl-nannan

Step	Hyp	Ref	Expression
1		wl-dfnan2 32475	. 2 ⊢ ((𝜑 ⊼ (𝜓 ⊼ 𝜒)) ↔ (𝜑 → ¬ (𝜓 ⊼ 𝜒)))
2		nanan 1441	. . 3 ⊢ ((𝜓 ∧ 𝜒) ↔ ¬ (𝜓 ⊼ 𝜒))
3	2	imbi2i 325	. 2 ⊢ ((𝜑 → (𝜓 ∧ 𝜒)) ↔ (𝜑 → ¬ (𝜓 ⊼ 𝜒)))
4	1, 3	bitr4i 266	1 ⊢ ((𝜑 ⊼ (𝜓 ⊼ 𝜒)) ↔ (𝜑 → (𝜓 ∧ 𝜒)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383   ⊼ 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)