Metamath Proof Explorer


Theorem ordtcnvNEW

Description: The order dual generates the same topology as the original order. (Contributed by Mario Carneiro, 3-Sep-2015) (Revised by Thierry Arnoux, 13-Sep-2018)

Ref Expression
Hypotheses ordtNEW.b ⊢ B = Base K
ordtNEW.l ⊢ ≤ ˙ = ≤ K ∩ B × B
Assertion ordtcnvNEW ⊢ K ∈ Proset → ordTop ⁡ ≤ ˙ -1 = ordTop ⁡ ≤ ˙

Proof

Step Hyp Ref Expression
1 ordtNEW.b ⊢ B = Base K
2 ordtNEW.l ⊢ ≤ ˙ = ≤ K ∩ B × B
3 vex ⊢ y ∈ V
4 vex ⊢ x ∈ V
5 3 4 brcnv ⊢ y ≤ ˙ -1 x ↔ x ≤ ˙ y
6 5 a1i ⊢ K ∈ Proset → y ≤ ˙ -1 x ↔ x ≤ ˙ y
7 6 notbid ⊢ K ∈ Proset → ¬ y ≤ ˙ -1 x ↔ ¬ x ≤ ˙ y
8 7 rabbidv ⊢ K ∈ Proset → y ∈ B | ¬ y ≤ ˙ -1 x = y ∈ B | ¬ x ≤ ˙ y
9 8 mpteq2dv ⊢ K ∈ Proset → x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x = x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
10 9 rneqd ⊢ K ∈ Proset → ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
11 4 3 brcnv ⊢ x ≤ ˙ -1 y ↔ y ≤ ˙ x
12 11 a1i ⊢ K ∈ Proset → x ≤ ˙ -1 y ↔ y ≤ ˙ x
13 12 notbid ⊢ K ∈ Proset → ¬ x ≤ ˙ -1 y ↔ ¬ y ≤ ˙ x
14 13 rabbidv ⊢ K ∈ Proset → y ∈ B | ¬ x ≤ ˙ -1 y = y ∈ B | ¬ y ≤ ˙ x
15 14 mpteq2dv ⊢ K ∈ Proset → x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y = x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x
16 15 rneqd ⊢ K ∈ Proset → ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x
17 10 16 uneq12d ⊢ K ∈ Proset → ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x
18 uncom ⊢ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
19 17 18 eqtrdi ⊢ K ∈ Proset → ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
20 19 uneq2d ⊢ K ∈ Proset → B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y = B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
21 20 fveq2d ⊢ K ∈ Proset → fi ⁡ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y = fi ⁡ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
22 21 fveq2d ⊢ K ∈ Proset → topGen ⁡ fi ⁡ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y = topGen ⁡ fi ⁡ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
23 eqid ⊢ ODual ⁡ K = ODual ⁡ K
24 23 oduprs ⊢ K ∈ Proset → ODual ⁡ K ∈ Proset
25 23 1 odubas ⊢ B = Base ODual ⁡ K
26 2 cnveqi ⊢ ≤ ˙ -1 = ≤ K ∩ B × B -1
27 cnvin ⊢ ≤ K ∩ B × B -1 = ≤ K -1 ∩ B × B -1
28 eqid ⊢ ≤ K = ≤ K
29 23 28 oduleval ⊢ ≤ K -1 = ≤ ODual ⁡ K
30 cnvxp ⊢ B × B -1 = B × B
31 29 30 ineq12i ⊢ ≤ K -1 ∩ B × B -1 = ≤ ODual ⁡ K ∩ B × B
32 26 27 31 3eqtri ⊢ ≤ ˙ -1 = ≤ ODual ⁡ K ∩ B × B
33 eqid ⊢ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x
34 eqid ⊢ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y
35 25 32 33 34 ordtprsval ⊢ ODual ⁡ K ∈ Proset → ordTop ⁡ ≤ ˙ -1 = topGen ⁡ fi ⁡ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y
36 24 35 syl ⊢ K ∈ Proset → ordTop ⁡ ≤ ˙ -1 = topGen ⁡ fi ⁡ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ -1 x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ -1 y
37 eqid ⊢ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x
38 eqid ⊢ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
39 1 2 37 38 ordtprsval ⊢ K ∈ Proset → ordTop ⁡ ≤ ˙ = topGen ⁡ fi ⁡ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
40 22 36 39 3eqtr4d ⊢ K ∈ Proset → ordTop ⁡ ≤ ˙ -1 = ordTop ⁡ ≤ ˙