difioo - Mathbox for Thierry Arnoux

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

Theorem difioo 30531

Description: The difference between two open intervals sharing the same lower bound. (Contributed by Thierry Arnoux, 26-Sep-2017.)

**Assertion**
Ref	Expression
difioo	⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶))

**Proof of Theorem difioo**
Step	Hyp	Ref	Expression
1		incom 4128	. . . 4 ⊢ ((𝐴(,)𝐵) ∩ (𝐵[,)𝐶)) = ((𝐵[,)𝐶) ∩ (𝐴(,)𝐵))
2		joiniooico 30523	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (((𝐴(,)𝐵) ∩ (𝐵[,)𝐶)) = ∅ ∧ ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶)))
3	2	anassrs 471	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → (((𝐴(,)𝐵) ∩ (𝐵[,)𝐶)) = ∅ ∧ ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶)))
4	3	simpld 498	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐴(,)𝐵) ∩ (𝐵[,)𝐶)) = ∅)
5	1, 4	syl5eqr 2847	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐵[,)𝐶) ∩ (𝐴(,)𝐵)) = ∅)
6	3	simprd 499	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶))
7		uncom 4080	. . . . 5 ⊢ ((𝐵[,)𝐶) ∪ (𝐴(,)𝐵)) = ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶))
8	7	a1i 11	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐵[,)𝐶) ∪ (𝐴(,)𝐵)) = ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)))
9		simpll1 1209	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → 𝐴 ∈ ℝ^)
10		simpl3 1190	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) → 𝐶 ∈ ℝ^)
11	10	adantr 484	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → 𝐶 ∈ ℝ^)
12	9	xrleidd 12533	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐴)
13		simpr 488	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → 𝐵 ≤ 𝐶)
14		ioossioo 12819	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐵 ≤ 𝐶)) → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐶))
15	9, 11, 12, 13, 14	syl22anc 837	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐶))
16		ssequn2 4110	. . . . 5 ⊢ ((𝐴(,)𝐵) ⊆ (𝐴(,)𝐶) ↔ ((𝐴(,)𝐶) ∪ (𝐴(,)𝐵)) = (𝐴(,)𝐶))
17	15, 16	sylib 221	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐴(,)𝐶) ∪ (𝐴(,)𝐵)) = (𝐴(,)𝐶))
18	6, 8, 17	3eqtr4d 2843	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐵[,)𝐶) ∪ (𝐴(,)𝐵)) = ((𝐴(,)𝐶) ∪ (𝐴(,)𝐵)))
19		difeq 30289	. . 3 ⊢ (((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶) ↔ (((𝐵[,)𝐶) ∩ (𝐴(,)𝐵)) = ∅ ∧ ((𝐵[,)𝐶) ∪ (𝐴(,)𝐵)) = ((𝐴(,)𝐶) ∪ (𝐴(,)𝐵))))
20	5, 18, 19	sylanbrc 586	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶))
21		simpll1 1209	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐴 ∈ ℝ^)
22		simpl2 1189	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ^)
23	22	adantr 484	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐵 ∈ ℝ^)
24	21	xrleidd 12533	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐴 ≤ 𝐴)
25	10	adantr 484	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐶 ∈ ℝ^)
26		simpr 488	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐶 < 𝐵)
27	25, 23, 26	xrltled 12531	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐶 ≤ 𝐵)
28		ioossioo 12819	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐶 ≤ 𝐵)) → (𝐴(,)𝐶) ⊆ (𝐴(,)𝐵))
29	21, 23, 24, 27, 28	syl22anc 837	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → (𝐴(,)𝐶) ⊆ (𝐴(,)𝐵))
30		ssdif0 4277	. . . 4 ⊢ ((𝐴(,)𝐶) ⊆ (𝐴(,)𝐵) ↔ ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = ∅)
31	29, 30	sylib 221	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = ∅)
32		ico0 12772	. . . . 5 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → ((𝐵[,)𝐶) = ∅ ↔ 𝐶 ≤ 𝐵))
33	32	biimpar 481	. . . 4 ⊢ (((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐶 ≤ 𝐵) → (𝐵[,)𝐶) = ∅)
34	23, 25, 27, 33	syl21anc 836	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → (𝐵[,)𝐶) = ∅)
35	31, 34	eqtr4d 2836	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶))
36		xrlelttric 30502	. . 3 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐵 ≤ 𝐶 ∨ 𝐶 < 𝐵))
37	22, 10, 36	syl2anc 587	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) → (𝐵 ≤ 𝐶 ∨ 𝐶 < 𝐵))
38	20, 35, 37	mpjaodan 956	1 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∨ wo 844 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ∖ cdif 3878 ∪ cun 3879 ∩ cin 3880 ⊆ wss 3881 ∅c0 4243 class class class wbr 5030 (class class class)co 7135 ℝ^*cxr 10663 < clt 10664 ≤ cle 10665 (,)cioo 12726 [,)cico 12728

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-q 12337 df-ioo 12730 df-ico 12732

This theorem is referenced by: dya2iocbrsiga 31643 dya2icobrsiga 31644

W3C validator