Theorem adantl4r 768

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 418	. . 3 ⊢ ((((𝜑 ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) → (𝜆 → 𝜅))
3	2	adantl3r 763	. 2 ⊢ (((((𝜑 ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) → (𝜆 → 𝜅))
4	3	imp 412	1 ⊢ ((((((𝜑 ∧ 𝜁) ∧ 𝜎) ∧ 𝜌) ∧ 𝜇) ∧ 𝜆) → 𝜅)

This proof depends on syntax axioms:   → wi 4   ∧ 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

This theorem is used by:  adantl5r  775  perpneq  29047  rhmimaidl  33806  zarclsun  34326  pstmxmet  34353  limsupmnflem  46494  xlimmnfvlem2  46607  xlimpnfvlem2  46611  icccncfext  46661  hspmbllem2  47401