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

Theorem ordtcnv 21804
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 2822 . . . . . . . 8 dom 𝑅 = dom 𝑅
21psrn 17810 . . . . . . 7 (𝑅 ∈ PosetRel → dom 𝑅 = ran 𝑅)
32eqcomd 2828 . . . . . 6 (𝑅 ∈ PosetRel → ran 𝑅 = dom 𝑅)
43sneqd 4551 . . . . 5 (𝑅 ∈ PosetRel → {ran 𝑅} = {dom 𝑅})
5 vex 3472 . . . . . . . . . . . . 13 𝑦 ∈ V
6 vex 3472 . . . . . . . . . . . . 13 𝑥 ∈ V
75, 6brcnv 5730 . . . . . . . . . . . 12 (𝑦𝑅𝑥𝑥𝑅𝑦)
87a1i 11 . . . . . . . . . . 11 (𝑅 ∈ PosetRel → (𝑦𝑅𝑥𝑥𝑅𝑦))
98notbid 321 . . . . . . . . . 10 (𝑅 ∈ PosetRel → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦))
103, 9rabeqbidv 3461 . . . . . . . . 9 (𝑅 ∈ PosetRel → {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥} = {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦})
113, 10mpteq12dv 5127 . . . . . . . 8 (𝑅 ∈ PosetRel → (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) = (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))
1211rneqd 5785 . . . . . . 7 (𝑅 ∈ PosetRel → ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) = ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))
136, 5brcnv 5730 . . . . . . . . . . . 12 (𝑥𝑅𝑦𝑦𝑅𝑥)
1413a1i 11 . . . . . . . . . . 11 (𝑅 ∈ PosetRel → (𝑥𝑅𝑦𝑦𝑅𝑥))
1514notbid 321 . . . . . . . . . 10 (𝑅 ∈ PosetRel → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑦𝑅𝑥))
163, 15rabeqbidv 3461 . . . . . . . . 9 (𝑅 ∈ PosetRel → {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦} = {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥})
173, 16mpteq12dv 5127 . . . . . . . 8 (𝑅 ∈ PosetRel → (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}) = (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}))
1817rneqd 5785 . . . . . . 7 (𝑅 ∈ PosetRel → ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}) = ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}))
1912, 18uneq12d 4115 . . . . . 6 (𝑅 ∈ PosetRel → (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦})) = (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥})))
20 uncom 4104 . . . . . 6 (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥})) = (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))
2119, 20syl6eq 2873 . . . . 5 (𝑅 ∈ PosetRel → (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦})) = (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦})))
224, 21uneq12d 4115 . . . 4 (𝑅 ∈ PosetRel → ({ran 𝑅} ∪ (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}))) = ({dom 𝑅} ∪ (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))
2322fveq2d 6656 . . 3 (𝑅 ∈ PosetRel → (fi‘({ran 𝑅} ∪ (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦})))) = (fi‘({dom 𝑅} ∪ (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦})))))
2423fveq2d 6656 . 2 (𝑅 ∈ PosetRel → (topGen‘(fi‘({ran 𝑅} ∪ (ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))) = (topGen‘(fi‘({dom 𝑅} ∪ (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))))
25 cnvps 17813 . . 3 (𝑅 ∈ PosetRel → 𝑅 ∈ PosetRel)
26 df-rn 5543 . . . 4 ran 𝑅 = dom 𝑅
27 eqid 2822 . . . 4 ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥}) = ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑦𝑅𝑥})
28 eqid 2822 . . . 4 ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦}) = ran (𝑥 ∈ ran 𝑅 ↦ {𝑦 ∈ ran 𝑅 ∣ ¬ 𝑥𝑅𝑦})
2926, 27, 28ordtval 21792 . . 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 2822 . . 3 ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) = ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥})
32 eqid 2822 . . 3 ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}) = ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦})
331, 31, 32ordtval 21792 . 2 (𝑅 ∈ PosetRel → (ordTop‘𝑅) = (topGen‘(fi‘({dom 𝑅} ∪ (ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑦𝑅𝑥}) ∪ ran (𝑥 ∈ dom 𝑅 ↦ {𝑦 ∈ dom 𝑅 ∣ ¬ 𝑥𝑅𝑦}))))))
3424, 30, 333eqtr4d 2867 1 (𝑅 ∈ PosetRel → (ordTop‘𝑅) = (ordTop‘𝑅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209   = wceq 1538  wcel 2114  {crab 3134  cun 3906  {csn 4539   class class class wbr 5042  cmpt 5122  ccnv 5531  dom cdm 5532  ran crn 5533  cfv 6334  ficfi 8862  topGenctg 16702  ordTopcordt 16763  PosetRelcps 17799
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-iota 6293  df-fun 6336  df-fv 6342  df-ordt 16765  df-ps 17801
This theorem is referenced by:  ordtrest2  21807  cnvordtrestixx  31230
  Copyright terms: Public domain W3C validator