Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ordtrestNEW Structured version   Visualization version   GIF version

Theorem ordtrestNEW 33921
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.)
Hypotheses
Ref Expression
ordtNEW.b 𝐵 = (Base‘𝐾)
ordtNEW.l = ((le‘𝐾) ∩ (𝐵 × 𝐵))
Assertion
Ref Expression
ordtrestNEW ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ordTop‘( ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘ ) ↾t 𝐴))

Proof of Theorem ordtrestNEW
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ordtNEW.l . . . . 5 = ((le‘𝐾) ∩ (𝐵 × 𝐵))
2 fvex 6918 . . . . . 6 (le‘𝐾) ∈ V
32inex1 5316 . . . . 5 ((le‘𝐾) ∩ (𝐵 × 𝐵)) ∈ V
41, 3eqeltri 2836 . . . 4 ∈ V
54inex1 5316 . . 3 ( ∩ (𝐴 × 𝐴)) ∈ V
6 eqid 2736 . . . 4 dom ( ∩ (𝐴 × 𝐴)) = dom ( ∩ (𝐴 × 𝐴))
7 eqid 2736 . . . 4 ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
8 eqid 2736 . . . 4 ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
96, 7, 8ordtval 23198 . . 3 (( ∩ (𝐴 × 𝐴)) ∈ V → (ordTop‘( ∩ (𝐴 × 𝐴))) = (topGen‘(fi‘({dom ( ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))))))
105, 9mp1i 13 . 2 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ordTop‘( ∩ (𝐴 × 𝐴))) = (topGen‘(fi‘({dom ( ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))))))
11 ordttop 23209 . . . . . 6 ( ∈ V → (ordTop‘ ) ∈ Top)
124, 11ax-mp 5 . . . . 5 (ordTop‘ ) ∈ Top
13 ordtNEW.b . . . . . . 7 𝐵 = (Base‘𝐾)
14 fvex 6918 . . . . . . 7 (Base‘𝐾) ∈ V
1513, 14eqeltri 2836 . . . . . 6 𝐵 ∈ V
1615ssex 5320 . . . . 5 (𝐴𝐵𝐴 ∈ V)
17 resttop 23169 . . . . 5 (((ordTop‘ ) ∈ Top ∧ 𝐴 ∈ V) → ((ordTop‘ ) ↾t 𝐴) ∈ Top)
1812, 16, 17sylancr 587 . . . 4 (𝐴𝐵 → ((ordTop‘ ) ↾t 𝐴) ∈ Top)
1918adantl 481 . . 3 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ((ordTop‘ ) ↾t 𝐴) ∈ Top)
2013ressprs 32955 . . . . . . . . 9 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝐾s 𝐴) ∈ Proset )
21 eqid 2736 . . . . . . . . . 10 (Base‘(𝐾s 𝐴)) = (Base‘(𝐾s 𝐴))
22 eqid 2736 . . . . . . . . . 10 ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴)))) = ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴))))
2321, 22prsdm 33914 . . . . . . . . 9 ((𝐾s 𝐴) ∈ Proset → dom ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴)))) = (Base‘(𝐾s 𝐴)))
2420, 23syl 17 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴)))) = (Base‘(𝐾s 𝐴)))
25 eqid 2736 . . . . . . . . . . . . . 14 (𝐾s 𝐴) = (𝐾s 𝐴)
2625, 13ressbas2 17284 . . . . . . . . . . . . 13 (𝐴𝐵𝐴 = (Base‘(𝐾s 𝐴)))
27 fvex 6918 . . . . . . . . . . . . 13 (Base‘(𝐾s 𝐴)) ∈ V
2826, 27eqeltrdi 2848 . . . . . . . . . . . 12 (𝐴𝐵𝐴 ∈ V)
29 eqid 2736 . . . . . . . . . . . . 13 (le‘𝐾) = (le‘𝐾)
3025, 29ressle 17425 . . . . . . . . . . . 12 (𝐴 ∈ V → (le‘𝐾) = (le‘(𝐾s 𝐴)))
3128, 30syl 17 . . . . . . . . . . 11 (𝐴𝐵 → (le‘𝐾) = (le‘(𝐾s 𝐴)))
3231adantl 481 . . . . . . . . . 10 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (le‘𝐾) = (le‘(𝐾s 𝐴)))
3326adantl 481 . . . . . . . . . . 11 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → 𝐴 = (Base‘(𝐾s 𝐴)))
3433sqxpeqd 5716 . . . . . . . . . 10 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝐴 × 𝐴) = ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴))))
3532, 34ineq12d 4220 . . . . . . . . 9 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ((le‘𝐾) ∩ (𝐴 × 𝐴)) = ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴)))))
3635dmeqd 5915 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ((le‘𝐾) ∩ (𝐴 × 𝐴)) = dom ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴)))))
3724, 36, 333eqtr4d 2786 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ((le‘𝐾) ∩ (𝐴 × 𝐴)) = 𝐴)
3813, 1prsss 33916 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ( ∩ (𝐴 × 𝐴)) = ((le‘𝐾) ∩ (𝐴 × 𝐴)))
3938dmeqd 5915 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ( ∩ (𝐴 × 𝐴)) = dom ((le‘𝐾) ∩ (𝐴 × 𝐴)))
4013, 1prsdm 33914 . . . . . . . . . 10 (𝐾 ∈ Proset → dom = 𝐵)
4140sseq2d 4015 . . . . . . . . 9 (𝐾 ∈ Proset → (𝐴 ⊆ dom 𝐴𝐵))
4241biimpar 477 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → 𝐴 ⊆ dom )
43 sseqin2 4222 . . . . . . . 8 (𝐴 ⊆ dom ↔ (dom 𝐴) = 𝐴)
4442, 43sylib 218 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (dom 𝐴) = 𝐴)
4537, 39, 443eqtr4d 2786 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ( ∩ (𝐴 × 𝐴)) = (dom 𝐴))
464, 11mp1i 13 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ordTop‘ ) ∈ Top)
4716adantl 481 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → 𝐴 ∈ V)
48 eqid 2736 . . . . . . . . . 10 dom = dom
4948ordttopon 23202 . . . . . . . . 9 ( ∈ V → (ordTop‘ ) ∈ (TopOn‘dom ))
504, 49mp1i 13 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ordTop‘ ) ∈ (TopOn‘dom ))
51 toponmax 22933 . . . . . . . 8 ((ordTop‘ ) ∈ (TopOn‘dom ) → dom ∈ (ordTop‘ ))
5250, 51syl 17 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ∈ (ordTop‘ ))
53 elrestr 17474 . . . . . . 7 (((ordTop‘ ) ∈ Top ∧ 𝐴 ∈ V ∧ dom ∈ (ordTop‘ )) → (dom 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
5446, 47, 52, 53syl3anc 1372 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (dom 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
5545, 54eqeltrd 2840 . . . . 5 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ( ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘ ) ↾t 𝐴))
5655snssd 4808 . . . 4 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → {dom ( ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘ ) ↾t 𝐴))
57 rabeq 3450 . . . . . . . . 9 (dom ( ∩ (𝐴 × 𝐴)) = (dom 𝐴) → {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
5845, 57syl 17 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
5945, 58mpteq12dv 5232 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}))
6059rneqd 5948 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}))
61 inrab2 4316 . . . . . . . . . 10 ({𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦 𝑥}
62 inss2 4237 . . . . . . . . . . . . . 14 (dom 𝐴) ⊆ 𝐴
63 simpr 484 . . . . . . . . . . . . . 14 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → 𝑦 ∈ (dom 𝐴))
6462, 63sselid 3980 . . . . . . . . . . . . 13 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → 𝑦𝐴)
65 simpr 484 . . . . . . . . . . . . . . 15 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → 𝑥 ∈ (dom 𝐴))
6662, 65sselid 3980 . . . . . . . . . . . . . 14 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → 𝑥𝐴)
6766adantr 480 . . . . . . . . . . . . 13 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → 𝑥𝐴)
68 brinxp 5763 . . . . . . . . . . . . 13 ((𝑦𝐴𝑥𝐴) → (𝑦 𝑥𝑦( ∩ (𝐴 × 𝐴))𝑥))
6964, 67, 68syl2anc 584 . . . . . . . . . . . 12 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → (𝑦 𝑥𝑦( ∩ (𝐴 × 𝐴))𝑥))
7069notbid 318 . . . . . . . . . . 11 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → (¬ 𝑦 𝑥 ↔ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥))
7170rabbidva 3442 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦 𝑥} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
7261, 71eqtrid 2788 . . . . . . . . 9 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → ({𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
734, 11mp1i 13 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → (ordTop‘ ) ∈ Top)
7447adantr 480 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → 𝐴 ∈ V)
75 simpl 482 . . . . . . . . . . 11 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → 𝐾 ∈ Proset )
76 inss1 4236 . . . . . . . . . . . 12 (dom 𝐴) ⊆ dom
7776sseli 3978 . . . . . . . . . . 11 (𝑥 ∈ (dom 𝐴) → 𝑥 ∈ dom )
7848ordtopn1 23203 . . . . . . . . . . . . 13 (( ∈ V ∧ 𝑥 ∈ dom ) → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ ))
794, 78mpan 690 . . . . . . . . . . . 12 (𝑥 ∈ dom → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ ))
8079adantl 481 . . . . . . . . . . 11 ((𝐾 ∈ Proset ∧ 𝑥 ∈ dom ) → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ ))
8175, 77, 80syl2an 596 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ ))
82 elrestr 17474 . . . . . . . . . 10 (((ordTop‘ ) ∈ Top ∧ 𝐴 ∈ V ∧ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ )) → ({𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∩ 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
8373, 74, 81, 82syl3anc 1372 . . . . . . . . 9 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → ({𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∩ 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
8472, 83eqeltrrd 2841 . . . . . . . 8 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘ ) ↾t 𝐴))
8584fmpttd 7134 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}):(dom 𝐴)⟶((ordTop‘ ) ↾t 𝐴))
8685frnd 6743 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘ ) ↾t 𝐴))
8760, 86eqsstrd 4017 . . . . 5 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘ ) ↾t 𝐴))
88 rabeq 3450 . . . . . . . . 9 (dom ( ∩ (𝐴 × 𝐴)) = (dom 𝐴) → {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
8945, 88syl 17 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
9045, 89mpteq12dv 5232 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))
9190rneqd 5948 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))
92 inrab2 4316 . . . . . . . . . 10 ({𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥 𝑦}
93 brinxp 5763 . . . . . . . . . . . . 13 ((𝑥𝐴𝑦𝐴) → (𝑥 𝑦𝑥( ∩ (𝐴 × 𝐴))𝑦))
9467, 64, 93syl2anc 584 . . . . . . . . . . . 12 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → (𝑥 𝑦𝑥( ∩ (𝐴 × 𝐴))𝑦))
9594notbid 318 . . . . . . . . . . 11 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → (¬ 𝑥 𝑦 ↔ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦))
9695rabbidva 3442 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥 𝑦} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
9792, 96eqtrid 2788 . . . . . . . . 9 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → ({𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
9848ordtopn2 23204 . . . . . . . . . . . . 13 (( ∈ V ∧ 𝑥 ∈ dom ) → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ ))
994, 98mpan 690 . . . . . . . . . . . 12 (𝑥 ∈ dom → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ ))
10099adantl 481 . . . . . . . . . . 11 ((𝐾 ∈ Proset ∧ 𝑥 ∈ dom ) → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ ))
10175, 77, 100syl2an 596 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ ))
102 elrestr 17474 . . . . . . . . . 10 (((ordTop‘ ) ∈ Top ∧ 𝐴 ∈ V ∧ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ )) → ({𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∩ 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
10373, 74, 101, 102syl3anc 1372 . . . . . . . . 9 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → ({𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∩ 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
10497, 103eqeltrrd 2841 . . . . . . . 8 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘ ) ↾t 𝐴))
105104fmpttd 7134 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}):(dom 𝐴)⟶((ordTop‘ ) ↾t 𝐴))
106105frnd 6743 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘ ) ↾t 𝐴))
10791, 106eqsstrd 4017 . . . . 5 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘ ) ↾t 𝐴))
10887, 107unssd 4191 . . . 4 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})) ⊆ ((ordTop‘ ) ↾t 𝐴))
10956, 108unssd 4191 . . 3 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ({dom ( ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘ ) ↾t 𝐴))
110 tgfiss 22999 . . 3 ((((ordTop‘ ) ↾t 𝐴) ∈ Top ∧ ({dom ( ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘ ) ↾t 𝐴)) → (topGen‘(fi‘({dom ( ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘ ) ↾t 𝐴))
11119, 109, 110syl2anc 584 . 2 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (topGen‘(fi‘({dom ( ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘ ) ↾t 𝐴))
11210, 111eqsstrd 4017 1 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ordTop‘( ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘ ) ↾t 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1539  wcel 2107  {crab 3435  Vcvv 3479  cun 3948  cin 3949  wss 3950  {csn 4625   class class class wbr 5142  cmpt 5224   × cxp 5682  dom cdm 5684  ran crn 5685  cfv 6560  (class class class)co 7432  ficfi 9451  Basecbs 17248  s cress 17275  lecple 17305  t crest 17466  topGenctg 17483  ordTopcordt 17545   Proset cproset 18339  Topctop 22900  TopOnctopon 22917
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-cnex 11212  ax-resscn 11213  ax-1cn 11214  ax-icn 11215  ax-addcl 11216  ax-addrcl 11217  ax-mulcl 11218  ax-mulrcl 11219  ax-mulcom 11220  ax-addass 11221  ax-mulass 11222  ax-distr 11223  ax-i2m1 11224  ax-1ne0 11225  ax-1rid 11226  ax-rnegex 11227  ax-rrecex 11228  ax-cnre 11229  ax-pre-lttri 11230  ax-pre-lttrn 11231  ax-pre-ltadd 11232  ax-pre-mulgt0 11233
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-int 4946  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-riota 7389  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-1st 8015  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-1o 8507  df-2o 8508  df-er 8746  df-en 8987  df-dom 8988  df-sdom 8989  df-fin 8990  df-fi 9452  df-pnf 11298  df-mnf 11299  df-xr 11300  df-ltxr 11301  df-le 11302  df-sub 11495  df-neg 11496  df-nn 12268  df-2 12330  df-3 12331  df-4 12332  df-5 12333  df-6 12334  df-7 12335  df-8 12336  df-9 12337  df-dec 12736  df-sets 17202  df-slot 17220  df-ndx 17232  df-base 17249  df-ress 17276  df-ple 17318  df-rest 17468  df-topgen 17489  df-ordt 17547  df-proset 18341  df-top 22901  df-topon 22918  df-bases 22954
This theorem is referenced by:  ordtrest2NEW  33923
  Copyright terms: Public domain W3C validator