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

Theorem ordtrest 23146
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 5264 . . . 4 (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
21adantr 480 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
3 eqid 2736 . . . 4 dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
4 eqid 2736 . . . 4 ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
5 eqid 2736 . . . 4 ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
63, 4, 5ordtval 23133 . . 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 23144 . . . 4 (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ Top)
9 resttop 23104 . . . 4 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
108, 9sylan 580 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
11 eqid 2736 . . . . . . . 8 dom 𝑅 = dom 𝑅
1211psssdm2 18504 . . . . . . 7 (𝑅 ∈ PosetRel → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅𝐴))
1312adantr 480 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅𝐴))
148adantr 480 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘𝑅) ∈ Top)
15 simpr 484 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → 𝐴𝑉)
1611ordttopon 23137 . . . . . . . . 9 (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
1716adantr 480 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
18 toponmax 22870 . . . . . . . 8 ((ordTop‘𝑅) ∈ (TopOn‘dom 𝑅) → dom 𝑅 ∈ (ordTop‘𝑅))
1917, 18syl 17 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom 𝑅 ∈ (ordTop‘𝑅))
20 elrestr 17348 . . . . . . 7 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ dom 𝑅 ∈ (ordTop‘𝑅)) → (dom 𝑅𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2114, 15, 19, 20syl3anc 1373 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (dom 𝑅𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2213, 21eqeltrd 2836 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2322snssd 4765 . . . 4 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {dom (𝑅 ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘𝑅) ↾t 𝐴))
2413rabeqdv 3414 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
2513, 24mpteq12dv 5185 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
2625rneqd 5887 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
27 inrab2 4269 . . . . . . . . . 10 ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦𝑅𝑥}
28 simpr 484 . . . . . . . . . . . . . 14 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑦 ∈ (dom 𝑅𝐴))
2928elin2d 4157 . . . . . . . . . . . . 13 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑦𝐴)
30 simpr 484 . . . . . . . . . . . . . . 15 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝑥 ∈ (dom 𝑅𝐴))
3130elin2d 4157 . . . . . . . . . . . . . 14 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝑥𝐴)
3231adantr 480 . . . . . . . . . . . . 13 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑥𝐴)
33 brinxp 5703 . . . . . . . . . . . . 13 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3429, 32, 33syl2anc 584 . . . . . . . . . . . 12 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3534notbid 318 . . . . . . . . . . 11 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3635rabbidva 3405 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
3727, 36eqtrid 2783 . . . . . . . . 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 4153 . . . . . . . . . . 11 (𝑥 ∈ (dom 𝑅𝐴) → 𝑥 ∈ dom 𝑅)
4211ordtopn1 23138 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
4340, 41, 42syl2an 596 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
44 elrestr 17348 . . . . . . . . . 10 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
4538, 39, 43, 44syl3anc 1373 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
4637, 45eqeltrrd 2837 . . . . . . . 8 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘𝑅) ↾t 𝐴))
4746fmpttd 7060 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}):(dom 𝑅𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
4847frnd 6670 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
4926, 48eqsstrd 3968 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
5013rabeqdv 3414 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5113, 50mpteq12dv 5185 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
5251rneqd 5887 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
53 inrab2 4269 . . . . . . . . . 10 ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥𝑅𝑦}
54 brinxp 5703 . . . . . . . . . . . . 13 ((𝑥𝐴𝑦𝐴) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5532, 29, 54syl2anc 584 . . . . . . . . . . . 12 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5655notbid 318 . . . . . . . . . . 11 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5756rabbidva 3405 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5853, 57eqtrid 2783 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5911ordtopn2 23139 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
6040, 41, 59syl2an 596 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
61 elrestr 17348 . . . . . . . . . 10 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
6238, 39, 60, 61syl3anc 1373 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
6358, 62eqeltrrd 2837 . . . . . . . 8 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘𝑅) ↾t 𝐴))
6463fmpttd 7060 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}):(dom 𝑅𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
6564frnd 6670 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6652, 65eqsstrd 3968 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6749, 66unssd 4144 . . . 4 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6823, 67unssd 4144 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
69 tgfiss 22935 . . 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 584 . 2 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
717, 70eqsstrd 3968 1 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  {crab 3399  Vcvv 3440  cun 3899  cin 3900  wss 3901  {csn 4580   class class class wbr 5098  cmpt 5179   × cxp 5622  dom cdm 5624  ran crn 5625  cfv 6492  (class class class)co 7358  ficfi 9313  t crest 17340  topGenctg 17357  ordTopcordt 17420  PosetRelcps 18487  Topctop 22837  TopOnctopon 22854
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-1o 8397  df-2o 8398  df-en 8884  df-fin 8887  df-fi 9314  df-rest 17342  df-topgen 17363  df-ordt 17422  df-ps 18489  df-top 22838  df-topon 22855  df-bases 22890
This theorem is referenced by:  ordtrest2  23148
  Copyright terms: Public domain W3C validator