ordtrest - Metamath Proof Explorer

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

Theorem ordtrest 23061

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 5312	. . . 4 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
2	1	adantr 480	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
3		eqid 2726	. . . 4 ⊢ dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
4		eqid 2726	. . . 4 ⊢ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
5		eqid 2726	. . . 4 ⊢ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
6	3, 4, 5	ordtval 23048	. . 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 23059	. . . 4 ⊢ (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ Top)
9		resttop 23019	. . . 4 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉) → ((ordTop‘𝑅) ↾_t 𝐴) ∈ Top)
10	8, 9	sylan 579	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ((ordTop‘𝑅) ↾_t 𝐴) ∈ Top)
11		eqid 2726	. . . . . . . 8 ⊢ dom 𝑅 = dom 𝑅
12	11	psssdm2 18546	. . . . . . 7 ⊢ (𝑅 ∈ PosetRel → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅 ∩ 𝐴))
13	12	adantr 480	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) = (dom 𝑅 ∩ 𝐴))
14	8	adantr 480	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘𝑅) ∈ Top)
15		simpr 484	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → 𝐴 ∈ 𝑉)
16	11	ordttopon 23052	. . . . . . . . 9 ⊢ (𝑅 ∈ PosetRel → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
17	16	adantr 480	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘𝑅) ∈ (TopOn‘dom 𝑅))
18		toponmax 22783	. . . . . . . 8 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘dom 𝑅) → dom 𝑅 ∈ (ordTop‘𝑅))
19	17, 18	syl 17	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom 𝑅 ∈ (ordTop‘𝑅))
20		elrestr 17383	. . . . . . 7 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ dom 𝑅 ∈ (ordTop‘𝑅)) → (dom 𝑅 ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾_t 𝐴))
21	14, 15, 19, 20	syl3anc 1368	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (dom 𝑅 ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾_t 𝐴))
22	13, 21	eqeltrd 2827	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → dom (𝑅 ∩ (𝐴 × 𝐴)) ∈ ((ordTop‘𝑅) ↾_t 𝐴))
23	22	snssd 4807	. . . 4 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {dom (𝑅 ∩ (𝐴 × 𝐴))} ⊆ ((ordTop‘𝑅) ↾_t 𝐴))
24	13	rabeqdv 3441	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
25	13, 24	mpteq12dv 5232	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
26	25	rneqd 5931	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) = ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}))
27		inrab2 4302	. . . . . . . . . 10 ⊢ ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦𝑅𝑥}
28		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑦 ∈ (dom 𝑅 ∩ 𝐴))
29	28	elin2d 4194	. . . . . . . . . . . . 13 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑦 ∈ 𝐴)
30		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ (dom 𝑅 ∩ 𝐴))
31	30	elin2d 4194	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ 𝐴)
32	31	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → 𝑥 ∈ 𝐴)
33		brinxp 5747	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
34	29, 32, 33	syl2anc 583	. . . . . . . . . . . 12 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
35	34	notbid 318	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
36	35	rabbidva 3433	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
37	27, 36	eqtrid 2778	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥})
38	14	adantr 480	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → (ordTop‘𝑅) ∈ Top)
39	15	adantr 480	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → 𝐴 ∈ 𝑉)
40		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ PosetRel)
41		elinel1 4190	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) → 𝑥 ∈ dom 𝑅)
42	11	ordtopn1 23053	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
43	40, 41, 42	syl2an 595	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅))
44		elrestr 17383	. . . . . . . . . 10 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾_t 𝐴))
45	38, 39, 43, 44	syl3anc 1368	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾_t 𝐴))
46	37, 45	eqeltrrd 2828	. . . . . . . 8 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ ((ordTop‘𝑅) ↾_t 𝐴))
47	46	fmpttd 7110	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}):(dom 𝑅 ∩ 𝐴)⟶((ordTop‘𝑅) ↾_t 𝐴))
48	47	frnd 6719	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾_t 𝐴))
49	26, 48	eqsstrd 4015	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ⊆ ((ordTop‘𝑅) ↾_t 𝐴))
50	13	rabeqdv 3441	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
51	13, 50	mpteq12dv 5232	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
52	51	rneqd 5931	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) = ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))
53		inrab2 4302	. . . . . . . . . 10 ⊢ ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥𝑅𝑦}
54		brinxp 5747	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
55	32, 29, 54	syl2anc 583	. . . . . . . . . . . 12 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
56	55	notbid 318	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) ∧ 𝑦 ∈ (dom 𝑅 ∩ 𝐴)) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
57	56	rabbidva 3433	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
58	53, 57	eqtrid 2778	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) = {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})
59	11	ordtopn2 23054	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
60	40, 41, 59	syl2an 595	. . . . . . . . . 10 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅))
61		elrestr 17383	. . . . . . . . . 10 ⊢ (((ordTop‘𝑅) ∈ Top ∧ 𝐴 ∈ 𝑉 ∧ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∈ (ordTop‘𝑅)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾_t 𝐴))
62	38, 39, 60, 61	syl3anc 1368	. . . . . . . . 9 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → ({𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦} ∩ 𝐴) ∈ ((ordTop‘𝑅) ↾_t 𝐴))
63	58, 62	eqeltrrd 2828	. . . . . . . 8 ⊢ (((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ (dom 𝑅 ∩ 𝐴)) → {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦} ∈ ((ordTop‘𝑅) ↾_t 𝐴))
64	63	fmpttd 7110	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}):(dom 𝑅 ∩ 𝐴)⟶((ordTop‘𝑅) ↾_t 𝐴))
65	64	frnd 6719	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↦ {𝑦 ∈ (dom 𝑅 ∩ 𝐴) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾_t 𝐴))
66	52, 65	eqsstrd 4015	. . . . 5 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}) ⊆ ((ordTop‘𝑅) ↾_t 𝐴))
67	49, 66	unssd 4181	. . . 4 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦})) ⊆ ((ordTop‘𝑅) ↾_t 𝐴))
68	23, 67	unssd 4181	. . 3 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → ({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))) ⊆ ((ordTop‘𝑅) ↾_t 𝐴))
69		tgfiss 22849	. . 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 583	. 2 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (topGen‘(fi‘({dom (𝑅 ∩ (𝐴 × 𝐴))} ∪ (ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) ∪ ran (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ↦ {𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∣ ¬ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦}))))) ⊆ ((ordTop‘𝑅) ↾_t 𝐴))
71	7, 70	eqsstrd 4015	1 ⊢ ((𝑅 ∈ PosetRel ∧ 𝐴 ∈ 𝑉) → (ordTop‘(𝑅 ∩ (𝐴 × 𝐴))) ⊆ ((ordTop‘𝑅) ↾_t 𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 {crab 3426 Vcvv 3468 ∪ cun 3941 ∩ cin 3942 ⊆ wss 3943 {csn 4623 class class class wbr 5141 ↦ cmpt 5224 × cxp 5667 dom cdm 5669 ran crn 5670 ‘cfv 6537 (class class class)co 7405 ficfi 9407 ↾_t crest 17375 topGenctg 17392 ordTopcordt 17454 PosetRelcps 18529 Topctop 22750 TopOnctopon 22767

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-ral 3056 df-rex 3065 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-1o 8467 df-er 8705 df-en 8942 df-fin 8945 df-fi 9408 df-rest 17377 df-topgen 17398 df-ordt 17456 df-ps 18531 df-top 22751 df-topon 22768 df-bases 22804

This theorem is referenced by: ordtrest2 23063

W3C validator