ltnelicc - Mathbox for Glauco Siliprandi

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

Theorem ltnelicc 43855

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

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

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

**Proof of Theorem ltnelicc**
Step	Hyp	Ref	Expression
1		ltnelicc.clta	. . . 4 ⊢ (𝜑 → 𝐶 < 𝐴)
2		ltnelicc.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ^*)
3		ltnelicc.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ)
4	3	rexrd 11214	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
5		xrltnle 11231	. . . . 5 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^*) → (𝐶 < 𝐴 ↔ ¬ 𝐴 ≤ 𝐶))
6	2, 4, 5	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝐶 < 𝐴 ↔ ¬ 𝐴 ≤ 𝐶))
7	1, 6	mpbid 231	. . 3 ⊢ (𝜑 → ¬ 𝐴 ≤ 𝐶)
8	7	intnanrd 490	. 2 ⊢ (𝜑 → ¬ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))
9		ltnelicc.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
10		elicc4 13341	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
11	4, 9, 2, 10	syl3anc 1371	. 2 ⊢ (𝜑 → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
12	8, 11	mtbird 324	1 ⊢ (𝜑 → ¬ 𝐶 ∈ (𝐴[,]𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∈ wcel 2106 class class class wbr 5110 (class class class)co 7362 ℝcr 11059 ℝ^*cxr 11197 < clt 11198 ≤ cle 11199 [,]cicc 13277

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5261 ax-nul 5268 ax-pr 5389 ax-un 7677 ax-cnex 11116 ax-resscn 11117

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ral 3061 df-rex 3070 df-rab 3406 df-v 3448 df-sbc 3743 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-opab 5173 df-id 5536 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-iota 6453 df-fun 6503 df-fv 6509 df-ov 7365 df-oprab 7366 df-mpo 7367 df-xr 11202 df-le 11204 df-icc 13281

This theorem is referenced by: fourierdlem104 44571

W3C validator