Theorem adantl4r 767

Description: Deduction adding 1 conjunct to antecedent. (Contributed by Thierry Arnoux, 11-Feb-2018.)

Hypothesis

Ref	Expression
adantl4r.1	⊢ (((((𝜑 ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) → 𝜅)

Assertion

Ref	Expression
adantl4r	⊢ ((((((𝜑 ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) → 𝜅)

Proof of Theorem adantl4r

Step	Hyp	Ref	Expression
1		adantl4r.1	. . . 4 ⊢ (((((𝜑 ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) → 𝜅)
2	1	ex 417	. . 3 ⊢ ((((𝜑 ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) → (𝜆 → 𝜅))
3	2	adantl3r 762	. 2 ⊢ (((((𝜑 ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) → (𝜆 → 𝜅))
4	3	imp 411	1 ⊢ ((((((𝜑 ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) → 𝜅)

Syntax hints:   → wi 4   ∧ wa 400

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 210  df-an 401

This theorem is referenced by:  adantl5r  774  perpneq  28952  rhmimaidl  33683  zarclsun  34204  pstmxmet  34231  limsupmnflem  46325  xlimmnfvlem2  46438  xlimpnfvlem2  46442  icccncfext  46492  hspmbllem2  47232