Metamath Proof Explorer


Theorem icoiccdif

Description: Left-closed right-open interval gotten by a closed iterval taking away the upper bound. (Contributed by Glauco Siliprandi, 11-Dec-2019)

Ref Expression
Assertion icoiccdif ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A B = A B ∖ B

Proof

Step Hyp Ref Expression
1 icossicc ⊢ A B ⊆ A B
2 1 a1i ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A B ⊆ A B
3 2 sselda ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → x ∈ A B
4 elico1 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → x ∈ A B ↔ x ∈ ℝ * ∧ A ≤ x ∧ x < B
5 4 biimpa ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → x ∈ ℝ * ∧ A ≤ x ∧ x < B
6 5 simp1d ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → x ∈ ℝ *
7 simplr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → B ∈ ℝ *
8 5 simp3d ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → x < B
9 xrltne ⊢ x ∈ ℝ * ∧ B ∈ ℝ * ∧ x < B → B ≠ x
10 6 7 8 9 syl3anc ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → B ≠ x
11 10 necomd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → x ≠ B
12 11 neneqd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → ¬ x = B
13 velsn ⊢ x ∈ B ↔ x = B
14 12 13 sylnibr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → ¬ x ∈ B
15 3 14 eldifd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B → x ∈ A B ∖ B
16 15 ex ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → x ∈ A B → x ∈ A B ∖ B
17 16 ssrdv ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A B ⊆ A B ∖ B
18 simpll ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → A ∈ ℝ *
19 simplr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → B ∈ ℝ *
20 eldifi ⊢ x ∈ A B ∖ B → x ∈ A B
21 eliccxr ⊢ x ∈ A B → x ∈ ℝ *
22 20 21 syl ⊢ x ∈ A B ∖ B → x ∈ ℝ *
23 22 adantl ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → x ∈ ℝ *
24 20 adantl ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → x ∈ A B
25 elicc1 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → x ∈ A B ↔ x ∈ ℝ * ∧ A ≤ x ∧ x ≤ B
26 25 adantr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → x ∈ A B ↔ x ∈ ℝ * ∧ A ≤ x ∧ x ≤ B
27 24 26 mpbid ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → x ∈ ℝ * ∧ A ≤ x ∧ x ≤ B
28 27 simp2d ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → A ≤ x
29 eldifsni ⊢ x ∈ A B ∖ B → x ≠ B
30 29 necomd ⊢ x ∈ A B ∖ B → B ≠ x
31 30 adantl ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → B ≠ x
32 27 simp3d ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → x ≤ B
33 xrleltne ⊢ x ∈ ℝ * ∧ B ∈ ℝ * ∧ x ≤ B → x < B ↔ B ≠ x
34 23 19 32 33 syl3anc ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → x < B ↔ B ≠ x
35 31 34 mpbird ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → x < B
36 18 19 23 28 35 elicod ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ A B ∖ B → x ∈ A B
37 17 36 eqelssd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A B = A B ∖ B