elicoelioo - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > elicoelioo		Structured version Visualization version GIF version

Theorem elicoelioo 31001

Description: Relate elementhood to a closed-below, open-above interval with elementhood to the same open interval or to its lower bound. (Contributed by Thierry Arnoux, 6-Jul-2017.)

**Assertion**
Ref	Expression
elicoelioo	⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵))))

**Proof of Theorem elicoelioo**
Step	Hyp	Ref	Expression
1		simpl1 1189	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → 𝐴 ∈ ℝ^*)
2		simpl2 1190	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → 𝐵 ∈ ℝ^*)
3		simprl 767	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → 𝐶 ∈ (𝐴[,)𝐵))
4		elico1 13051	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ^ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)))
5	4	biimpa 476	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐶 ∈ (𝐴[,)𝐵)) → (𝐶 ∈ ℝ^ ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵))
6	5	simp1d 1140	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐶 ∈ (𝐴[,)𝐵)) → 𝐶 ∈ ℝ^)
7	1, 2, 3, 6	syl21anc 834	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → 𝐶 ∈ ℝ^*)
8	5	simp2d 1141	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐶 ∈ (𝐴[,)𝐵)) → 𝐴 ≤ 𝐶)
9	1, 2, 3, 8	syl21anc 834	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → 𝐴 ≤ 𝐶)
10	1, 2	jca 511	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
11		simprr 769	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → ¬ 𝐶 ∈ (𝐴(,)𝐵))
12	5	simp3d 1142	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 𝐶 ∈ (𝐴[,)𝐵)) → 𝐶 < 𝐵)
13	10, 3, 12	syl2anc 583	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → 𝐶 < 𝐵)
14		elioo1 13048	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ^ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)))
15	14	notbid 317	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (¬ 𝐶 ∈ (𝐴(,)𝐵) ↔ ¬ (𝐶 ∈ ℝ^ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)))
16	15	biimpa 476	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵)) → ¬ (𝐶 ∈ ℝ^ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))
17		3anan32 1095	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵) ↔ ((𝐶 ∈ ℝ^* ∧ 𝐶 < 𝐵) ∧ 𝐴 < 𝐶))
18	17	notbii 319	. . . . . . . . . . 11 ⊢ (¬ (𝐶 ∈ ℝ^* ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵) ↔ ¬ ((𝐶 ∈ ℝ^* ∧ 𝐶 < 𝐵) ∧ 𝐴 < 𝐶))
19		imnan 399	. . . . . . . . . . 11 ⊢ (((𝐶 ∈ ℝ^* ∧ 𝐶 < 𝐵) → ¬ 𝐴 < 𝐶) ↔ ¬ ((𝐶 ∈ ℝ^* ∧ 𝐶 < 𝐵) ∧ 𝐴 < 𝐶))
20	18, 19	bitr4i 277	. . . . . . . . . 10 ⊢ (¬ (𝐶 ∈ ℝ^* ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵) ↔ ((𝐶 ∈ ℝ^* ∧ 𝐶 < 𝐵) → ¬ 𝐴 < 𝐶))
21	16, 20	sylib 217	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵)) → ((𝐶 ∈ ℝ^ ∧ 𝐶 < 𝐵) → ¬ 𝐴 < 𝐶))
22	21	imp 406	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵)) ∧ (𝐶 ∈ ℝ^ ∧ 𝐶 < 𝐵)) → ¬ 𝐴 < 𝐶)
23	10, 11, 7, 13, 22	syl22anc 835	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → ¬ 𝐴 < 𝐶)
24		xeqlelt 30999	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐴 = 𝐶 ↔ (𝐴 ≤ 𝐶 ∧ ¬ 𝐴 < 𝐶)))
25	24	biimpar 477	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐶 ∧ ¬ 𝐴 < 𝐶)) → 𝐴 = 𝐶)
26	1, 7, 9, 23, 25	syl22anc 835	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵))) → 𝐴 = 𝐶)
27	26	ex 412	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐴 = 𝐶))
28		eqcom 2745	. . . . 5 ⊢ (𝐴 = 𝐶 ↔ 𝐶 = 𝐴)
29	27, 28	syl6ib 250	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐶 = 𝐴))
30		pm5.6 998	. . . 4 ⊢ (((𝐶 ∈ (𝐴[,)𝐵) ∧ ¬ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐶 = 𝐴) ↔ (𝐶 ∈ (𝐴[,)𝐵) → (𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴)))
31	29, 30	sylib 217	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → (𝐶 ∈ (𝐴[,)𝐵) → (𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴)))
32		orcom 866	. . 3 ⊢ ((𝐶 ∈ (𝐴(,)𝐵) ∨ 𝐶 = 𝐴) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵)))
33	31, 32	syl6ib 250	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → (𝐶 ∈ (𝐴[,)𝐵) → (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵))))
34		simpr 484	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐶 = 𝐴)
35		simpl1 1189	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐴 ∈ ℝ^*)
36	34, 35	eqeltrd 2839	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐶 ∈ ℝ^*)
37	35	xrleidd 12815	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐴 ≤ 𝐴)
38	37, 34	breqtrrd 5098	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐴 ≤ 𝐶)
39		simpl3 1191	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐴 < 𝐵)
40	34, 39	eqbrtrd 5092	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐶 < 𝐵)
41		simpl2 1190	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐵 ∈ ℝ^*)
42	35, 41, 4	syl2anc 583	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ^* ∧ 𝐴 ≤ 𝐶 ∧ 𝐶 < 𝐵)))
43	36, 38, 40, 42	mpbir3and 1340	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 = 𝐴) → 𝐶 ∈ (𝐴[,)𝐵))
44		ioossico 13099	. . . . 5 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,)𝐵)
45		simpr 484	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ (𝐴(,)𝐵))
46	44, 45	sselid 3915	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ (𝐴[,)𝐵))
47	43, 46	jaodan 954	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) ∧ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵))) → 𝐶 ∈ (𝐴[,)𝐵))
48	47	ex 412	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ (𝐴[,)𝐵)))
49	33, 48	impbid 211	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 = 𝐴 ∨ 𝐶 ∈ (𝐴(,)𝐵))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 (class class class)co 7255 ℝ^*cxr 10939 < clt 10940 ≤ cle 10941 (,)cioo 13008 [,)cico 13010

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-pre-lttri 10876 ax-pre-lttrn 10877

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-po 5494 df-so 5495 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-ioo 13012 df-ico 13014

This theorem is referenced by: xrge0mulc1cn 31793

W3C validator