Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Propositional calculus
Mixed connectives
ecase3adOLD
Metamath Proof Explorer
Description: Obsolete version of ecase3ad as of 20-Sep-2024. (Contributed by NM , 24-May-2013) (Proof modification is discouraged.)
(New usage is discouraged.)
Ref
Expression
Hypotheses
ecase3ad.1
⊢ ( 𝜑 → ( 𝜓 → 𝜃 ) )
ecase3ad.2
⊢ ( 𝜑 → ( 𝜒 → 𝜃 ) )
ecase3ad.3
⊢ ( 𝜑 → ( ( ¬ 𝜓 ∧ ¬ 𝜒 ) → 𝜃 ) )
Assertion
ecase3adOLD
⊢ ( 𝜑 → 𝜃 )
Proof
Step
Hyp
Ref
Expression
1
ecase3ad.1
⊢ ( 𝜑 → ( 𝜓 → 𝜃 ) )
2
ecase3ad.2
⊢ ( 𝜑 → ( 𝜒 → 𝜃 ) )
3
ecase3ad.3
⊢ ( 𝜑 → ( ( ¬ 𝜓 ∧ ¬ 𝜒 ) → 𝜃 ) )
4
notnotr
⊢ ( ¬ ¬ 𝜓 → 𝜓 )
5
4 1
syl5
⊢ ( 𝜑 → ( ¬ ¬ 𝜓 → 𝜃 ) )
6
notnotr
⊢ ( ¬ ¬ 𝜒 → 𝜒 )
7
6 2
syl5
⊢ ( 𝜑 → ( ¬ ¬ 𝜒 → 𝜃 ) )
8
5 7 3
ecased
⊢ ( 𝜑 → 𝜃 )