Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ordtprsval Structured version   Visualization version   GIF version

Theorem ordtprsval 31443
Description: Value of the order topology for a proset. (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 (𝐾 ∈ Proset → (ordTop‘ ) = (topGen‘(fi‘({𝐵} ∪ (𝐸𝐹)))))
Distinct variable groups:   𝑥,𝑦,   𝑥,𝐵,𝑦   𝑥,𝐾,𝑦
Allowed substitution hints:   𝐸(𝑥,𝑦)   𝐹(𝑥,𝑦)

Proof of Theorem ordtprsval
StepHypRef Expression
1 ordtNEW.l . . . 4 = ((le‘𝐾) ∩ (𝐵 × 𝐵))
2 fvex 6690 . . . . 5 (le‘𝐾) ∈ V
32inex1 5186 . . . 4 ((le‘𝐾) ∩ (𝐵 × 𝐵)) ∈ V
41, 3eqeltri 2830 . . 3 ∈ V
5 eqid 2739 . . . 4 dom = dom
6 eqid 2739 . . . 4 ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) = ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥})
7 eqid 2739 . . . 4 ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦}) = ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦})
85, 6, 7ordtval 21943 . . 3 ( ∈ V → (ordTop‘ ) = (topGen‘(fi‘({dom } ∪ (ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦}))))))
94, 8ax-mp 5 . 2 (ordTop‘ ) = (topGen‘(fi‘({dom } ∪ (ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦})))))
10 ordtNEW.b . . . . . . 7 𝐵 = (Base‘𝐾)
1110, 1prsdm 31439 . . . . . 6 (𝐾 ∈ Proset → dom = 𝐵)
1211sneqd 4529 . . . . 5 (𝐾 ∈ Proset → {dom } = {𝐵})
1311rabeqdv 3387 . . . . . . . . 9 (𝐾 ∈ Proset → {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥} = {𝑦𝐵 ∣ ¬ 𝑦 𝑥})
1411, 13mpteq12dv 5116 . . . . . . . 8 (𝐾 ∈ Proset → (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) = (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}))
1514rneqd 5782 . . . . . . 7 (𝐾 ∈ Proset → ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}))
16 ordtposval.e . . . . . . 7 𝐸 = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥})
1715, 16eqtr4di 2792 . . . . . 6 (𝐾 ∈ Proset → ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) = 𝐸)
1811rabeqdv 3387 . . . . . . . . 9 (𝐾 ∈ Proset → {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦} = {𝑦𝐵 ∣ ¬ 𝑥 𝑦})
1911, 18mpteq12dv 5116 . . . . . . . 8 (𝐾 ∈ Proset → (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦}) = (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))
2019rneqd 5782 . . . . . . 7 (𝐾 ∈ Proset → ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦}) = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))
21 ordtposval.f . . . . . . 7 𝐹 = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦})
2220, 21eqtr4di 2792 . . . . . 6 (𝐾 ∈ Proset → ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦}) = 𝐹)
2317, 22uneq12d 4055 . . . . 5 (𝐾 ∈ Proset → (ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦})) = (𝐸𝐹))
2412, 23uneq12d 4055 . . . 4 (𝐾 ∈ Proset → ({dom } ∪ (ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦}))) = ({𝐵} ∪ (𝐸𝐹)))
2524fveq2d 6681 . . 3 (𝐾 ∈ Proset → (fi‘({dom } ∪ (ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦})))) = (fi‘({𝐵} ∪ (𝐸𝐹))))
2625fveq2d 6681 . 2 (𝐾 ∈ Proset → (topGen‘(fi‘({dom } ∪ (ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥 ∈ dom ↦ {𝑦 ∈ dom ∣ ¬ 𝑥 𝑦}))))) = (topGen‘(fi‘({𝐵} ∪ (𝐸𝐹)))))
279, 26syl5eq 2786 1 (𝐾 ∈ Proset → (ordTop‘ ) = (topGen‘(fi‘({𝐵} ∪ (𝐸𝐹)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1542  wcel 2114  {crab 3058  Vcvv 3399  cun 3842  cin 3843  {csn 4517   class class class wbr 5031  cmpt 5111   × cxp 5524  dom cdm 5526  ran crn 5527  cfv 6340  ficfi 8950  Basecbs 16589  lecple 16678  topGenctg 16817  ordTopcordt 16878   Proset cproset 17655
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2711  ax-sep 5168  ax-nul 5175  ax-pr 5297
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2541  df-eu 2571  df-clab 2718  df-cleq 2731  df-clel 2812  df-nfc 2882  df-ral 3059  df-rex 3060  df-rab 3063  df-v 3401  df-sbc 3682  df-dif 3847  df-un 3849  df-in 3851  df-ss 3861  df-nul 4213  df-if 4416  df-sn 4518  df-pr 4520  df-op 4524  df-uni 4798  df-br 5032  df-opab 5094  df-mpt 5112  df-id 5430  df-xp 5532  df-rel 5533  df-cnv 5534  df-co 5535  df-dm 5536  df-rn 5537  df-iota 6298  df-fun 6342  df-fv 6348  df-ordt 16880  df-proset 17657
This theorem is referenced by:  ordtcnvNEW  31445  ordtrest2NEW  31448  ordtconnlem1  31449
  Copyright terms: Public domain W3C validator