Theorem ordtrest 23525

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.

Step	Hyp	Ref	Expression
1		inex1g 5278	. . . 4 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
2	1	adantr 486	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
3		eqid 2760	. . . 4 ⊢ dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
4		eqid 2760	. . . 4 ⊢ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
5		eqid 2760	. . . 4 ⊢ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
6	3, 4, 5	ordtval 23512	. . 3 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) ∈ V → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) = (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))))
7	2, 6	syl 18	. 2 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) = (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))))
8		ordttop 23523	. . . 4 ⊢ (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ Top)
9		resttop 23483	. . . 4 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
10	8, 9	sylan 592	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
11		eqid 2760	. . . . . . . 8 ⊢ dom 𝑅 = dom 𝑅
12	11	psssdm2 18760	. . . . . . 7 ⊢ (𝑅 ∈ PosetRel → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅 ∩ 𝐴))
13	12	adantr 486	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅 ∩ 𝐴))
14	8	adantr 486	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘𝑅) ∈ Top)
15		simpr 490	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → 𝐴 ∈ 𝑉)
16	11	ordttopon 23516	. . . . . . . . 9 ⊢ (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
17	16	adantr 486	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
18		toponmax 23249	. . . . . . . 8 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘dom 𝑅) → dom 𝑅 ∈ (ordTop‘𝑅))
19	17, 18	syl 18	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom 𝑅 ∈ (ordTop‘𝑅))
20		elrestr 17604	. . . . . . 7 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ dom 𝑅 ∈ (ordTop‘𝑅)) → (dom 𝑅 ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
21	14, 15, 19, 20	syl3anc 1398	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (dom 𝑅 ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
22	13, 21	eqeltrd 2860	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘𝑅) ↾t 𝐴))
23	22	snssd 4743	. . . 4 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {dom (𝑅 ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘𝑅) ↾t 𝐴))
24	13	rabeqdv 3427	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
25	13, 24	mpteq12dv 5191	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
26	25	rneqd 5919	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
27		inrab2 4262	. . . . . . . . . 10 ⊢ ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦𝑅𝑥}
28		simpr 490	. . . . . . . . . . . . . 14 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑦 ∈ (dom 𝑅 ∩ 𝐴))
29	28	elin2d 4102	. . . . . . . . . . . . 13 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑦 ∈ 𝐴)
30		simpr 490	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ (dom 𝑅 ∩ 𝐴))
31	30	elin2d 4102	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ 𝐴)
32	31	adantr 486	. . . . . . . . . . . . 13 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ 𝐴)
33		brinxp 5729	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
34	29, 32, 33	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
35	34	notbid 321	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
36	35	rabbidva 3418	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
37	27, 36	eqtrid 2807	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
38	14	adantr 486	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → (ordTop‘𝑅) ∈ Top)
39	15	adantr 486	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝐴 ∈ 𝑉)
40		simpl 488	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ PosetRel)
41		elinel1 4098	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) → 𝑥 ∈ dom 𝑅)
42	11	ordtopn1 23517	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
43	40, 41, 42	syl2an 608	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
44		elrestr 17604	. . . . . . . . . 10 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
45	38, 39, 43, 44	syl3anc 1398	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
46	37, 45	eqeltrrd 2861	. . . . . . . 8 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘𝑅) ↾t 𝐴))
47	46	fmpttd 7115	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}):(dom 𝑅 ∩ 𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
48	47	frnd 6718	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
49	26, 48	eqsstrd 3942	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
50	13	rabeqdv 3427	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
51	13, 50	mpteq12dv 5191	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
52	51	rneqd 5919	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
53		inrab2 4262	. . . . . . . . . 10 ⊢ ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥𝑅𝑦}
54		brinxp 5729	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
55	32, 29, 54	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
56	55	notbid 321	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
57	56	rabbidva 3418	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
58	53, 57	eqtrid 2807	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
59	11	ordtopn2 23518	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
60	40, 41, 59	syl2an 608	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
61		elrestr 17604	. . . . . . . . . 10 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
62	38, 39, 60, 61	syl3anc 1398	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
63	58, 62	eqeltrrd 2861	. . . . . . . 8 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘𝑅) ↾t 𝐴))
64	63	fmpttd 7115	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}):(dom 𝑅 ∩ 𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
65	64	frnd 6718	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
66	52, 65	eqsstrd 3942	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
67	49, 66	unssd 4190	. . . 4 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
68	23, 67	unssd 4190	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
69		tgfiss 23314	. . 3 ⊢ ((((ordTop‘𝑅) ↾t 𝐴) ∈ Top ∧ ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾t 𝐴)) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
70	10, 68, 69	syl2anc 596	. 2 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
71	7, 70	eqsstrd 3942	1 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089   ∪ cun 4149  {csn 4584   class class class wbr 5102   ↦ cmpt 5185   × cxp 5648  dom cdm 5650  ran crn 5651  ‘cfv 6538  (class class class)co 7420  ficfi 9405   ↾_t crest 17596  topGenctg 17613  ordTopcordt 17676  PosetRelcps 18743  Topctop 23216  TopOnctopon 23233

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-1o 8479  df-2o 8480  df-en 8977  df-fin 8980  df-fi 9406  df-rest 17598  df-topgen 17619  df-ordt 17678  df-ps 18745  df-top 23217  df-topon 23234  df-bases 23269

This theorem is used by:  ordtrest2  23527