Theorem ordtprsval 29964

Description: Value of the order topology for a preset. (Contributed by Thierry Arnoux, 11-Sep-2015.)

Hypotheses

Ref	Expression
ordtNEW.b	⊢ 𝐵 = (Base‘𝐾)
ordtNEW.l	⊢ ≤ = ((le‘𝐾) ∩ (𝐵 × 𝐵))
ordtposval.e	⊢ 𝐸 = ran (𝑥 ∈ 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ¬ 𝑦 ≤ 𝑥})
ordtposval.f	⊢ 𝐹 = ran (𝑥 ∈ 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ¬ 𝑥 ≤ 𝑦})

Assertion

Ref	Expression
ordtprsval	⊢ (𝐾 ∈ Preset → (ordTop‘ ≤ ) = (topGen‘(fi‘({𝐵} ∪ (𝐸 ∪ 𝐹)))))

Distinct variable groups:   𝑥,𝑦, ≤   𝑥,𝐵,𝑦   𝑥,𝐾,𝑦

Allowed substitution hints:   𝐸(𝑥,𝑦)   𝐹(𝑥,𝑦)

Proof of Theorem ordtprsval

Step	Hyp	Ref	Expression
1		ordtNEW.l	. . . 4 ⊢ ≤ = ((le‘𝐾) ∩ (𝐵 × 𝐵))
2		fvex 6201	. . . . 5 ⊢ (le‘𝐾) ∈ V
3	2	inex1 4799	. . . 4 ⊢ ((le‘𝐾) ∩ (𝐵 × 𝐵)) ∈ V
4	1, 3	eqeltri 2697	. . 3 ⊢ ≤ ∈ V
5		eqid 2622	. . . 4 ⊢ dom ≤ = dom ≤
6		eqid 2622	. . . 4 ⊢ ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) = ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥})
7		eqid 2622	. . . 4 ⊢ ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦}) = ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦})
8	5, 6, 7	ordtval 20993	. . 3 ⊢ ( ≤ ∈ V → (ordTop‘ ≤ ) = (topGen‘(fi‘({dom ≤ } ∪ (ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) ∪ ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦}))))))
9	4, 8	ax-mp 5	. 2 ⊢ (ordTop‘ ≤ ) = (topGen‘(fi‘({dom ≤ } ∪ (ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) ∪ ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦})))))
10		ordtNEW.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
11	10, 1	prsdm 29960	. . . . . 6 ⊢ (𝐾 ∈ Preset → dom ≤ = 𝐵)
12	11	sneqd 4189	. . . . 5 ⊢ (𝐾 ∈ Preset → {dom ≤ } = {𝐵})
13		rabeq 3192	. . . . . . . . . 10 ⊢ (dom ≤ = 𝐵 → {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥} = {𝑦 ∈ 𝐵 ∣ ¬ 𝑦 ≤ 𝑥})
14	11, 13	syl 17	. . . . . . . . 9 ⊢ (𝐾 ∈ Preset → {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥} = {𝑦 ∈ 𝐵 ∣ ¬ 𝑦 ≤ 𝑥})
15	11, 14	mpteq12dv 4733	. . . . . . . 8 ⊢ (𝐾 ∈ Preset → (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) = (𝑥 ∈ 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ¬ 𝑦 ≤ 𝑥}))
16	15	rneqd 5353	. . . . . . 7 ⊢ (𝐾 ∈ Preset → ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) = ran (𝑥 ∈ 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ¬ 𝑦 ≤ 𝑥}))
17		ordtposval.e	. . . . . . 7 ⊢ 𝐸 = ran (𝑥 ∈ 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ¬ 𝑦 ≤ 𝑥})
18	16, 17	syl6eqr 2674	. . . . . 6 ⊢ (𝐾 ∈ Preset → ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) = 𝐸)
19		rabeq 3192	. . . . . . . . . 10 ⊢ (dom ≤ = 𝐵 → {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦} = {𝑦 ∈ 𝐵 ∣ ¬ 𝑥 ≤ 𝑦})
20	11, 19	syl 17	. . . . . . . . 9 ⊢ (𝐾 ∈ Preset → {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦} = {𝑦 ∈ 𝐵 ∣ ¬ 𝑥 ≤ 𝑦})
21	11, 20	mpteq12dv 4733	. . . . . . . 8 ⊢ (𝐾 ∈ Preset → (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦}) = (𝑥 ∈ 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ¬ 𝑥 ≤ 𝑦}))
22	21	rneqd 5353	. . . . . . 7 ⊢ (𝐾 ∈ Preset → ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦}) = ran (𝑥 ∈ 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ¬ 𝑥 ≤ 𝑦}))
23		ordtposval.f	. . . . . . 7 ⊢ 𝐹 = ran (𝑥 ∈ 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ¬ 𝑥 ≤ 𝑦})
24	22, 23	syl6eqr 2674	. . . . . 6 ⊢ (𝐾 ∈ Preset → ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦}) = 𝐹)
25	18, 24	uneq12d 3768	. . . . 5 ⊢ (𝐾 ∈ Preset → (ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) ∪ ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦})) = (𝐸 ∪ 𝐹))
26	12, 25	uneq12d 3768	. . . 4 ⊢ (𝐾 ∈ Preset → ({dom ≤ } ∪ (ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) ∪ ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦}))) = ({𝐵} ∪ (𝐸 ∪ 𝐹)))
27	26	fveq2d 6195	. . 3 ⊢ (𝐾 ∈ Preset → (fi‘({dom ≤ } ∪ (ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) ∪ ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦})))) = (fi‘({𝐵} ∪ (𝐸 ∪ 𝐹))))
28	27	fveq2d 6195	. 2 ⊢ (𝐾 ∈ Preset → (topGen‘(fi‘({dom ≤ } ∪ (ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑦 ≤ 𝑥}) ∪ ran (𝑥 ∈ dom ≤ ↦ {𝑦 ∈ dom ≤ ∣ ¬ 𝑥 ≤ 𝑦}))))) = (topGen‘(fi‘({𝐵} ∪ (𝐸 ∪ 𝐹)))))
29	9, 28	syl5eq 2668	1 ⊢ (𝐾 ∈ Preset → (ordTop‘ ≤ ) = (topGen‘(fi‘({𝐵} ∪ (𝐸 ∪ 𝐹)))))

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1483   ∈ wcel 1990  {crab 2916  Vcvv 3200   ∪ cun 3572   ∩ cin 3573  {csn 4177   class class class wbr 4653   ↦ cmpt 4729   × cxp 5112  dom cdm 5114  ran crn 5115  ‘cfv 5888  ficfi 8316  Basecbs 15857  lecple 15948  topGenctg 16098  ordTopcordt 16159   Preset cpreset 16926

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-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  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-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fv 5896  df-ordt 16161  df-preset 16928

This theorem is referenced by:  ordtcnvNEW  29966  ordtrest2NEW  29969  ordtconnlem1  29970