Metamath Proof Explorer


Theorem ordtprsuni

Description: Value of the order topology. (Contributed by Thierry Arnoux, 13-Sep-2018)

Ref Expression
Hypotheses ordtNEW.b ⊢ B = Base K
ordtNEW.l ⊢ ≤ ˙ = ≤ K ∩ B × B
ordtposval.e ⊢ E = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x
ordtposval.f ⊢ F = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
Assertion ordtprsuni ⊢ K ∈ Proset → B = ⋃ B ∪ E ∪ F

Proof

Step Hyp Ref Expression
1 ordtNEW.b ⊢ B = Base K
2 ordtNEW.l ⊢ ≤ ˙ = ≤ K ∩ B × B
3 ordtposval.e ⊢ E = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x
4 ordtposval.f ⊢ F = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
5 1 2 prsdm ⊢ K ∈ Proset → dom ⁡ ≤ ˙ = B
6 5 sneqd ⊢ K ∈ Proset → dom ⁡ ≤ ˙ = B
7 biidd ⊢ K ∈ Proset → ¬ y ≤ ˙ x ↔ ¬ y ≤ ˙ x
8 5 7 rabeqbidv ⊢ K ∈ Proset → y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x = y ∈ B | ¬ y ≤ ˙ x
9 5 8 mpteq12dv ⊢ K ∈ Proset → x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x = x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x
10 9 rneqd ⊢ K ∈ Proset → ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x
11 biidd ⊢ K ∈ Proset → ¬ x ≤ ˙ y ↔ ¬ x ≤ ˙ y
12 5 11 rabeqbidv ⊢ K ∈ Proset → y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y = y ∈ B | ¬ x ≤ ˙ y
13 5 12 mpteq12dv ⊢ K ∈ Proset → x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y = x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
14 13 rneqd ⊢ K ∈ Proset → ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
15 10 14 uneq12d ⊢ K ∈ Proset → ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
16 6 15 uneq12d ⊢ K ∈ Proset → dom ⁡ ≤ ˙ ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y = B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
17 16 unieqd ⊢ K ∈ Proset → ⋃ dom ⁡ ≤ ˙ ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y = ⋃ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
18 fvex ⊢ ≤ K ∈ V
19 18 inex1 ⊢ ≤ K ∩ B × B ∈ V
20 2 19 eqeltri ⊢ ≤ ˙ ∈ V
21 eqid ⊢ dom ⁡ ≤ ˙ = dom ⁡ ≤ ˙
22 eqid ⊢ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x = ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x
23 eqid ⊢ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y = ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y
24 21 22 23 ordtuni ⊢ ≤ ˙ ∈ V → dom ⁡ ≤ ˙ = ⋃ dom ⁡ ≤ ˙ ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y
25 20 24 ax-mp ⊢ dom ⁡ ≤ ˙ = ⋃ dom ⁡ ≤ ˙ ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y
26 5 25 eqtr3di ⊢ K ∈ Proset → B = ⋃ dom ⁡ ≤ ˙ ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ dom ⁡ ≤ ˙ ⟼ y ∈ dom ⁡ ≤ ˙ | ¬ x ≤ ˙ y
27 3 4 uneq12i ⊢ E ∪ F = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
28 27 a1i ⊢ K ∈ Proset → E ∪ F = ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
29 28 uneq2d ⊢ K ∈ Proset → B ∪ E ∪ F = B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
30 29 unieqd ⊢ K ∈ Proset → ⋃ B ∪ E ∪ F = ⋃ B ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ y ≤ ˙ x ∪ ran ⁡ x ∈ B ⟼ y ∈ B | ¬ x ≤ ˙ y
31 17 26 30 3eqtr4d ⊢ K ∈ Proset → B = ⋃ B ∪ E ∪ F