gtnelicc - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > gtnelicc		Structured version Visualization version GIF version

Theorem gtnelicc 46142

Description: A real number greater than the upper bound of a closed interval is not an element of the interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
gtnelicc.a	⊢ (𝜑 → 𝐴 ∈ ℝ^*)
gtnelicc.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
gtnelicc.c	⊢ (𝜑 → 𝐶 ∈ ℝ^*)
gtnelicc.bltc	⊢ (𝜑 → 𝐵 < 𝐶)

**Assertion**
Ref	Expression
gtnelicc	⊢ (𝜑 → ¬ 𝐶 ∈ (𝐴[,]𝐵))

**Proof of Theorem gtnelicc**
Step	Hyp	Ref	Expression
1		gtnelicc.bltc	. . . 4 ⊢ (𝜑 → 𝐵 < 𝐶)
2		gtnelicc.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ)
3	2	rexrd 11259	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
4		gtnelicc.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ^*)
5		xrltnle 11276	. . . . 5 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐵 < 𝐶 ↔ ¬ 𝐶 ≤ 𝐵))
6	3, 4, 5	syl2anc 595	. . . 4 ⊢ (𝜑 → (𝐵 < 𝐶 ↔ ¬ 𝐶 ≤ 𝐵))
7	1, 6	mpbid 235	. . 3 ⊢ (𝜑 → ¬ 𝐶 ≤ 𝐵)
8	7	intnand 493	. 2 ⊢ (𝜑 → ¬ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))
9		gtnelicc.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
10		elicc4 13440	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
11	9, 3, 4, 10	syl3anc 1396	. 2 ⊢ (𝜑 → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
12	8, 11	mtbird 328	1 ⊢ (𝜑 → ¬ 𝐶 ∈ (𝐴[,]𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2149 class class class wbr 5113 (class class class)co 7411 ℝcr 11099 ℝ^*cxr 11242 < clt 11243 ≤ cle 11244 [,]cicc 13375

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-xr 11247 df-le 11249 df-icc 13379

This theorem is referenced by: fourierdlem103 46849

W3C validator