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 30569
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 6461 . . . . . 6 (le‘𝐾) ∈ V
32inex1 5038 . . . . 5 ((le‘𝐾) ∩ (𝐵 × 𝐵)) ∈ V
41, 3eqeltri 2855 . . . 4 ∈ V
54inex1 5038 . . 3 ( ∩ (𝐴 × 𝐴)) ∈ V
6 eqid 2778 . . . 4 dom ( ∩ (𝐴 × 𝐴)) = dom ( ∩ (𝐴 × 𝐴))
7 eqid 2778 . . . 4 ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
8 eqid 2778 . . . 4 ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
96, 7, 8ordtval 21405 . . 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 21416 . . . . . 6 ( ∈ V → (ordTop‘ ) ∈ Top)
124, 11ax-mp 5 . . . . 5 (ordTop‘ ) ∈ Top
13 ordtNEW.b . . . . . . 7 𝐵 = (Base‘𝐾)
14 fvex 6461 . . . . . . 7 (Base‘𝐾) ∈ V
1513, 14eqeltri 2855 . . . . . 6 𝐵 ∈ V
1615ssex 5041 . . . . 5 (𝐴𝐵𝐴 ∈ V)
17 resttop 21376 . . . . 5 (((ordTop‘ ) ∈ Top ∧ 𝐴 ∈ V) → ((ordTop‘ ) ↾t 𝐴) ∈ Top)
1812, 16, 17sylancr 581 . . . 4 (𝐴𝐵 → ((ordTop‘ ) ↾t 𝐴) ∈ Top)
1918adantl 475 . . 3 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ((ordTop‘ ) ↾t 𝐴) ∈ Top)
2013ressprs 30221 . . . . . . . . 9 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝐾s 𝐴) ∈ Proset )
21 eqid 2778 . . . . . . . . . 10 (Base‘(𝐾s 𝐴)) = (Base‘(𝐾s 𝐴))
22 eqid 2778 . . . . . . . . . 10 ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴)))) = ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴))))
2321, 22prsdm 30562 . . . . . . . . 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 2778 . . . . . . . . . . . . . 14 (𝐾s 𝐴) = (𝐾s 𝐴)
2625, 13ressbas2 16331 . . . . . . . . . . . . 13 (𝐴𝐵𝐴 = (Base‘(𝐾s 𝐴)))
27 fvex 6461 . . . . . . . . . . . . 13 (Base‘(𝐾s 𝐴)) ∈ V
2826, 27syl6eqel 2867 . . . . . . . . . . . 12 (𝐴𝐵𝐴 ∈ V)
29 eqid 2778 . . . . . . . . . . . . 13 (le‘𝐾) = (le‘𝐾)
3025, 29ressle 16449 . . . . . . . . . . . 12 (𝐴 ∈ V → (le‘𝐾) = (le‘(𝐾s 𝐴)))
3128, 30syl 17 . . . . . . . . . . 11 (𝐴𝐵 → (le‘𝐾) = (le‘(𝐾s 𝐴)))
3231adantl 475 . . . . . . . . . 10 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (le‘𝐾) = (le‘(𝐾s 𝐴)))
3326adantl 475 . . . . . . . . . . 11 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → 𝐴 = (Base‘(𝐾s 𝐴)))
3433sqxpeqd 5389 . . . . . . . . . 10 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝐴 × 𝐴) = ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴))))
3532, 34ineq12d 4038 . . . . . . . . 9 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ((le‘𝐾) ∩ (𝐴 × 𝐴)) = ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴)))))
3635dmeqd 5573 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ((le‘𝐾) ∩ (𝐴 × 𝐴)) = dom ((le‘(𝐾s 𝐴)) ∩ ((Base‘(𝐾s 𝐴)) × (Base‘(𝐾s 𝐴)))))
3724, 36, 333eqtr4d 2824 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ((le‘𝐾) ∩ (𝐴 × 𝐴)) = 𝐴)
3813, 1prsss 30564 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ( ∩ (𝐴 × 𝐴)) = ((le‘𝐾) ∩ (𝐴 × 𝐴)))
3938dmeqd 5573 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ( ∩ (𝐴 × 𝐴)) = dom ((le‘𝐾) ∩ (𝐴 × 𝐴)))
4013, 1prsdm 30562 . . . . . . . . . 10 (𝐾 ∈ Proset → dom = 𝐵)
4140sseq2d 3852 . . . . . . . . 9 (𝐾 ∈ Proset → (𝐴 ⊆ dom 𝐴𝐵))
4241biimpar 471 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → 𝐴 ⊆ dom )
43 sseqin2 4040 . . . . . . . 8 (𝐴 ⊆ dom ↔ (dom 𝐴) = 𝐴)
4442, 43sylib 210 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (dom 𝐴) = 𝐴)
4537, 39, 443eqtr4d 2824 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ( ∩ (𝐴 × 𝐴)) = (dom 𝐴))
464, 11mp1i 13 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ordTop‘ ) ∈ Top)
4716adantl 475 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → 𝐴 ∈ V)
48 eqid 2778 . . . . . . . . . 10 dom = dom
4948ordttopon 21409 . . . . . . . . 9 ( ∈ V → (ordTop‘ ) ∈ (TopOn‘dom ))
504, 49mp1i 13 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ordTop‘ ) ∈ (TopOn‘dom ))
51 toponmax 21142 . . . . . . . 8 ((ordTop‘ ) ∈ (TopOn‘dom ) → dom ∈ (ordTop‘ ))
5250, 51syl 17 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ∈ (ordTop‘ ))
53 elrestr 16479 . . . . . . 7 (((ordTop‘ ) ∈ Top ∧ 𝐴 ∈ V ∧ dom ∈ (ordTop‘ )) → (dom 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
5446, 47, 52, 53syl3anc 1439 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (dom 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
5545, 54eqeltrd 2859 . . . . 5 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → dom ( ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘ ) ↾t 𝐴))
5655snssd 4573 . . . 4 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → {dom ( ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘ ) ↾t 𝐴))
57 rabeq 3389 . . . . . . . . 9 (dom ( ∩ (𝐴 × 𝐴)) = (dom 𝐴) → {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
5845, 57syl 17 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
5945, 58mpteq12dv 4971 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}))
6059rneqd 5600 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}))
61 inrab2 4126 . . . . . . . . . 10 ({𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦 𝑥}
62 inss2 4054 . . . . . . . . . . . . . 14 (dom 𝐴) ⊆ 𝐴
63 simpr 479 . . . . . . . . . . . . . 14 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → 𝑦 ∈ (dom 𝐴))
6462, 63sseldi 3819 . . . . . . . . . . . . 13 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → 𝑦𝐴)
65 simpr 479 . . . . . . . . . . . . . . 15 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → 𝑥 ∈ (dom 𝐴))
6662, 65sseldi 3819 . . . . . . . . . . . . . 14 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → 𝑥𝐴)
6766adantr 474 . . . . . . . . . . . . 13 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → 𝑥𝐴)
68 brinxp 5430 . . . . . . . . . . . . 13 ((𝑦𝐴𝑥𝐴) → (𝑦 𝑥𝑦( ∩ (𝐴 × 𝐴))𝑥))
6964, 67, 68syl2anc 579 . . . . . . . . . . . 12 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → (𝑦 𝑥𝑦( ∩ (𝐴 × 𝐴))𝑥))
7069notbid 310 . . . . . . . . . . 11 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → (¬ 𝑦 𝑥 ↔ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥))
7170rabbidva 3385 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦 𝑥} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
7261, 71syl5eq 2826 . . . . . . . . 9 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → ({𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥})
734, 11mp1i 13 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → (ordTop‘ ) ∈ Top)
7447adantr 474 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → 𝐴 ∈ V)
75 simpl 476 . . . . . . . . . . 11 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → 𝐾 ∈ Proset )
76 inss1 4053 . . . . . . . . . . . 12 (dom 𝐴) ⊆ dom
7776sseli 3817 . . . . . . . . . . 11 (𝑥 ∈ (dom 𝐴) → 𝑥 ∈ dom )
7848ordtopn1 21410 . . . . . . . . . . . . 13 (( ∈ V ∧ 𝑥 ∈ dom ) → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ ))
794, 78mpan 680 . . . . . . . . . . . 12 (𝑥 ∈ dom → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ ))
8079adantl 475 . . . . . . . . . . 11 ((𝐾 ∈ Proset ∧ 𝑥 ∈ dom ) → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ ))
8175, 77, 80syl2an 589 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ ))
82 elrestr 16479 . . . . . . . . . 10 (((ordTop‘ ) ∈ Top ∧ 𝐴 ∈ V ∧ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∈ (ordTop‘ )) → ({𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∩ 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
8373, 74, 81, 82syl3anc 1439 . . . . . . . . 9 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → ({𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} ∩ 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
8472, 83eqeltrrd 2860 . . . . . . . 8 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘ ) ↾t 𝐴))
8584fmpttd 6651 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}):(dom 𝐴)⟶((ordTop‘ ) ↾t 𝐴))
8685frnd 6300 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘ ) ↾t 𝐴))
8760, 86eqsstrd 3858 . . . . 5 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘ ) ↾t 𝐴))
88 rabeq 3389 . . . . . . . . 9 (dom ( ∩ (𝐴 × 𝐴)) = (dom 𝐴) → {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
8945, 88syl 17 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
9045, 89mpteq12dv 4971 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))
9190rneqd 5600 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))
92 inrab2 4126 . . . . . . . . . 10 ({𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥 𝑦}
93 brinxp 5430 . . . . . . . . . . . . 13 ((𝑥𝐴𝑦𝐴) → (𝑥 𝑦𝑥( ∩ (𝐴 × 𝐴))𝑦))
9467, 64, 93syl2anc 579 . . . . . . . . . . . 12 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → (𝑥 𝑦𝑥( ∩ (𝐴 × 𝐴))𝑦))
9594notbid 310 . . . . . . . . . . 11 ((((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) ∧ 𝑦 ∈ (dom 𝐴)) → (¬ 𝑥 𝑦 ↔ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦))
9695rabbidva 3385 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥 𝑦} = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
9792, 96syl5eq 2826 . . . . . . . . 9 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → ({𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})
9848ordtopn2 21411 . . . . . . . . . . . . 13 (( ∈ V ∧ 𝑥 ∈ dom ) → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ ))
994, 98mpan 680 . . . . . . . . . . . 12 (𝑥 ∈ dom → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ ))
10099adantl 475 . . . . . . . . . . 11 ((𝐾 ∈ Proset ∧ 𝑥 ∈ dom ) → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ ))
10175, 77, 100syl2an 589 . . . . . . . . . 10 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ ))
102 elrestr 16479 . . . . . . . . . 10 (((ordTop‘ ) ∈ Top ∧ 𝐴 ∈ V ∧ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∈ (ordTop‘ )) → ({𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∩ 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
10373, 74, 101, 102syl3anc 1439 . . . . . . . . 9 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → ({𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} ∩ 𝐴) ∈ ((ordTop‘ ) ↾t 𝐴))
10497, 103eqeltrrd 2860 . . . . . . . 8 (((𝐾 ∈ Proset ∧ 𝐴𝐵) ∧ 𝑥 ∈ (dom 𝐴)) → {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘ ) ↾t 𝐴))
105104fmpttd 6651 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}):(dom 𝐴)⟶((ordTop‘ ) ↾t 𝐴))
106105frnd 6300 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ (dom 𝐴) ↦ {𝑦 ∈ (dom 𝐴) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘ ) ↾t 𝐴))
10791, 106eqsstrd 3858 . . . . 5 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘ ) ↾t 𝐴))
10887, 107unssd 4012 . . . 4 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦})) ⊆ ((ordTop‘ ) ↾t 𝐴))
10956, 108unssd 4012 . . 3 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → ({dom ( ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘ ) ↾t 𝐴))
110 tgfiss 21207 . . 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 579 . 2 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (topGen‘(fi‘({dom ( ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦( ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom ( ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom ( ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥( ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘ ) ↾t 𝐴))
11210, 111eqsstrd 3858 1 ((𝐾 ∈ Proset ∧ 𝐴𝐵) → (ordTop‘( ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘ ) ↾t 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 386   = wceq 1601  wcel 2107  {crab 3094  Vcvv 3398  cun 3790  cin 3791  wss 3792  {csn 4398   class class class wbr 4888  cmpt 4967   × cxp 5355  dom cdm 5357  ran crn 5358  cfv 6137  (class class class)co 6924  ficfi 8606  Basecbs 16259  s cress 16260  lecple 16349  t crest 16471  topGenctg 16488  ordTopcordt 16549   Proset cproset 17316  Topctop 21109  TopOnctopon 21126
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-rep 5008  ax-sep 5019  ax-nul 5027  ax-pow 5079  ax-pr 5140  ax-un 7228  ax-cnex 10330  ax-resscn 10331  ax-1cn 10332  ax-icn 10333  ax-addcl 10334  ax-addrcl 10335  ax-mulcl 10336  ax-mulrcl 10337  ax-mulcom 10338  ax-addass 10339  ax-mulass 10340  ax-distr 10341  ax-i2m1 10342  ax-1ne0 10343  ax-1rid 10344  ax-rnegex 10345  ax-rrecex 10346  ax-cnre 10347  ax-pre-lttri 10348  ax-pre-lttrn 10349  ax-pre-ltadd 10350  ax-pre-mulgt0 10351
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3or 1072  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-nel 3076  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-pss 3808  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-tp 4403  df-op 4405  df-uni 4674  df-int 4713  df-iun 4757  df-br 4889  df-opab 4951  df-mpt 4968  df-tr 4990  df-id 5263  df-eprel 5268  df-po 5276  df-so 5277  df-fr 5316  df-we 5318  df-xp 5363  df-rel 5364  df-cnv 5365  df-co 5366  df-dm 5367  df-rn 5368  df-res 5369  df-ima 5370  df-pred 5935  df-ord 5981  df-on 5982  df-lim 5983  df-suc 5984  df-iota 6101  df-fun 6139  df-fn 6140  df-f 6141  df-f1 6142  df-fo 6143  df-f1o 6144  df-fv 6145  df-riota 6885  df-ov 6927  df-oprab 6928  df-mpt2 6929  df-om 7346  df-1st 7447  df-2nd 7448  df-wrecs 7691  df-recs 7753  df-rdg 7791  df-1o 7845  df-oadd 7849  df-er 8028  df-en 8244  df-dom 8245  df-sdom 8246  df-fin 8247  df-fi 8607  df-pnf 10415  df-mnf 10416  df-xr 10417  df-ltxr 10418  df-le 10419  df-sub 10610  df-neg 10611  df-nn 11379  df-2 11442  df-3 11443  df-4 11444  df-5 11445  df-6 11446  df-7 11447  df-8 11448  df-9 11449  df-dec 11850  df-ndx 16262  df-slot 16263  df-base 16265  df-sets 16266  df-ress 16267  df-ple 16362  df-rest 16473  df-topgen 16494  df-ordt 16551  df-proset 17318  df-top 21110  df-topon 21127  df-bases 21162
This theorem is referenced by:  ordtrest2NEW  30571
  Copyright terms: Public domain W3C validator