Theorem ordtopn2 23352

Description: A downward ray (-∞, 𝑃) is open. (Contributed by Mario Carneiro, 3-Sep-2015.)

Hypothesis

Ref	Expression
ordttopon.3	⊢ 𝑋 = dom 𝑅

Assertion

Ref	Expression
ordtopn2	⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ (ordTop‘𝑅))

Distinct variable groups:   𝑥,𝑃   𝑥,𝑅   𝑥,𝑉   𝑥,𝑋

Proof of Theorem ordtopn2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordttopon.3	. . . . . . . . 9 ⊢ 𝑋 = dom 𝑅
2		eqid 2763	. . . . . . . . 9 ⊢ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) = ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦})
3		eqid 2763	. . . . . . . . 9 ⊢ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}) = ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})
4	1, 2, 3	ordtuni 23347	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → 𝑋 = ∪ ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))))
5	4	adantr 485	. . . . . . 7 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → 𝑋 = ∪ ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))))
6		dmexg 7894	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → dom 𝑅 ∈ V)
7	1, 6	eqeltrid 2867	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → 𝑋 ∈ V)
8	7	adantr 485	. . . . . . 7 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → 𝑋 ∈ V)
9	5, 8	eqeltrrd 2864	. . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ∪ ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ∈ V)
10		uniexb 7759	. . . . . 6 ⊢ (({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ∈ V ↔ ∪ ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ∈ V)
11	9, 10	sylibr 237	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ∈ V)
12		ssfii 9375	. . . . 5 ⊢ (({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ∈ V → ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ⊆ (fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))))
13	11, 12	syl 18	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ⊆ (fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))))
14		fibas 23134	. . . . 5 ⊢ (fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))) ∈ TopBases
15		bastg 23123	. . . . 5 ⊢ ((fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))) ∈ TopBases → (fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))) ⊆ (topGen‘(fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))))))
16	14, 15	ax-mp 5	. . . 4 ⊢ (fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))) ⊆ (topGen‘(fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))))
17	13, 16	sstrdi 3949	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ⊆ (topGen‘(fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))))))
18	1, 2, 3	ordtval 23346	. . . 4 ⊢ (𝑅 ∈ 𝑉 → (ordTop‘𝑅) = (topGen‘(fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))))))
19	18	adantr 485	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (ordTop‘𝑅) = (topGen‘(fi‘({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))))))
20	17, 19	sseqtrrd 3974	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))) ⊆ (ordTop‘𝑅))
21		ssun2 4132	. . 3 ⊢ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})) ⊆ ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))
22		ssun2 4132	. . . 4 ⊢ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}) ⊆ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))
23		simpr 489	. . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → 𝑃 ∈ 𝑋)
24		eqidd 2764	. . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥})
25		breq1 5112	. . . . . . . . 9 ⊢ (𝑦 = 𝑃 → (𝑦𝑅𝑥 ↔ 𝑃𝑅𝑥))
26	25	notbid 321	. . . . . . . 8 ⊢ (𝑦 = 𝑃 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑃𝑅𝑥))
27	26	rabbidv 3423	. . . . . . 7 ⊢ (𝑦 = 𝑃 → {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥} = {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥})
28	27	rspceeqv 3604	. . . . . 6 ⊢ ((𝑃 ∈ 𝑋 ∧ {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥}) → ∃𝑦 ∈ 𝑋 {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})
29	23, 24, 28	syl2anc 595	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})
30		rabexg 5308	. . . . . 6 ⊢ (𝑋 ∈ V → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ V)
31		eqid 2763	. . . . . . 7 ⊢ (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}) = (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})
32	31	elrnmpt 5948	. . . . . 6 ⊢ ({𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ V → ({𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}) ↔ ∃𝑦 ∈ 𝑋 {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))
33	8, 30, 32	3syl 19	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ({𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}) ↔ ∃𝑦 ∈ 𝑋 {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))
34	29, 33	mpbird 260	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))
35	22, 34	sselid 3935	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})))
36	21, 35	sselid 3935	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ ({𝑋} ∪ (ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑦 ∈ 𝑋 ↦ {𝑥 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))))
37	20, 36	sseldd 3938	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ (ordTop‘𝑅))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∃wrex 3089  {crab 3416  Vcvv 3455   ∪ cun 3903   ⊆ wss 3905  {csn 4589  ∪ cuni 4872   class class class wbr 5109   ↦ cmpt 5192  dom cdm 5661  ran crn 5662  ‘cfv 6536  ficfi 9366  topGenctg 17485  ordTopcordt 17548  TopBasesctb 23102

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-om 7859  df-1o 8449  df-en 8940  df-fin 8943  df-fi 9367  df-topgen 17491  df-ordt 17550  df-bases 23103

This theorem is referenced by:  ordtopn3  23353  ordtcld2  23355  ordtrest  23359  ordthauslem  23540  ordthmeolem  23958  ordtrestNEW  34311