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

Theorem ordtcnv 23209
Description: The order dual generates the same topology as the original order. (Contributed by Mario Carneiro, 3-Sep-2015.)
Assertion
Ref Expression
ordtcnv (𝑅 ∈ PosetRel → (ordTop‘𝑅) = (ordTop‘𝑅))

Proof of Theorem ordtcnv
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2737 . . . . . . . 8 dom 𝑅 = dom 𝑅
21psrn 18620 . . . . . . 7 (𝑅 ∈ PosetRel → dom 𝑅 = ran 𝑅)
32eqcomd 2743 . . . . . 6 (𝑅 ∈ PosetRel → ran 𝑅 = dom 𝑅)
43sneqd 4638 . . . . 5 (𝑅 ∈ PosetRel → {ran 𝑅} = {dom 𝑅})
5 vex 3484 . . . . . . . . . . . . 13 𝑦 ∈ V
6 vex 3484 . . . . . . . . . . . . 13 𝑥 ∈ V
75, 6brcnv 5893 . . . . . . . . . . . 12 (𝑦𝑅𝑥𝑥𝑅𝑦)
87a1i 11 . . . . . . . . . . 11 (𝑅 ∈ PosetRel → (𝑦𝑅𝑥𝑥𝑅𝑦))
98notbid 318 . . . . . . . . . 10 (𝑅 ∈ PosetRel → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦))
103, 9rabeqbidv 3455 . . . . . . . . 9 (𝑅 ∈ PosetRel → {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦})
113, 10mpteq12dv 5233 . . . . . . . 8 (𝑅 ∈ PosetRel → (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) = (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))
1211rneqd 5949 . . . . . . 7 (𝑅 ∈ PosetRel → ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) = ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))
136, 5brcnv 5893 . . . . . . . . . . . 12 (𝑥𝑅𝑦𝑦𝑅𝑥)
1413a1i 11 . . . . . . . . . . 11 (𝑅 ∈ PosetRel → (𝑥𝑅𝑦𝑦𝑅𝑥))
1514notbid 318 . . . . . . . . . 10 (𝑅 ∈ PosetRel → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑦𝑅𝑥))
163, 15rabeqbidv 3455 . . . . . . . . 9 (𝑅 ∈ PosetRel → {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥})
173, 16mpteq12dv 5233 . . . . . . . 8 (𝑅 ∈ PosetRel → (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}) = (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}))
1817rneqd 5949 . . . . . . 7 (𝑅 ∈ PosetRel → ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}) = ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}))
1912, 18uneq12d 4169 . . . . . 6 (𝑅 ∈ PosetRel → (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦})) = (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥})))
20 uncom 4158 . . . . . 6 (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥})) = (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))
2119, 20eqtrdi 2793 . . . . 5 (𝑅 ∈ PosetRel → (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦})) = (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦})))
224, 21uneq12d 4169 . . . 4 (𝑅 ∈ PosetRel → ({ran 𝑅} ∪ (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}))) = ({dom 𝑅} ∪ (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))
2322fveq2d 6910 . . 3 (𝑅 ∈ PosetRel → (fi‘({ran 𝑅} ∪ (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦})))) = (fi‘({dom 𝑅} ∪ (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦})))))
2423fveq2d 6910 . 2 (𝑅 ∈ PosetRel → (topGen‘(fi‘({ran 𝑅} ∪ (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))) = (topGen‘(fi‘({dom 𝑅} ∪ (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))))
25 cnvps 18623 . . 3 (𝑅 ∈ PosetRel → 𝑅 ∈ PosetRel)
26 df-rn 5696 . . . 4 ran 𝑅 = dom 𝑅
27 eqid 2737 . . . 4 ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) = ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥})
28 eqid 2737 . . . 4 ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}) = ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦})
2926, 27, 28ordtval 23197 . . 3 (𝑅 ∈ PosetRel → (ordTop‘𝑅) = (topGen‘(fi‘({ran 𝑅} ∪ (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))))
3025, 29syl 17 . 2 (𝑅 ∈ PosetRel → (ordTop‘𝑅) = (topGen‘(fi‘({ran 𝑅} ∪ (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))))
31 eqid 2737 . . 3 ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) = ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥})
32 eqid 2737 . . 3 ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}) = ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦})
331, 31, 32ordtval 23197 . 2 (𝑅 ∈ PosetRel → (ordTop‘𝑅) = (topGen‘(fi‘({dom 𝑅} ∪ (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))))
3424, 30, 333eqtr4d 2787 1 (𝑅 ∈ PosetRel → (ordTop‘𝑅) = (ordTop‘𝑅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206   = wceq 1540  wcel 2108  {crab 3436  cun 3949  {csn 4626   class class class wbr 5143  cmpt 5225  ccnv 5684  dom cdm 5685  ran crn 5686  cfv 6561  ficfi 9450  topGenctg 17482  ordTopcordt 17544  PosetRelcps 18609
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-iota 6514  df-fun 6563  df-fv 6569  df-ordt 17546  df-ps 18611
This theorem is referenced by:  ordtrest2  23212  cnvordtrestixx  33912
  Copyright terms: Public domain W3C validator