Theorem sepimandl-P4.9d.RC 416

Description: Inference Form of sepimandl-P4.9d 415.

Hypothesis

Ref	Expression
sepimandl-P4.9d.RC.1	⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Assertion

Ref	Expression
sepimandl-P4.9d.RC	⊢ ((𝜑 → 𝜒) ∨ (𝜓 → 𝜒))

Proof of Theorem sepimandl-P4.9d.RC

Step	Hyp	Ref	Expression
1		sepimandl-P4.9d.RC.1	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝜒)
2	1	ndtruei-P3.17 182	. . 3 ⊢ (⊤ → ((𝜑 ∧ 𝜓) → 𝜒))
3	2	sepimandl-P4.9d 415	. 2 ⊢ (⊤ → ((𝜑 → 𝜒) ∨ (𝜓 → 𝜒)))
4	3	ndtruee-P3.18 183	1 ⊢ ((𝜑 → 𝜒) ∨ (𝜓 → 𝜒))

Syntax hints:   → wff-imp 10   ∧ wff-and 132   ∨ wff-or 144  ⊤wff-true 153

This theorem was proved from axioms:  ax-L1 11  ax-L2 12  ax-L3 13  ax-MP 14

This theorem depends on definitions:  df-bi-D2.1 107  df-and-D2.2 133  df-or-D2.3 145  df-true-D2.4 155  df-rcp-AND3 161

This theorem is referenced by: (None)