Theorem ordtrest 21006

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 4801	. . . 4 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
2	1	adantr 481	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
3		eqid 2622	. . . 4 ⊢ dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
4		eqid 2622	. . . 4 ⊢ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
5		eqid 2622	. . . 4 ⊢ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
6	3, 4, 5	ordtval 20993	. . 3 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) ∈ V → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) = (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))))
7	2, 6	syl 17	. 2 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) = (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))))
8		ordttop 21004	. . . 4 ⊢ (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ Top)
9		resttop 20964	. . . 4 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
10	8, 9	sylan 488	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ((ordTop‘𝑅) ↾t 𝐴) ∈ Top)
11		eqid 2622	. . . . . . . 8 ⊢ dom 𝑅 = dom 𝑅
12	11	psssdm2 17215	. . . . . . 7 ⊢ (𝑅 ∈ PosetRel → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅 ∩ 𝐴))
13	12	adantr 481	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅 ∩ 𝐴))
14	8	adantr 481	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘𝑅) ∈ Top)
15		simpr 477	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → 𝐴 ∈ 𝑉)
16	11	ordttopon 20997	. . . . . . . . 9 ⊢ (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
17	16	adantr 481	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
18		toponmax 20730	. . . . . . . 8 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘dom 𝑅) → dom 𝑅 ∈ (ordTop‘𝑅))
19	17, 18	syl 17	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom 𝑅 ∈ (ordTop‘𝑅))
20		elrestr 16089	. . . . . . 7 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ dom 𝑅 ∈ (ordTop‘𝑅)) → (dom 𝑅 ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
21	14, 15, 19, 20	syl3anc 1326	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (dom 𝑅 ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
22	13, 21	eqeltrd 2701	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘𝑅) ↾t 𝐴))
23	22	snssd 4340	. . . 4 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {dom (𝑅 ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘𝑅) ↾t 𝐴))
24		rabeq 3192	. . . . . . . . 9 ⊢ (dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅 ∩ 𝐴) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
25	13, 24	syl 17	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
26	13, 25	mpteq12dv 4733	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
27	26	rneqd 5353	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
28		inrab2 3900	. . . . . . . . . 10 ⊢ ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦𝑅𝑥}
29		inss2 3834	. . . . . . . . . . . . . 14 ⊢ (dom 𝑅 ∩ 𝐴) ⊆ 𝐴
30		simpr 477	. . . . . . . . . . . . . 14 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑦 ∈ (dom 𝑅 ∩ 𝐴))
31	29, 30	sseldi 3601	. . . . . . . . . . . . 13 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑦 ∈ 𝐴)
32		simpr 477	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ (dom 𝑅 ∩ 𝐴))
33	29, 32	sseldi 3601	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ 𝐴)
34	33	adantr 481	. . . . . . . . . . . . 13 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ 𝐴)
35		brinxp 5181	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
36	31, 34, 35	syl2anc 693	. . . . . . . . . . . 12 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
37	36	notbid 308	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
38	37	rabbidva 3188	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
39	28, 38	syl5eq 2668	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
40	14	adantr 481	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → (ordTop‘𝑅) ∈ Top)
41	15	adantr 481	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝐴 ∈ 𝑉)
42		simpl 473	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ PosetRel)
43		inss1 3833	. . . . . . . . . . . 12 ⊢ (dom 𝑅 ∩ 𝐴) ⊆ dom 𝑅
44	43	sseli 3599	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) → 𝑥 ∈ dom 𝑅)
45	11	ordtopn1 20998	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
46	42, 44, 45	syl2an 494	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
47		elrestr 16089	. . . . . . . . . 10 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
48	40, 41, 46, 47	syl3anc 1326	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
49	39, 48	eqeltrrd 2702	. . . . . . . 8 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘𝑅) ↾t 𝐴))
50		eqid 2622	. . . . . . . 8 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
51	49, 50	fmptd 6385	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}):(dom 𝑅 ∩ 𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
52		frn 6053	. . . . . . 7 ⊢ ((𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}):(dom 𝑅 ∩ 𝐴)⟶((ordTop‘𝑅) ↾t 𝐴) → ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
53	51, 52	syl 17	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
54	27, 53	eqsstrd 3639	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
55		rabeq 3192	. . . . . . . . 9 ⊢ (dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅 ∩ 𝐴) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
56	13, 55	syl 17	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
57	13, 56	mpteq12dv 4733	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
58	57	rneqd 5353	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
59		inrab2 3900	. . . . . . . . . 10 ⊢ ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥𝑅𝑦}
60		brinxp 5181	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
61	34, 31, 60	syl2anc 693	. . . . . . . . . . . 12 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
62	61	notbid 308	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
63	62	rabbidva 3188	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
64	59, 63	syl5eq 2668	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
65	11	ordtopn2 20999	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
66	42, 44, 65	syl2an 494	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
67		elrestr 16089	. . . . . . . . . 10 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
68	40, 41, 66, 67	syl3anc 1326	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾t 𝐴))
69	64, 68	eqeltrrd 2702	. . . . . . . 8 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘𝑅) ↾t 𝐴))
70		eqid 2622	. . . . . . . 8 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
71	69, 70	fmptd 6385	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}):(dom 𝑅 ∩ 𝐴)⟶((ordTop‘𝑅) ↾t 𝐴))
72		frn 6053	. . . . . . 7 ⊢ ((𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}):(dom 𝑅 ∩ 𝐴)⟶((ordTop‘𝑅) ↾t 𝐴) → ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
73	71, 72	syl 17	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
74	58, 73	eqsstrd 3639	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
75	54, 74	unssd 3789	. . . 4 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
76	23, 75	unssd 3789	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
77		tgfiss 20795	. . 3 ⊢ ((((ordTop‘𝑅) ↾t 𝐴) ∈ Top ∧ ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾t 𝐴)) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
78	10, 76, 77	syl2anc 693	. 2 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))
79	7, 78	eqsstrd 3639	1 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘𝑅) ↾t 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483   ∈ wcel 1990  {crab 2916  Vcvv 3200   ∪ cun 3572   ∩ cin 3573   ⊆ wss 3574  {csn 4177   class class class wbr 4653   ↦ cmpt 4729   × cxp 5112  dom cdm 5114  ran crn 5115  ⟶wf 5884  ‘cfv 5888  (class class class)co 6650  ficfi 8316   ↾_t crest 16081  topGenctg 16098  ordTopcordt 16159  PosetRelcps 17198  Topctop 20698  TopOnctopon 20715

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-fin 7959  df-fi 8317  df-rest 16083  df-topgen 16104  df-ordt 16161  df-ps 17200  df-top 20699  df-topon 20716  df-bases 20750

This theorem is referenced by:  ordtrest2  21008