MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordtrest Structured version   Visualization version   GIF version

Theorem ordtrest 22261
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.)
Assertion
Ref Expression
ordtrest ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))

Proof of Theorem ordtrest
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inex1g 5238 . . . 4 (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
21adantr 480 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
3 eqid 2738 . . . 4 dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
4 eqid 2738 . . . 4 ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
5 eqid 2738 . . . 4 ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
63, 4, 5ordtval 22248 . . 3 ((𝑅 ∩ (𝐴 × 𝐴)) ∈ V → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) = (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))))
72, 6syl 17 . 2 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) = (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))))
8 ordttop 22259 . . . 4 (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ Top)
9 resttop 22219 . . . 4 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
108, 9sylan 579 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
11 eqid 2738 . . . . . . . 8 dom 𝑅 = dom 𝑅
1211psssdm2 18214 . . . . . . 7 (𝑅 ∈ PosetRel → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅𝐴))
1312adantr 480 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅𝐴))
148adantr 480 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘𝑅) ∈ Top)
15 simpr 484 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → 𝐴𝑉)
1611ordttopon 22252 . . . . . . . . 9 (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
1716adantr 480 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
18 toponmax 21983 . . . . . . . 8 ((ordTop‘𝑅) ∈ (TopOn‘dom 𝑅) → dom 𝑅 ∈ (ordTop‘𝑅))
1917, 18syl 17 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom 𝑅 ∈ (ordTop‘𝑅))
20 elrestr 17056 . . . . . . 7 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ dom 𝑅 ∈ (ordTop‘𝑅)) → (dom 𝑅𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2114, 15, 19, 20syl3anc 1369 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (dom 𝑅𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2213, 21eqeltrd 2839 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2322snssd 4739 . . . 4 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {dom (𝑅 ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘𝑅) ↾t 𝐴))
2413rabeqdv 3409 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
2513, 24mpteq12dv 5161 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
2625rneqd 5836 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
27 inrab2 4238 . . . . . . . . . 10 ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦𝑅𝑥}
28 simpr 484 . . . . . . . . . . . . . 14 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑦 ∈ (dom 𝑅𝐴))
2928elin2d 4129 . . . . . . . . . . . . 13 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑦𝐴)
30 simpr 484 . . . . . . . . . . . . . . 15 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝑥 ∈ (dom 𝑅𝐴))
3130elin2d 4129 . . . . . . . . . . . . . 14 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝑥𝐴)
3231adantr 480 . . . . . . . . . . . . 13 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑥𝐴)
33 brinxp 5656 . . . . . . . . . . . . 13 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3429, 32, 33syl2anc 583 . . . . . . . . . . . 12 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3534notbid 317 . . . . . . . . . . 11 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3635rabbidva 3402 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
3727, 36eqtrid 2790 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
3814adantr 480 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → (ordTop‘𝑅) ∈ Top)
3915adantr 480 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝐴𝑉)
40 simpl 482 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → 𝑅 ∈ PosetRel)
41 elinel1 4125 . . . . . . . . . . 11 (𝑥 ∈ (dom 𝑅𝐴) → 𝑥 ∈ dom 𝑅)
4211ordtopn1 22253 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
4340, 41, 42syl2an 595 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
44 elrestr 17056 . . . . . . . . . 10 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
4538, 39, 43, 44syl3anc 1369 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
4637, 45eqeltrrd 2840 . . . . . . . 8 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘𝑅) ↾t 𝐴))
4746fmpttd 6971 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}):(dom 𝑅𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
4847frnd 6592 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
4926, 48eqsstrd 3955 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
5013rabeqdv 3409 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5113, 50mpteq12dv 5161 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
5251rneqd 5836 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
53 inrab2 4238 . . . . . . . . . 10 ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥𝑅𝑦}
54 brinxp 5656 . . . . . . . . . . . . 13 ((𝑥𝐴𝑦𝐴) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5532, 29, 54syl2anc 583 . . . . . . . . . . . 12 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5655notbid 317 . . . . . . . . . . 11 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5756rabbidva 3402 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5853, 57eqtrid 2790 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5911ordtopn2 22254 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
6040, 41, 59syl2an 595 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
61 elrestr 17056 . . . . . . . . . 10 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
6238, 39, 60, 61syl3anc 1369 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
6358, 62eqeltrrd 2840 . . . . . . . 8 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘𝑅) ↾t 𝐴))
6463fmpttd 6971 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}):(dom 𝑅𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
6564frnd 6592 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6652, 65eqsstrd 3955 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6749, 66unssd 4116 . . . 4 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6823, 67unssd 4116 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
69 tgfiss 22049 . . 3 ((((ordTop‘𝑅) ↾t 𝐴) ∈ Top ∧ ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾t 𝐴)) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
7010, 68, 69syl2anc 583 . 2 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
717, 70eqsstrd 3955 1 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  {crab 3067  Vcvv 3422  cun 3881  cin 3882  wss 3883  {csn 4558   class class class wbr 5070  cmpt 5153   × cxp 5578  dom cdm 5580  ran crn 5581  cfv 6418  (class class class)co 7255  ficfi 9099  t crest 17048  topGenctg 17065  ordTopcordt 17127  PosetRelcps 18197  Topctop 21950  TopOnctopon 21967
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-1o 8267  df-er 8456  df-en 8692  df-fin 8695  df-fi 9100  df-rest 17050  df-topgen 17071  df-ordt 17129  df-ps 18199  df-top 21951  df-topon 21968  df-bases 22004
This theorem is referenced by:  ordtrest2  22263
  Copyright terms: Public domain W3C validator