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

Theorem ordtrest 23242
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 5274 . . . 4 (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
21adantr 484 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
3 eqid 2761 . . . 4 dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
4 eqid 2761 . . . 4 ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
5 eqid 2761 . . . 4 ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
63, 4, 5ordtval 23229 . . 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 23240 . . . 4 (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ Top)
9 resttop 23200 . . . 4 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
108, 9sylan 589 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
11 eqid 2761 . . . . . . . 8 dom 𝑅 = dom 𝑅
1211psssdm2 18596 . . . . . . 7 (𝑅 ∈ PosetRel → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅𝐴))
1312adantr 484 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅𝐴))
148adantr 484 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘𝑅) ∈ Top)
15 simpr 488 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → 𝐴𝑉)
1611ordttopon 23233 . . . . . . . . 9 (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
1716adantr 484 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
18 toponmax 22966 . . . . . . . 8 ((ordTop‘𝑅) ∈ (TopOn‘dom 𝑅) → dom 𝑅 ∈ (ordTop‘𝑅))
1917, 18syl 17 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom 𝑅 ∈ (ordTop‘𝑅))
20 elrestr 17440 . . . . . . 7 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ dom 𝑅 ∈ (ordTop‘𝑅)) → (dom 𝑅𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2114, 15, 19, 20syl3anc 1389 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (dom 𝑅𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2213, 21eqeltrd 2861 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2322snssd 4744 . . . 4 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {dom (𝑅 ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘𝑅) ↾t 𝐴))
2413rabeqdv 3428 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
2513, 24mpteq12dv 5186 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
2625rneqd 5912 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
27 inrab2 4269 . . . . . . . . . 10 ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦𝑅𝑥}
28 simpr 488 . . . . . . . . . . . . . 14 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑦 ∈ (dom 𝑅𝐴))
2928elin2d 4157 . . . . . . . . . . . . 13 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑦𝐴)
30 simpr 488 . . . . . . . . . . . . . . 15 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝑥 ∈ (dom 𝑅𝐴))
3130elin2d 4157 . . . . . . . . . . . . . 14 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝑥𝐴)
3231adantr 484 . . . . . . . . . . . . 13 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑥𝐴)
33 brinxp 5724 . . . . . . . . . . . . 13 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3429, 32, 33syl2anc 593 . . . . . . . . . . . 12 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3534notbid 320 . . . . . . . . . . 11 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3635rabbidva 3419 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
3727, 36eqtrid 2808 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
3814adantr 484 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → (ordTop‘𝑅) ∈ Top)
3915adantr 484 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝐴𝑉)
40 simpl 486 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → 𝑅 ∈ PosetRel)
41 elinel1 4153 . . . . . . . . . . 11 (𝑥 ∈ (dom 𝑅𝐴) → 𝑥 ∈ dom 𝑅)
4211ordtopn1 23234 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
4340, 41, 42syl2an 605 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
44 elrestr 17440 . . . . . . . . . 10 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
4538, 39, 43, 44syl3anc 1389 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
4637, 45eqeltrrd 2862 . . . . . . . 8 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘𝑅) ↾t 𝐴))
4746fmpttd 7092 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}):(dom 𝑅𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
4847frnd 6696 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
4926, 48eqsstrd 3970 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
5013rabeqdv 3428 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5113, 50mpteq12dv 5186 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
5251rneqd 5912 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
53 inrab2 4269 . . . . . . . . . 10 ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥𝑅𝑦}
54 brinxp 5724 . . . . . . . . . . . . 13 ((𝑥𝐴𝑦𝐴) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5532, 29, 54syl2anc 593 . . . . . . . . . . . 12 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5655notbid 320 . . . . . . . . . . 11 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5756rabbidva 3419 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5853, 57eqtrid 2808 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5911ordtopn2 23235 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
6040, 41, 59syl2an 605 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
61 elrestr 17440 . . . . . . . . . 10 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
6238, 39, 60, 61syl3anc 1389 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
6358, 62eqeltrrd 2862 . . . . . . . 8 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘𝑅) ↾t 𝐴))
6463fmpttd 7092 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}):(dom 𝑅𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
6564frnd 6696 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6652, 65eqsstrd 3970 . . . . 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 23031 . . 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 593 . 2 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
717, 70eqsstrd 3970 1 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  {crab 3413  Vcvv 3453  cun 3902  cin 3903  wss 3904  {csn 4581   class class class wbr 5099  cmpt 5180   × cxp 5643  dom cdm 5645  ran crn 5646  cfv 6517  (class class class)co 7392  ficfi 9353  t crest 17432  topGenctg 17449  ordTopcordt 17512  PosetRelcps 18579  Topctop 22933  TopOnctopon 22950
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ov 7395  df-oprab 7396  df-mpo 7397  df-om 7843  df-1st 7966  df-2nd 7967  df-1o 8432  df-2o 8433  df-en 8924  df-fin 8927  df-fi 9354  df-rest 17434  df-topgen 17455  df-ordt 17514  df-ps 18581  df-top 22934  df-topon 22951  df-bases 22986
This theorem is referenced by:  ordtrest2  23244
  Copyright terms: Public domain W3C validator