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

Theorem ordtrest 22334
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 5246 . . . 4 (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
21adantr 480 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
3 eqid 2739 . . . 4 dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
4 eqid 2739 . . . 4 ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
5 eqid 2739 . . . 4 ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
63, 4, 5ordtval 22321 . . 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 22332 . . . 4 (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ Top)
9 resttop 22292 . . . 4 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
108, 9sylan 579 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
11 eqid 2739 . . . . . . . 8 dom 𝑅 = dom 𝑅
1211psssdm2 18280 . . . . . . 7 (𝑅 ∈ PosetRel → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅𝐴))
1312adantr 480 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅𝐴))
148adantr 480 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘𝑅) ∈ Top)
15 simpr 484 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → 𝐴𝑉)
1611ordttopon 22325 . . . . . . . . 9 (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
1716adantr 480 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
18 toponmax 22056 . . . . . . . 8 ((ordTop‘𝑅) ∈ (TopOn‘dom 𝑅) → dom 𝑅 ∈ (ordTop‘𝑅))
1917, 18syl 17 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom 𝑅 ∈ (ordTop‘𝑅))
20 elrestr 17120 . . . . . . 7 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ dom 𝑅 ∈ (ordTop‘𝑅)) → (dom 𝑅𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2114, 15, 19, 20syl3anc 1369 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (dom 𝑅𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2213, 21eqeltrd 2840 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘𝑅) ↾t 𝐴))
2322snssd 4747 . . . 4 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {dom (𝑅 ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘𝑅) ↾t 𝐴))
2413rabeqdv 3417 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
2513, 24mpteq12dv 5169 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
2625rneqd 5844 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
27 inrab2 4246 . . . . . . . . . 10 ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦𝑅𝑥}
28 simpr 484 . . . . . . . . . . . . . 14 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑦 ∈ (dom 𝑅𝐴))
2928elin2d 4137 . . . . . . . . . . . . 13 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑦𝐴)
30 simpr 484 . . . . . . . . . . . . . . 15 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝑥 ∈ (dom 𝑅𝐴))
3130elin2d 4137 . . . . . . . . . . . . . 14 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → 𝑥𝐴)
3231adantr 480 . . . . . . . . . . . . 13 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → 𝑥𝐴)
33 brinxp 5664 . . . . . . . . . . . . 13 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3429, 32, 33syl2anc 583 . . . . . . . . . . . 12 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3534notbid 317 . . . . . . . . . . 11 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
3635rabbidva 3410 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
3727, 36eqtrid 2791 . . . . . . . . 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 4133 . . . . . . . . . . 11 (𝑥 ∈ (dom 𝑅𝐴) → 𝑥 ∈ dom 𝑅)
4211ordtopn1 22326 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
4340, 41, 42syl2an 595 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
44 elrestr 17120 . . . . . . . . . 10 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
4538, 39, 43, 44syl3anc 1369 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
4637, 45eqeltrrd 2841 . . . . . . . 8 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘𝑅) ↾t 𝐴))
4746fmpttd 6983 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}):(dom 𝑅𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
4847frnd 6604 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
4926, 48eqsstrd 3963 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
5013rabeqdv 3417 . . . . . . . 8 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5113, 50mpteq12dv 5169 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
5251rneqd 5844 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
53 inrab2 4246 . . . . . . . . . 10 ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥𝑅𝑦}
54 brinxp 5664 . . . . . . . . . . . . 13 ((𝑥𝐴𝑦𝐴) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5532, 29, 54syl2anc 583 . . . . . . . . . . . 12 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5655notbid 317 . . . . . . . . . . 11 ((((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) ∧ 𝑦 ∈ (dom 𝑅𝐴)) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
5756rabbidva 3410 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5853, 57eqtrid 2791 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
5911ordtopn2 22327 . . . . . . . . . . 11 ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
6040, 41, 59syl2an 595 . . . . . . . . . 10 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
61 elrestr 17120 . . . . . . . . . 10 (((ordTop‘𝑅) ∈ Top ∧ 𝐴𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
6238, 39, 60, 61syl3anc 1369 . . . . . . . . 9 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
6358, 62eqeltrrd 2841 . . . . . . . 8 (((𝑅 ∈ PosetRel ∧ 𝐴𝑉) ∧ 𝑥 ∈ (dom 𝑅𝐴)) → {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘𝑅) ↾t 𝐴))
6463fmpttd 6983 . . . . . . 7 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}):(dom 𝑅𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
6564frnd 6604 . . . . . 6 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ (dom 𝑅𝐴) ↦ {𝑦 ∈ (dom 𝑅𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6652, 65eqsstrd 3963 . . . . 5 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6749, 66unssd 4124 . . . 4 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
6823, 67unssd 4124 . . 3 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
69 tgfiss 22122 . . 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 3963 1 ((𝑅 ∈ PosetRel ∧ 𝐴𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395   = wceq 1541  wcel 2109  {crab 3069  Vcvv 3430  cun 3889  cin 3890  wss 3891  {csn 4566   class class class wbr 5078  cmpt 5161   × cxp 5586  dom cdm 5588  ran crn 5589  cfv 6430  (class class class)co 7268  ficfi 9130  t crest 17112  topGenctg 17129  ordTopcordt 17191  PosetRelcps 18263  Topctop 22023  TopOnctopon 22040
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pow 5291  ax-pr 5355  ax-un 7579
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-pss 3910  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4845  df-int 4885  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-tr 5196  df-id 5488  df-eprel 5494  df-po 5502  df-so 5503  df-fr 5543  df-we 5545  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-ord 6266  df-on 6267  df-lim 6268  df-suc 6269  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-ov 7271  df-oprab 7272  df-mpo 7273  df-om 7701  df-1st 7817  df-2nd 7818  df-1o 8281  df-er 8472  df-en 8708  df-fin 8711  df-fi 9131  df-rest 17114  df-topgen 17135  df-ordt 17193  df-ps 18265  df-top 22024  df-topon 22041  df-bases 22077
This theorem is referenced by:  ordtrest2  22336
  Copyright terms: Public domain W3C validator