Theorem dalemclccjdd 38863

Description: Lemma for dath 38911. Frequently-used utility lemma. (Contributed by NM, 15-Aug-2012.)

Hypothesis

Ref	Expression
da.ps0	⊢ (𝜓 ↔ ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))))

Assertion

Ref	Expression
dalemclccjdd	⊢ (𝜓 → 𝐶 ≤ (𝑐 ∨ 𝑑))

Proof of Theorem dalemclccjdd

Step	Hyp	Ref	Expression
1		da.ps0	. 2 ⊢ (𝜓 ↔ ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))))
2		simp33 1210	. 2 ⊢ (((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))) → 𝐶 ≤ (𝑐 ∨ 𝑑))
3	1, 2	sylbi 216	1 ⊢ (𝜓 → 𝐶 ≤ (𝑐 ∨ 𝑑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2105   ≠ wne 2939   class class class wbr 5148  (class class class)co 7412

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 206  df-an 396  df-3an 1088

This theorem is referenced by:  dalemswapyzps  38865  dalemrotps  38866  dalem21  38869  dalem25  38873