Metamath Proof Explorer


Theorem qextltlem

Description: Lemma for qextlt and qextle . (Contributed by Mario Carneiro, 3-Oct-2014)

Ref Expression
Assertion qextltlem ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A < B → ∃ x ∈ ℚ ¬ x < A ↔ x < B ∧ ¬ x ≤ A ↔ x ≤ B

Proof

Step Hyp Ref Expression
1 qbtwnxr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ A < B → ∃ x ∈ ℚ A < x ∧ x < B
2 1 3expia ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A < B → ∃ x ∈ ℚ A < x ∧ x < B
3 simprl ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → A < x
4 simplll ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → A ∈ ℝ *
5 qre ⊢ x ∈ ℚ → x ∈ ℝ
6 5 rexrd ⊢ x ∈ ℚ → x ∈ ℝ *
7 6 ad2antlr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → x ∈ ℝ *
8 xrltnle ⊢ A ∈ ℝ * ∧ x ∈ ℝ * → A < x ↔ ¬ x ≤ A
9 4 7 8 syl2anc ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → A < x ↔ ¬ x ≤ A
10 3 9 mpbid ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → ¬ x ≤ A
11 xrltle ⊢ x ∈ ℝ * ∧ A ∈ ℝ * → x < A → x ≤ A
12 7 4 11 syl2anc ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → x < A → x ≤ A
13 10 12 mtod ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → ¬ x < A
14 simprr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → x < B
15 13 14 2thd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → ¬ x < A ↔ x < B
16 nbbn ⊢ ¬ x < A ↔ x < B ↔ ¬ x < A ↔ x < B
17 15 16 sylib ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → ¬ x < A ↔ x < B
18 simpllr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → B ∈ ℝ *
19 7 18 14 xrltled ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → x ≤ B
20 10 19 2thd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → ¬ x ≤ A ↔ x ≤ B
21 nbbn ⊢ ¬ x ≤ A ↔ x ≤ B ↔ ¬ x ≤ A ↔ x ≤ B
22 20 21 sylib ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → ¬ x ≤ A ↔ x ≤ B
23 17 22 jca ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ ∧ A < x ∧ x < B → ¬ x < A ↔ x < B ∧ ¬ x ≤ A ↔ x ≤ B
24 23 ex ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ x ∈ ℚ → A < x ∧ x < B → ¬ x < A ↔ x < B ∧ ¬ x ≤ A ↔ x ≤ B
25 24 reximdva ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → ∃ x ∈ ℚ A < x ∧ x < B → ∃ x ∈ ℚ ¬ x < A ↔ x < B ∧ ¬ x ≤ A ↔ x ≤ B
26 2 25 syld ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A < B → ∃ x ∈ ℚ ¬ x < A ↔ x < B ∧ ¬ x ≤ A ↔ x ≤ B