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 46314

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 11286	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
5		xrltnle 11303	. . . . 5 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^*) → (𝐶 < 𝐴 ↔ ¬ 𝐴 ≤ 𝐶))
6	2, 4, 5	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝐶 < 𝐴 ↔ ¬ 𝐴 ≤ 𝐶))
7	1, 6	mpbid 235	. . 3 ⊢ (𝜑 → ¬ 𝐴 ≤ 𝐶)
8	7	intnanrd 495	. 2 ⊢ (𝜑 → ¬ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵))
9		ltnelicc.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
10		elicc4 13468	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
11	4, 9, 2, 10	syl3anc 1398	. 2 ⊢ (𝜑 → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐵)))
12	8, 11	mtbird 328	1 ⊢ (𝜑 → ¬ 𝐶 ∈ (𝐴[,]𝐵))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 class class class wbr 5107 (class class class)co 7416 ℝcr 11126 ℝ^*cxr 11269 < clt 11270 ≤ cle 11271 [,]cicc 13403

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 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7419 df-oprab 7420 df-mpo 7421 df-xr 11274 df-le 11276 df-icc 13407

This theorem is used by: fourierdlem104 47025

W3C validator