Theorem exbirVD 45820

Description: Virtual deduction proof of exbir 45447. 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::	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))    ▶   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   )
2::	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,    (𝜑 ∧ 𝜓)   ▶   (𝜑 ∧ 𝜓)   )
3::	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,    (𝜑 ∧ 𝜓), 𝜃   ▶   𝜃   )
5:1,2,?: e12 45691	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓)   ▶   (𝜒 ↔ 𝜃)   )
6:3,5,?: e32 45725	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓), 𝜃   ▶   𝜒   )
7:6:	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓)   ▶   (𝜃 → 𝜒)   )
8:7:	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))    ▶   ((𝜑 ∧ 𝜓) → (𝜃 → 𝜒))   )
9:8,?: e1a 45595	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ▶   (𝜑 → (𝜓 → (𝜃 → 𝜒)))   )
qed:9:	⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) → (𝜑 → (𝜓 → (𝜃 → 𝜒))))

(Contributed by Alan Sare, 13-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
exbirVD	⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) → (𝜑 → (𝜓 → (𝜃 → 𝜒))))

Proof of Theorem exbirVD

Step	Hyp	Ref	Expression
1		idn3 45583	. . . . . 6 ⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,   (𝜑 ∧ 𝜓)   ,   𝜃   ▶   𝜃   )
2		idn1 45542	. . . . . . 7 ⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ▶   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   )
3		idn2 45581	. . . . . . 7 ⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,   (𝜑 ∧ 𝜓)   ▶   (𝜑 ∧ 𝜓)   )
4		id 23	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) → ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)))
5	2, 3, 4	e12 45691	. . . . . 6 ⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,   (𝜑 ∧ 𝜓)   ▶   (𝜒 ↔ 𝜃)   )
6		biimpr 223	. . . . . . 7 ⊢ ((𝜒 ↔ 𝜃) → (𝜃 → 𝜒))
7	6	com12 33	. . . . . 6 ⊢ (𝜃 → ((𝜒 ↔ 𝜃) → 𝜒))
8	1, 5, 7	e32 45725	. . . . 5 ⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,   (𝜑 ∧ 𝜓)   ,   𝜃   ▶   𝜒   )
9	8	in3 45577	. . . 4 ⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,   (𝜑 ∧ 𝜓)   ▶   (𝜃 → 𝜒)   )
10	9	in2 45573	. . 3 ⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ▶   ((𝜑 ∧ 𝜓) → (𝜃 → 𝜒))   )
11		pm3.3 454	. . 3 ⊢ (((𝜑 ∧ 𝜓) → (𝜃 → 𝜒)) → (𝜑 → (𝜓 → (𝜃 → 𝜒))))
12	10, 11	e1a 45595	. 2 ⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ▶   (𝜑 → (𝜓 → (𝜃 → 𝜒)))   )
13	12	in1 45539	1 ⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) → (𝜑 → (𝜓 → (𝜃 → 𝜒))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-vd1 45538  df-vd2 45546  df-vd3 45558

This theorem is used by: (None)