Metamath Proof Explorer


Theorem ordtrestNEW

Description: The subspace topology of an order topology is in general finer than the topology generated by the restricted order, but we do have inclusion in one direction. (Contributed by Mario Carneiro, 9-Sep-2015) (Revised by Thierry Arnoux, 11-Sep-2018)

Ref Expression
Hypotheses ordtNEW.b ⊢ B = Base K
ordtNEW.l ⊢ ≤ ˙ = ≤ K ∩ B × B
Assertion ordtrestNEW ⊢ K ∈ Proset ∧ A ⊆ B → ordTop ⁡ ≤ ˙ ∩ A × A ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A

Proof

Step Hyp Ref Expression
1 ordtNEW.b ⊢ B = Base K
2 ordtNEW.l ⊢ ≤ ˙ = ≤ K ∩ B × B
3 fvex ⊢ ≤ K ∈ V
4 3 inex1 ⊢ ≤ K ∩ B × B ∈ V
5 2 4 eqeltri ⊢ ≤ ˙ ∈ V
6 5 inex1 ⊢ ≤ ˙ ∩ A × A ∈ V
7 eqid ⊢ dom ⁡ ≤ ˙ ∩ A × A = dom ⁡ ≤ ˙ ∩ A × A
8 eqid ⊢ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x = ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x
9 eqid ⊢ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y = ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y
10 7 8 9 ordtval ⊢ ≤ ˙ ∩ A × A ∈ V → ordTop ⁡ ≤ ˙ ∩ A × A = topGen ⁡ fi ⁡ dom ⁡ ≤ ˙ ∩ A × A ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y
11 6 10 mp1i ⊢ K ∈ Proset ∧ A ⊆ B → ordTop ⁡ ≤ ˙ ∩ A × A = topGen ⁡ fi ⁡ dom ⁡ ≤ ˙ ∩ A × A ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y
12 ordttop ⊢ ≤ ˙ ∈ V → ordTop ⁡ ≤ ˙ ∈ Top
13 5 12 ax-mp ⊢ ordTop ⁡ ≤ ˙ ∈ Top
14 fvex ⊢ Base K ∈ V
15 1 14 eqeltri ⊢ B ∈ V
16 15 ssex ⊢ A ⊆ B → A ∈ V
17 resttop ⊢ ordTop ⁡ ≤ ˙ ∈ Top ∧ A ∈ V → ordTop ⁡ ≤ ˙ ↾ 𝑡 A ∈ Top
18 13 16 17 sylancr ⊢ A ⊆ B → ordTop ⁡ ≤ ˙ ↾ 𝑡 A ∈ Top
19 18 adantl ⊢ K ∈ Proset ∧ A ⊆ B → ordTop ⁡ ≤ ˙ ↾ 𝑡 A ∈ Top
20 1 ressprs ⊢ K ∈ Proset ∧ A ⊆ B → K ↾ 𝑠 A ∈ Proset
21 eqid ⊢ Base K ↾ 𝑠 A = Base K ↾ 𝑠 A
22 eqid ⊢ ≤ K ↾ 𝑠 A ∩ Base K ↾ 𝑠 A × Base K ↾ 𝑠 A = ≤ K ↾ 𝑠 A ∩ Base K ↾ 𝑠 A × Base K ↾ 𝑠 A
23 21 22 prsdm ⊢ K ↾ 𝑠 A ∈ Proset → dom ⁡ ≤ K ↾ 𝑠 A ∩ Base K ↾ 𝑠 A × Base K ↾ 𝑠 A = Base K ↾ 𝑠 A
24 20 23 syl ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ K ↾ 𝑠 A ∩ Base K ↾ 𝑠 A × Base K ↾ 𝑠 A = Base K ↾ 𝑠 A
25 eqid ⊢ K ↾ 𝑠 A = K ↾ 𝑠 A
26 25 1 ressbas2 ⊢ A ⊆ B → A = Base K ↾ 𝑠 A
27 fvex ⊢ Base K ↾ 𝑠 A ∈ V
28 26 27 eqeltrdi ⊢ A ⊆ B → A ∈ V
29 eqid ⊢ ≤ K = ≤ K
30 25 29 ressle ⊢ A ∈ V → ≤ K = ≤ K ↾ 𝑠 A
31 28 30 syl ⊢ A ⊆ B → ≤ K = ≤ K ↾ 𝑠 A
32 31 adantl ⊢ K ∈ Proset ∧ A ⊆ B → ≤ K = ≤ K ↾ 𝑠 A
33 26 adantl ⊢ K ∈ Proset ∧ A ⊆ B → A = Base K ↾ 𝑠 A
34 33 sqxpeqd ⊢ K ∈ Proset ∧ A ⊆ B → A × A = Base K ↾ 𝑠 A × Base K ↾ 𝑠 A
35 32 34 ineq12d ⊢ K ∈ Proset ∧ A ⊆ B → ≤ K ∩ A × A = ≤ K ↾ 𝑠 A ∩ Base K ↾ 𝑠 A × Base K ↾ 𝑠 A
36 35 dmeqd ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ K ∩ A × A = dom ⁡ ≤ K ↾ 𝑠 A ∩ Base K ↾ 𝑠 A × Base K ↾ 𝑠 A
37 24 36 33 3eqtr4d ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ K ∩ A × A = A
38 1 2 prsss ⊢ K ∈ Proset ∧ A ⊆ B → ≤ ˙ ∩ A × A = ≤ K ∩ A × A
39 38 dmeqd ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ ˙ ∩ A × A = dom ⁡ ≤ K ∩ A × A
40 1 2 prsdm ⊢ K ∈ Proset → dom ⁡ ≤ ˙ = B
41 40 sseq2d ⊢ K ∈ Proset → A ⊆ dom ⁡ ≤ ˙ ↔ A ⊆ B
42 41 biimpar ⊢ K ∈ Proset ∧ A ⊆ B → A ⊆ dom ⁡ ≤ ˙
43 sseqin2 ⊢ A ⊆ dom ⁡ ≤ ˙ ↔ dom ⁡ ≤ ˙ ∩ A = A
44 42 43 sylib ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ ˙ ∩ A = A
45 37 39 44 3eqtr4d ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ ˙ ∩ A × A = dom ⁡ ≤ ˙ ∩ A
46 5 12 mp1i ⊢ K ∈ Proset ∧ A ⊆ B → ordTop ⁡ ≤ ˙ ∈ Top
47 16 adantl ⊢ K ∈ Proset ∧ A ⊆ B → A ∈ V
48 eqid ⊢ dom ⁡ ≤ ˙ = dom ⁡ ≤ ˙
49 48 ordttopon ⊢ ≤ ˙ ∈ V → ordTop ⁡ ≤ ˙ ∈ TopOn ⁡ dom ⁡ ≤ ˙
50 5 49 mp1i ⊢ K ∈ Proset ∧ A ⊆ B → ordTop ⁡ ≤ ˙ ∈ TopOn ⁡ dom ⁡ ≤ ˙
51 toponmax ⊢ ordTop ⁡ ≤ ˙ ∈ TopOn ⁡ dom ⁡ ≤ ˙ → dom ⁡ ≤ ˙ ∈ ordTop ⁡ ≤ ˙
52 50 51 syl ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ ˙ ∈ ordTop ⁡ ≤ ˙
53 elrestr ⊢ ordTop ⁡ ≤ ˙ ∈ Top ∧ A ∈ V ∧ dom ⁡ ≤ ˙ ∈ ordTop ⁡ ≤ ˙ → dom ⁡ ≤ ˙ ∩ A ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
54 46 47 52 53 syl3anc ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ ˙ ∩ A ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
55 45 54 eqeltrd ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ ˙ ∩ A × A ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
56 55 snssd ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ ˙ ∩ A × A ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
57 rabeq ⊢ dom ⁡ ≤ ˙ ∩ A × A = dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x
58 45 57 syl ⊢ K ∈ Proset ∧ A ⊆ B → y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x
59 45 58 mpteq12dv ⊢ K ∈ Proset ∧ A ⊆ B → x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x = x ∈ dom ⁡ ≤ ˙ ∩ A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x
60 59 rneqd ⊢ K ∈ Proset ∧ A ⊆ B → ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x = ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x
61 inrab2 ⊢ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∩ A = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ x
62 inss2 ⊢ dom ⁡ ≤ ˙ ∩ A ⊆ A
63 simpr ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A ∧ y ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ ∩ A
64 62 63 sselid ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A ∧ y ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ A
65 simpr ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → x ∈ dom ⁡ ≤ ˙ ∩ A
66 62 65 sselid ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → x ∈ A
67 66 adantr ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A ∧ y ∈ dom ⁡ ≤ ˙ ∩ A → x ∈ A
68 brinxp ⊢ y ∈ A ∧ x ∈ A → y ≤ ˙ x ↔ y ≤ ˙ ∩ A × A x
69 64 67 68 syl2anc ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A ∧ y ∈ dom ⁡ ≤ ˙ ∩ A → y ≤ ˙ x ↔ y ≤ ˙ ∩ A × A x
70 69 notbid ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A ∧ y ∈ dom ⁡ ≤ ˙ ∩ A → ¬ y ≤ ˙ x ↔ ¬ y ≤ ˙ ∩ A × A x
71 70 rabbidva ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ x = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x
72 61 71 eqtrid ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∩ A = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x
73 5 12 mp1i ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → ordTop ⁡ ≤ ˙ ∈ Top
74 47 adantr ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → A ∈ V
75 simpl ⊢ K ∈ Proset ∧ A ⊆ B → K ∈ Proset
76 inss1 ⊢ dom ⁡ ≤ ˙ ∩ A ⊆ dom ⁡ ≤ ˙
77 76 sseli ⊢ x ∈ dom ⁡ ≤ ˙ ∩ A → x ∈ dom ⁡ ≤ ˙
78 48 ordtopn1 ⊢ ≤ ˙ ∈ V ∧ x ∈ dom ⁡ ≤ ˙ → y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∈ ordTop ⁡ ≤ ˙
79 5 78 mpan ⊢ x ∈ dom ⁡ ≤ ˙ → y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∈ ordTop ⁡ ≤ ˙
80 79 adantl ⊢ K ∈ Proset ∧ x ∈ dom ⁡ ≤ ˙ → y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∈ ordTop ⁡ ≤ ˙
81 75 77 80 syl2an ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∈ ordTop ⁡ ≤ ˙
82 elrestr ⊢ ordTop ⁡ ≤ ˙ ∈ Top ∧ A ∈ V ∧ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∈ ordTop ⁡ ≤ ˙ → y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∩ A ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
83 73 74 81 82 syl3anc ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∩ A ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
84 72 83 eqeltrrd ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
85 84 fmpttd ⊢ K ∈ Proset ∧ A ⊆ B → x ∈ dom ⁡ ≤ ˙ ∩ A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x : dom ⁡ ≤ ˙ ∩ A ⟶ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
86 85 frnd ⊢ K ∈ Proset ∧ A ⊆ B → ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ y ≤ ˙ ∩ A × A x ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
87 60 86 eqsstrd ⊢ K ∈ Proset ∧ A ⊆ B → ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
88 rabeq ⊢ dom ⁡ ≤ ˙ ∩ A × A = dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y
89 45 88 syl ⊢ K ∈ Proset ∧ A ⊆ B → y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y
90 45 89 mpteq12dv ⊢ K ∈ Proset ∧ A ⊆ B → x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y = x ∈ dom ⁡ ≤ ˙ ∩ A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y
91 90 rneqd ⊢ K ∈ Proset ∧ A ⊆ B → ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y = ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y
92 inrab2 ⊢ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∩ A = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ y
93 brinxp ⊢ x ∈ A ∧ y ∈ A → x ≤ ˙ y ↔ x ≤ ˙ ∩ A × A y
94 67 64 93 syl2anc ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A ∧ y ∈ dom ⁡ ≤ ˙ ∩ A → x ≤ ˙ y ↔ x ≤ ˙ ∩ A × A y
95 94 notbid ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A ∧ y ∈ dom ⁡ ≤ ˙ ∩ A → ¬ x ≤ ˙ y ↔ ¬ x ≤ ˙ ∩ A × A y
96 95 rabbidva ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ y = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y
97 92 96 eqtrid ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∩ A = y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y
98 48 ordtopn2 ⊢ ≤ ˙ ∈ V ∧ x ∈ dom ⁡ ≤ ˙ → y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∈ ordTop ⁡ ≤ ˙
99 5 98 mpan ⊢ x ∈ dom ⁡ ≤ ˙ → y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∈ ordTop ⁡ ≤ ˙
100 99 adantl ⊢ K ∈ Proset ∧ x ∈ dom ⁡ ≤ ˙ → y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∈ ordTop ⁡ ≤ ˙
101 75 77 100 syl2an ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∈ ordTop ⁡ ≤ ˙
102 elrestr ⊢ ordTop ⁡ ≤ ˙ ∈ Top ∧ A ∈ V ∧ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∈ ordTop ⁡ ≤ ˙ → y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∩ A ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
103 73 74 101 102 syl3anc ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y ∩ A ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
104 97 103 eqeltrrd ⊢ K ∈ Proset ∧ A ⊆ B ∧ x ∈ dom ⁡ ≤ ˙ ∩ A → y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y ∈ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
105 104 fmpttd ⊢ K ∈ Proset ∧ A ⊆ B → x ∈ dom ⁡ ≤ ˙ ∩ A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y : dom ⁡ ≤ ˙ ∩ A ⟶ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
106 105 frnd ⊢ K ∈ Proset ∧ A ⊆ B → ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A | ¬ x ≤ ˙ ∩ A × A y ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
107 91 106 eqsstrd ⊢ K ∈ Proset ∧ A ⊆ B → ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
108 87 107 unssd ⊢ K ∈ Proset ∧ A ⊆ B → ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
109 56 108 unssd ⊢ K ∈ Proset ∧ A ⊆ B → dom ⁡ ≤ ˙ ∩ A × A ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
110 tgfiss ⊢ ordTop ⁡ ≤ ˙ ↾ 𝑡 A ∈ Top ∧ dom ⁡ ≤ ˙ ∩ A × A ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A → topGen ⁡ fi ⁡ dom ⁡ ≤ ˙ ∩ A × A ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
111 19 109 110 syl2anc ⊢ K ∈ Proset ∧ A ⊆ B → topGen ⁡ fi ⁡ dom ⁡ ≤ ˙ ∩ A × A ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ y ≤ ˙ ∩ A × A x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ∩ A × A ⟼ y ∈ dom ⁡ ≤ ˙ ∩ A × A | ¬ x ≤ ˙ ∩ A × A y ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A
112 11 111 eqsstrd ⊢ K ∈ Proset ∧ A ⊆ B → ordTop ⁡ ≤ ˙ ∩ A × A ⊆ ordTop ⁡ ≤ ˙ ↾ 𝑡 A