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 33470

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 4109	. . . 4 ⊢ ((𝐴(,)𝐵) ∩ (𝐵[,)𝐶)) = ((𝐵[,)𝐶) ∩ (𝐴(,)𝐵))
2		joiniooico 33462	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶)) → (((𝐴(,)𝐵) ∩ (𝐵[,)𝐶)) = ∅ ∧ ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶)))
3	2	anassrs 473	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → (((𝐴(,)𝐵) ∩ (𝐵[,)𝐶)) = ∅ ∧ ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶)))
4	3	simpld 500	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐴(,)𝐵) ∩ (𝐵[,)𝐶)) = ∅)
5	1, 4	eqtr3id 2812	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐵[,)𝐶) ∩ (𝐴(,)𝐵)) = ∅)
6	3	simprd 501	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶))
7		uncom 4160	. . . . 5 ⊢ ((𝐵[,)𝐶) ∪ (𝐴(,)𝐵)) = ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶))
8	7	a1i 11	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐵[,)𝐶) ∪ (𝐴(,)𝐵)) = ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)))
9		simpll1 1231	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → 𝐴 ∈ ℝ^)
10		simpl3 1212	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) → 𝐶 ∈ ℝ^)
11	10	adantr 486	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → 𝐶 ∈ ℝ^)
12	9	xrleidd 13321	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐴)
13		simpr 490	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → 𝐵 ≤ 𝐶)
14		ioossioo 13612	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐵 ≤ 𝐶)) → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐶))
15	9, 11, 12, 13, 14	syl22anc 852	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → (𝐴(,)𝐵) ⊆ (𝐴(,)𝐶))
16		ssequn2 4190	. . . . 5 ⊢ ((𝐴(,)𝐵) ⊆ (𝐴(,)𝐶) ↔ ((𝐴(,)𝐶) ∪ (𝐴(,)𝐵)) = (𝐴(,)𝐶))
17	15, 16	sylib 221	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐴(,)𝐶) ∪ (𝐴(,)𝐵)) = (𝐴(,)𝐶))
18	6, 8, 17	3eqtr4d 2808	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐵[,)𝐶) ∪ (𝐴(,)𝐵)) = ((𝐴(,)𝐶) ∪ (𝐴(,)𝐵)))
19		difeq 33213	. . 3 ⊢ (((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶) ↔ (((𝐵[,)𝐶) ∩ (𝐴(,)𝐵)) = ∅ ∧ ((𝐵[,)𝐶) ∪ (𝐴(,)𝐵)) = ((𝐴(,)𝐶) ∪ (𝐴(,)𝐵))))
20	5, 18, 19	sylanbrc 595	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐵 ≤ 𝐶) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶))
21		simpll1 1231	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐴 ∈ ℝ^)
22		simpl2 1211	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ^)
23	22	adantr 486	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐵 ∈ ℝ^)
24	21	xrleidd 13321	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐴 ≤ 𝐴)
25	10	adantr 486	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐶 ∈ ℝ^)
26		simpr 490	. . . . . 6 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐶 < 𝐵)
27	25, 23, 26	xrltled 13319	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → 𝐶 ≤ 𝐵)
28		ioossioo 13612	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐶 ≤ 𝐵)) → (𝐴(,)𝐶) ⊆ (𝐴(,)𝐵))
29	21, 23, 24, 27, 28	syl22anc 852	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → (𝐴(,)𝐶) ⊆ (𝐴(,)𝐵))
30		ssdif0 4317	. . . 4 ⊢ ((𝐴(,)𝐶) ⊆ (𝐴(,)𝐵) ↔ ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = ∅)
31	29, 30	sylib 221	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = ∅)
32		ico0 13562	. . . . 5 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → ((𝐵[,)𝐶) = ∅ ↔ 𝐶 ≤ 𝐵))
33	32	biimpar 483	. . . 4 ⊢ (((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐶 ≤ 𝐵) → (𝐵[,)𝐶) = ∅)
34	23, 25, 27, 33	syl21anc 851	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → (𝐵[,)𝐶) = ∅)
35	31, 34	eqtr4d 2801	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) ∧ 𝐶 < 𝐵) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶))
36		xrlelttric 33440	. . 3 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝐵 ≤ 𝐶 ∨ 𝐶 < 𝐵))
37	22, 10, 36	syl2anc 596	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) → (𝐵 ≤ 𝐶 ∨ 𝐶 < 𝐵))
38	20, 35, 37	mpjaodan 973	1 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐶) ∖ (𝐴(,)𝐵)) = (𝐵[,)𝐶))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∖ cdif 4048 ∩ cin 4092 ∪ cun 4152 ∅c0 4281 class class class wbr 5108 (class class class)co 7451 ℝ^*cxr 11381 < clt 11382 ≤ cle 11383 (,)cioo 13516 [,)cico 13518

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-q 13116 df-ioo 13520 df-ico 13522

This theorem is used by: dya2iocbrsiga 35018 dya2icobrsiga 35019

W3C validator