Metamath Proof Explorer


Theorem cnvordtrestixx

Description: The restriction of the 'greater than' order to an interval gives the same topology as the subspace topology. (Contributed by Thierry Arnoux, 1-Apr-2017)

Ref Expression
Hypotheses cnvordtrestixx.1 ⊢ A ⊆ ℝ *
cnvordtrestixx.2 ⊢ x ∈ A ∧ y ∈ A → x y ⊆ A
Assertion cnvordtrestixx ⊢ ordTop ⁡ ≤ ↾ 𝑡 A = ordTop ⁡ ≤ -1 ∩ A × A

Proof

Step Hyp Ref Expression
1 cnvordtrestixx.1 ⊢ A ⊆ ℝ *
2 cnvordtrestixx.2 ⊢ x ∈ A ∧ y ∈ A → x y ⊆ A
3 lern ⊢ ℝ * = ran ⁡ ≤
4 df-rn ⊢ ran ⁡ ≤ = dom ⁡ ≤ -1
5 3 4 eqtri ⊢ ℝ * = dom ⁡ ≤ -1
6 letsr ⊢ ≤ ∈ TosetRel
7 cnvtsr ⊢ ≤ ∈ TosetRel → ≤ -1 ∈ TosetRel
8 6 7 ax-mp ⊢ ≤ -1 ∈ TosetRel
9 8 a1i ⊢ ⊤ → ≤ -1 ∈ TosetRel
10 1 a1i ⊢ ⊤ → A ⊆ ℝ *
11 brcnvg ⊢ y ∈ A ∧ z ∈ ℝ * → y ≤ -1 z ↔ z ≤ y
12 11 adantlr ⊢ y ∈ A ∧ x ∈ A ∧ z ∈ ℝ * → y ≤ -1 z ↔ z ≤ y
13 simpr ⊢ y ∈ A ∧ x ∈ A ∧ z ∈ ℝ * → z ∈ ℝ *
14 simplr ⊢ y ∈ A ∧ x ∈ A ∧ z ∈ ℝ * → x ∈ A
15 brcnvg ⊢ z ∈ ℝ * ∧ x ∈ A → z ≤ -1 x ↔ x ≤ z
16 13 14 15 syl2anc ⊢ y ∈ A ∧ x ∈ A ∧ z ∈ ℝ * → z ≤ -1 x ↔ x ≤ z
17 12 16 anbi12d ⊢ y ∈ A ∧ x ∈ A ∧ z ∈ ℝ * → y ≤ -1 z ∧ z ≤ -1 x ↔ z ≤ y ∧ x ≤ z
18 ancom ⊢ z ≤ y ∧ x ≤ z ↔ x ≤ z ∧ z ≤ y
19 17 18 bitrdi ⊢ y ∈ A ∧ x ∈ A ∧ z ∈ ℝ * → y ≤ -1 z ∧ z ≤ -1 x ↔ x ≤ z ∧ z ≤ y
20 19 rabbidva ⊢ y ∈ A ∧ x ∈ A → z ∈ ℝ * | y ≤ -1 z ∧ z ≤ -1 x = z ∈ ℝ * | x ≤ z ∧ z ≤ y
21 simpr ⊢ y ∈ A ∧ x ∈ A → x ∈ A
22 1 21 sselid ⊢ y ∈ A ∧ x ∈ A → x ∈ ℝ *
23 simpl ⊢ y ∈ A ∧ x ∈ A → y ∈ A
24 1 23 sselid ⊢ y ∈ A ∧ x ∈ A → y ∈ ℝ *
25 iccval ⊢ x ∈ ℝ * ∧ y ∈ ℝ * → x y = z ∈ ℝ * | x ≤ z ∧ z ≤ y
26 22 24 25 syl2anc ⊢ y ∈ A ∧ x ∈ A → x y = z ∈ ℝ * | x ≤ z ∧ z ≤ y
27 2 ancoms ⊢ y ∈ A ∧ x ∈ A → x y ⊆ A
28 26 27 eqsstrrd ⊢ y ∈ A ∧ x ∈ A → z ∈ ℝ * | x ≤ z ∧ z ≤ y ⊆ A
29 20 28 eqsstrd ⊢ y ∈ A ∧ x ∈ A → z ∈ ℝ * | y ≤ -1 z ∧ z ≤ -1 x ⊆ A
30 29 adantl ⊢ ⊤ ∧ y ∈ A ∧ x ∈ A → z ∈ ℝ * | y ≤ -1 z ∧ z ≤ -1 x ⊆ A
31 5 9 10 30 ordtrest2 ⊢ ⊤ → ordTop ⁡ ≤ -1 ∩ A × A = ordTop ⁡ ≤ -1 ↾ 𝑡 A
32 31 mptru ⊢ ordTop ⁡ ≤ -1 ∩ A × A = ordTop ⁡ ≤ -1 ↾ 𝑡 A
33 tsrps ⊢ ≤ ∈ TosetRel → ≤ ∈ PosetRel
34 6 33 ax-mp ⊢ ≤ ∈ PosetRel
35 ordtcnv ⊢ ≤ ∈ PosetRel → ordTop ⁡ ≤ -1 = ordTop ⁡ ≤
36 34 35 ax-mp ⊢ ordTop ⁡ ≤ -1 = ordTop ⁡ ≤
37 36 oveq1i ⊢ ordTop ⁡ ≤ -1 ↾ 𝑡 A = ordTop ⁡ ≤ ↾ 𝑡 A
38 32 37 eqtr2i ⊢ ordTop ⁡ ≤ ↾ 𝑡 A = ordTop ⁡ ≤ -1 ∩ A × A