Theorem iccleubd 46504

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 13513	. 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ (𝐴[,]𝐵)) → 𝐶 ≤ 𝐵)
5	1, 2, 3, 4	syl3anc 1398	1 ⊢ (𝜑 → 𝐶 ≤ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145   class class class wbr 5103  (class class class)co 7412  ℝ^*cxr 11323   ≤ cle 11325  [,]cicc 13460

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-xr 11328  df-icc 13464

This theorem is used by:  sqrlearg  46509