Theorem ordtval 23076

Description: Value of the order topology. (Contributed by Mario Carneiro, 3-Sep-2015.)

Hypotheses

Ref	Expression
ordtval.1	⊢ 𝑋 = dom 𝑅
ordtval.2	⊢ 𝐴 = ran (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})
ordtval.3	⊢ 𝐵 = ran (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦})

Assertion

Ref	Expression
ordtval	⊢ (𝑅 ∈ 𝑉 → (ordTop‘𝑅) = (topGen‘(fi‘({𝑋} ∪ (𝐴 ∪ 𝐵)))))

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

Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝑉(𝑦)

Proof of Theorem ordtval

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3468	. 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
2		dmeq 5867	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → dom 𝑟 = dom 𝑅)
3		ordtval.1	. . . . . . . 8 ⊢ 𝑋 = dom 𝑅
4	2, 3	eqtr4di 2782	. . . . . . 7 ⊢ (𝑟 = 𝑅 → dom 𝑟 = 𝑋)
5	4	sneqd 4601	. . . . . 6 ⊢ (𝑟 = 𝑅 → {dom 𝑟} = {𝑋})
6		rnun 6118	. . . . . . 7 ⊢ ran ((𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) ∪ (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦})) = (ran (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) ∪ ran (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦}))
7		breq 5109	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑅 → (𝑦𝑟𝑥 ↔ 𝑦𝑅𝑥))
8	7	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (¬ 𝑦𝑟𝑥 ↔ ¬ 𝑦𝑅𝑥))
9	4, 8	rabeqbidv 3424	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥} = {𝑦 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})
10	4, 9	mpteq12dv 5194	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))
11	10	rneqd 5902	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ran (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) = ran (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥}))
12		ordtval.2	. . . . . . . . 9 ⊢ 𝐴 = ran (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝑋 ∣ ¬ 𝑦𝑅𝑥})
13	11, 12	eqtr4di 2782	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ran (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) = 𝐴)
14		breq 5109	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑅 → (𝑥𝑟𝑦 ↔ 𝑥𝑅𝑦))
15	14	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (¬ 𝑥𝑟𝑦 ↔ ¬ 𝑥𝑅𝑦))
16	4, 15	rabeqbidv 3424	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦} = {𝑦 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦})
17	4, 16	mpteq12dv 5194	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦}) = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}))
18	17	rneqd 5902	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ran (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦}) = ran (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦}))
19		ordtval.3	. . . . . . . . 9 ⊢ 𝐵 = ran (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝑋 ∣ ¬ 𝑥𝑅𝑦})
20	18, 19	eqtr4di 2782	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ran (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦}) = 𝐵)
21	13, 20	uneq12d 4132	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (ran (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) ∪ ran (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦})) = (𝐴 ∪ 𝐵))
22	6, 21	eqtrid 2776	. . . . . 6 ⊢ (𝑟 = 𝑅 → ran ((𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) ∪ (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦})) = (𝐴 ∪ 𝐵))
23	5, 22	uneq12d 4132	. . . . 5 ⊢ (𝑟 = 𝑅 → ({dom 𝑟} ∪ ran ((𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) ∪ (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦}))) = ({𝑋} ∪ (𝐴 ∪ 𝐵)))
24	23	fveq2d 6862	. . . 4 ⊢ (𝑟 = 𝑅 → (fi‘({dom 𝑟} ∪ ran ((𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) ∪ (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦})))) = (fi‘({𝑋} ∪ (𝐴 ∪ 𝐵))))
25	24	fveq2d 6862	. . 3 ⊢ (𝑟 = 𝑅 → (topGen‘(fi‘({dom 𝑟} ∪ ran ((𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) ∪ (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦}))))) = (topGen‘(fi‘({𝑋} ∪ (𝐴 ∪ 𝐵)))))
26		df-ordt 17464	. . 3 ⊢ ordTop = (𝑟 ∈ V ↦ (topGen‘(fi‘({dom 𝑟} ∪ ran ((𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑦𝑟𝑥}) ∪ (𝑥 ∈ dom 𝑟 ↦ {𝑦 ∈ dom 𝑟 ∣ ¬ 𝑥𝑟𝑦}))))))
27		fvex 6871	. . 3 ⊢ (topGen‘(fi‘({𝑋} ∪ (𝐴 ∪ 𝐵)))) ∈ V
28	25, 26, 27	fvmpt 6968	. 2 ⊢ (𝑅 ∈ V → (ordTop‘𝑅) = (topGen‘(fi‘({𝑋} ∪ (𝐴 ∪ 𝐵)))))
29	1, 28	syl 17	1 ⊢ (𝑅 ∈ 𝑉 → (ordTop‘𝑅) = (topGen‘(fi‘({𝑋} ∪ (𝐴 ∪ 𝐵)))))

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1540   ∈ wcel 2109  {crab 3405  Vcvv 3447   ∪ cun 3912  {csn 4589   class class class wbr 5107   ↦ cmpt 5188  dom cdm 5638  ran crn 5639  ‘cfv 6511  ficfi 9361  topGenctg 17400  ordTopcordt 17462

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-iota 6464  df-fun 6513  df-fv 6519  df-ordt 17464

This theorem is referenced by:  ordttopon  23080  ordtopn1  23081  ordtopn2  23082  ordtcnv  23088  ordtrest  23089  ordtrest2  23091  leordtval2  23099  ordthmeolem  23688  ordtprsval  33908  ordtrestNEW  33911