Theorem iccleubd 46305

Description: An element of a closed interval is less than or equal to its upper bound. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
iccleubd.1	⊢ (𝜑 → 𝐴 ∈ ℝ*)
iccleubd.2	⊢ (𝜑 → 𝐵 ∈ ℝ*)
iccleubd.3	⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵))

Assertion

Ref	Expression
iccleubd	⊢ (𝜑 → 𝐶 ≤ 𝐵)

Proof of Theorem iccleubd

Step	Hyp	Ref	Expression
1		iccleubd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
2		iccleubd.2	. 2 ⊢ (𝜑 → 𝐵 ∈ ℝ*)
3		iccleubd.3	. 2 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵))
4		iccleub 13446	. 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ (𝐴[,]𝐵)) → 𝐶 ≤ 𝐵)
5	1, 2, 3, 4	syl3anc 1398	1 ⊢ (𝜑 → 𝐶 ≤ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146   class class class wbr 5114  (class class class)co 7423  ℝ^*cxr 11260   ≤ cle 11262  [,]cicc 13393

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-xr 11265  df-icc 13397

This theorem is used by:  sqrlearg  46310