Metamath Proof Explorer


Theorem ioondisj2

Description: A condition for two open intervals not to be disjoint. (Contributed by Glauco Siliprandi, 11-Dec-2019)

Ref Expression
Assertion ioondisj2 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → A B ∩ C D ≠ ∅

Proof

Step Hyp Ref Expression
1 simpll1 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → A ∈ ℝ *
2 simpll2 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → B ∈ ℝ *
3 simplr1 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → C ∈ ℝ *
4 simplr2 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → D ∈ ℝ *
5 iooin ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ D ∈ ℝ * → A B ∩ C D = if A ≤ C C A if B ≤ D B D
6 1 2 3 4 5 syl22anc ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → A B ∩ C D = if A ≤ C C A if B ≤ D B D
7 simprr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → D ≤ B
8 xrmineq ⊢ B ∈ ℝ * ∧ D ∈ ℝ * ∧ D ≤ B → if B ≤ D B D = D
9 2 4 7 8 syl3anc ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → if B ≤ D B D = D
10 9 oveq2d ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → if A ≤ C C A if B ≤ D B D = if A ≤ C C A D
11 simpr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B ∧ A ≤ C → A ≤ C
12 11 iftrued ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B ∧ A ≤ C → if A ≤ C C A = C
13 simplr3 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → C < D
14 13 adantr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B ∧ A ≤ C → C < D
15 12 14 eqbrtrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B ∧ A ≤ C → if A ≤ C C A < D
16 simpr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B ∧ ¬ A ≤ C → ¬ A ≤ C
17 16 iffalsed ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B ∧ ¬ A ≤ C → if A ≤ C C A = A
18 simplrl ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B ∧ ¬ A ≤ C → A < D
19 17 18 eqbrtrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B ∧ ¬ A ≤ C → if A ≤ C C A < D
20 15 19 pm2.61dan ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → if A ≤ C C A < D
21 3 1 ifcld ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → if A ≤ C C A ∈ ℝ *
22 ioon0 ⊢ if A ≤ C C A ∈ ℝ * ∧ D ∈ ℝ * → if A ≤ C C A D ≠ ∅ ↔ if A ≤ C C A < D
23 21 4 22 syl2anc ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → if A ≤ C C A D ≠ ∅ ↔ if A ≤ C C A < D
24 20 23 mpbird ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → if A ≤ C C A D ≠ ∅
25 10 24 eqnetrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → if A ≤ C C A if B ≤ D B D ≠ ∅
26 6 25 eqnetrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B ∧ C ∈ ℝ * ∧ D ∈ ℝ * ∧ C < D ∧ A < D ∧ D ≤ B → A B ∩ C D ≠ ∅