Theorem ancomstVD 42485

Description: Closed form of ancoms 459. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ ((𝜑 ∧ 𝜓) ↔ (𝜓 ∧ 𝜑))
qed:1,?: e0a 42392	⊢ (((𝜑 ∧ 𝜓) → 𝜒) ↔ ((𝜓 ∧ 𝜑) → 𝜒))

The proof of ancomst 465 is derived automatically from it. (Contributed by Alan Sare, 25-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
ancomstVD	⊢ (((𝜑 ∧ 𝜓) → 𝜒) ↔ ((𝜓 ∧ 𝜑) → 𝜒))

Proof of Theorem ancomstVD

Step	Hyp	Ref	Expression
1		ancom 461	. 2 ⊢ ((𝜑 ∧ 𝜓) ↔ (𝜓 ∧ 𝜑))
2		imbi1 348	. 2 ⊢ (((𝜑 ∧ 𝜓) ↔ (𝜓 ∧ 𝜑)) → (((𝜑 ∧ 𝜓) → 𝜒) ↔ ((𝜓 ∧ 𝜑) → 𝜒)))
3	1, 2	e0a 42392	1 ⊢ (((𝜑 ∧ 𝜓) → 𝜒) ↔ ((𝜓 ∧ 𝜑) → 𝜒))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396

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 206  df-an 397

This theorem is referenced by: (None)