iocinico - Mathbox for Jon Pennant

	Mathbox for Jon Pennant		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > iocinico		Structured version Visualization version GIF version

Theorem iocinico 44157

Description: The intersection of two sets that meet at a point is that point. (Contributed by Jon Pennant, 12-Jun-2019.)

**Assertion**
Ref	Expression
iocinico	⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)) = {𝐵})

Proof of Theorem iocinico Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-in 3905	. . . . . 6 ⊢ ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)) = {𝑥 ∣ (𝑥 ∈ (𝐴(,]𝐵) ∧ 𝑥 ∈ (𝐵[,)𝐶))}
2		elioc1 13488	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝑥 ∈ (𝐴(,]𝐵) ↔ (𝑥 ∈ ℝ^ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
3	2	3adant3 1150	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝑥 ∈ (𝐴(,]𝐵) ↔ (𝑥 ∈ ℝ^ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
4		3simpb 1167	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℝ^* ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵) → (𝑥 ∈ ℝ^* ∧ 𝑥 ≤ 𝐵))
5	3, 4	biimtrdi 256	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝑥 ∈ (𝐴(,]𝐵) → (𝑥 ∈ ℝ^ ∧ 𝑥 ≤ 𝐵)))
6		elico1 13489	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝑥 ∈ (𝐵[,)𝐶) ↔ (𝑥 ∈ ℝ^ ∧ 𝐵 ≤ 𝑥 ∧ 𝑥 < 𝐶)))
7	6	3adant1 1148	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝑥 ∈ (𝐵[,)𝐶) ↔ (𝑥 ∈ ℝ^ ∧ 𝐵 ≤ 𝑥 ∧ 𝑥 < 𝐶)))
8		3simpa 1166	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥 ∧ 𝑥 < 𝐶) → (𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥))
9	7, 8	biimtrdi 256	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝑥 ∈ (𝐵[,)𝐶) → (𝑥 ∈ ℝ^ ∧ 𝐵 ≤ 𝑥)))
10	5, 9	anim12d 621	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → ((𝑥 ∈ (𝐴(,]𝐵) ∧ 𝑥 ∈ (𝐵[,)𝐶)) → ((𝑥 ∈ ℝ^ ∧ 𝑥 ≤ 𝐵) ∧ (𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥))))
11		simpll 779	. . . . . . . . . 10 ⊢ (((𝑥 ∈ ℝ^* ∧ 𝑥 ≤ 𝐵) ∧ (𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥)) → 𝑥 ∈ ℝ^*)
12		simprr 785	. . . . . . . . . 10 ⊢ (((𝑥 ∈ ℝ^* ∧ 𝑥 ≤ 𝐵) ∧ (𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥)) → 𝐵 ≤ 𝑥)
13		simplr 781	. . . . . . . . . 10 ⊢ (((𝑥 ∈ ℝ^* ∧ 𝑥 ≤ 𝐵) ∧ (𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥)) → 𝑥 ≤ 𝐵)
14	11, 12, 13	3jca 1146	. . . . . . . . 9 ⊢ (((𝑥 ∈ ℝ^* ∧ 𝑥 ≤ 𝐵) ∧ (𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥)) → (𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵))
15	10, 14	syl6 36	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → ((𝑥 ∈ (𝐴(,]𝐵) ∧ 𝑥 ∈ (𝐵[,)𝐶)) → (𝑥 ∈ ℝ^ ∧ 𝐵 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)))
16		elicc1 13490	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝑥 ∈ (𝐵[,]𝐵) ↔ (𝑥 ∈ ℝ^ ∧ 𝐵 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)))
17	16	anidms 577	. . . . . . . . 9 ⊢ (𝐵 ∈ ℝ^* → (𝑥 ∈ (𝐵[,]𝐵) ↔ (𝑥 ∈ ℝ^* ∧ 𝐵 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)))
18	17	3ad2ant2 1152	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝑥 ∈ (𝐵[,]𝐵) ↔ (𝑥 ∈ ℝ^ ∧ 𝐵 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵)))
19	15, 18	sylibrd 262	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → ((𝑥 ∈ (𝐴(,]𝐵) ∧ 𝑥 ∈ (𝐵[,)𝐶)) → 𝑥 ∈ (𝐵[,]𝐵)))
20	19	ss2abdv 4012	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → {𝑥 ∣ (𝑥 ∈ (𝐴(,]𝐵) ∧ 𝑥 ∈ (𝐵[,)𝐶))} ⊆ {𝑥 ∣ 𝑥 ∈ (𝐵[,]𝐵)})
21	1, 20	eqsstrid 3968	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)) ⊆ {𝑥 ∣ 𝑥 ∈ (𝐵[,]𝐵)})
22		abid2 2897	. . . . 5 ⊢ {𝑥 ∣ 𝑥 ∈ (𝐵[,]𝐵)} = (𝐵[,]𝐵)
23	21, 22	sseqtrdi 3970	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)) ⊆ (𝐵[,]𝐵))
24	23	adantr 486	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)) ⊆ (𝐵[,]𝐵))
25		iccid 13491	. . . . 5 ⊢ (𝐵 ∈ ℝ^* → (𝐵[,]𝐵) = {𝐵})
26	25	3ad2ant2 1152	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐵[,]𝐵) = {𝐵})
27	26	adantr 486	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → (𝐵[,]𝐵) = {𝐵})
28	24, 27	sseqtrd 3966	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)) ⊆ {𝐵})
29		simpl2 1211	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ ℝ^)
30		simprl 783	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐴 < 𝐵)
31	29	xrleidd 13251	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ≤ 𝐵)
32		elioc1 13488	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐵 ∈ (𝐴(,]𝐵) ↔ (𝐵 ∈ ℝ^ ∧ 𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐵)))
33	32	3adant3 1150	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐵 ∈ (𝐴(,]𝐵) ↔ (𝐵 ∈ ℝ^ ∧ 𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐵)))
34	33	adantr 486	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → (𝐵 ∈ (𝐴(,]𝐵) ↔ (𝐵 ∈ ℝ^ ∧ 𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐵)))
35	29, 30, 31, 34	mpbir3and 1361	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ (𝐴(,]𝐵))
36		simprr 785	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 < 𝐶)
37		elico1 13489	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐵 ∈ (𝐵[,)𝐶) ↔ (𝐵 ∈ ℝ^ ∧ 𝐵 ≤ 𝐵 ∧ 𝐵 < 𝐶)))
38	37	3adant1 1148	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐵 ∈ (𝐵[,)𝐶) ↔ (𝐵 ∈ ℝ^ ∧ 𝐵 ≤ 𝐵 ∧ 𝐵 < 𝐶)))
39	38	adantr 486	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → (𝐵 ∈ (𝐵[,)𝐶) ↔ (𝐵 ∈ ℝ^ ∧ 𝐵 ≤ 𝐵 ∧ 𝐵 < 𝐶)))
40	29, 31, 36, 39	mpbir3and 1361	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ (𝐵[,)𝐶))
41	35, 40	elind 4145	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)))
42	41	snssd 4746	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → {𝐵} ⊆ ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)))
43	28, 42	eqssd 3947	1 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,]𝐵) ∩ (𝐵[,)𝐶)) = {𝐵})

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {cab 2738 ∩ cin 3897 ⊆ wss 3898 {csn 4583 class class class wbr 5102 (class class class)co 7408 ℝ^*cxr 11314 < clt 11315 ≤ cle 11316 (,]cioc 13447 [,)cico 13448 [,]cicc 13449

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 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11228 ax-resscn 11229 ax-pre-lttri 11246 ax-pre-lttrn 11247

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11317 df-mnf 11318 df-xr 11319 df-ltxr 11320 df-le 11321 df-ioc 13451 df-ico 13452 df-icc 13453

This theorem is used by: (None)

W3C validator