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

Theorem ordtcnvNEW 31285
 Description: The order dual generates the same topology as the original order. (Contributed by Mario Carneiro, 3-Sep-2015.) (Revised by Thierry Arnoux, 13-Sep-2018.)
Hypotheses
Ref Expression
ordtNEW.b 𝐵 = (Base‘𝐾)
ordtNEW.l = ((le‘𝐾) ∩ (𝐵 × 𝐵))
Assertion
Ref Expression
ordtcnvNEW (𝐾 ∈ Proset → (ordTop‘ ) = (ordTop‘ ))

Proof of Theorem ordtcnvNEW
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3444 . . . . . . . . . . . . 13 𝑦 ∈ V
2 vex 3444 . . . . . . . . . . . . 13 𝑥 ∈ V
31, 2brcnv 5717 . . . . . . . . . . . 12 (𝑦 𝑥𝑥 𝑦)
43a1i 11 . . . . . . . . . . 11 (𝐾 ∈ Proset → (𝑦 𝑥𝑥 𝑦))
54notbid 321 . . . . . . . . . 10 (𝐾 ∈ Proset → (¬ 𝑦 𝑥 ↔ ¬ 𝑥 𝑦))
65rabbidv 3427 . . . . . . . . 9 (𝐾 ∈ Proset → {𝑦𝐵 ∣ ¬ 𝑦 𝑥} = {𝑦𝐵 ∣ ¬ 𝑥 𝑦})
76mpteq2dv 5126 . . . . . . . 8 (𝐾 ∈ Proset → (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) = (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))
87rneqd 5772 . . . . . . 7 (𝐾 ∈ Proset → ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))
92, 1brcnv 5717 . . . . . . . . . . . 12 (𝑥 𝑦𝑦 𝑥)
109a1i 11 . . . . . . . . . . 11 (𝐾 ∈ Proset → (𝑥 𝑦𝑦 𝑥))
1110notbid 321 . . . . . . . . . 10 (𝐾 ∈ Proset → (¬ 𝑥 𝑦 ↔ ¬ 𝑦 𝑥))
1211rabbidv 3427 . . . . . . . . 9 (𝐾 ∈ Proset → {𝑦𝐵 ∣ ¬ 𝑥 𝑦} = {𝑦𝐵 ∣ ¬ 𝑦 𝑥})
1312mpteq2dv 5126 . . . . . . . 8 (𝐾 ∈ Proset → (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}) = (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}))
1413rneqd 5772 . . . . . . 7 (𝐾 ∈ Proset → ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}) = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}))
158, 14uneq12d 4091 . . . . . 6 (𝐾 ∈ Proset → (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦})) = (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥})))
16 uncom 4080 . . . . . 6 (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥})) = (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))
1715, 16eqtrdi 2849 . . . . 5 (𝐾 ∈ Proset → (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦})) = (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦})))
1817uneq2d 4090 . . . 4 (𝐾 ∈ Proset → ({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))) = ({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))))
1918fveq2d 6649 . . 3 (𝐾 ∈ Proset → (fi‘({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦})))) = (fi‘({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦})))))
2019fveq2d 6649 . 2 (𝐾 ∈ Proset → (topGen‘(fi‘({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))))) = (topGen‘(fi‘({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))))))
21 eqid 2798 . . . 4 (ODual‘𝐾) = (ODual‘𝐾)
2221oduprs 30676 . . 3 (𝐾 ∈ Proset → (ODual‘𝐾) ∈ Proset )
23 ordtNEW.b . . . . 5 𝐵 = (Base‘𝐾)
2421, 23odubas 17737 . . . 4 𝐵 = (Base‘(ODual‘𝐾))
25 ordtNEW.l . . . . . 6 = ((le‘𝐾) ∩ (𝐵 × 𝐵))
2625cnveqi 5709 . . . . 5 = ((le‘𝐾) ∩ (𝐵 × 𝐵))
27 cnvin 5970 . . . . 5 ((le‘𝐾) ∩ (𝐵 × 𝐵)) = ((le‘𝐾) ∩ (𝐵 × 𝐵))
28 eqid 2798 . . . . . . 7 (le‘𝐾) = (le‘𝐾)
2921, 28oduleval 17735 . . . . . 6 (le‘𝐾) = (le‘(ODual‘𝐾))
30 cnvxp 5981 . . . . . 6 (𝐵 × 𝐵) = (𝐵 × 𝐵)
3129, 30ineq12i 4137 . . . . 5 ((le‘𝐾) ∩ (𝐵 × 𝐵)) = ((le‘(ODual‘𝐾)) ∩ (𝐵 × 𝐵))
3226, 27, 313eqtri 2825 . . . 4 = ((le‘(ODual‘𝐾)) ∩ (𝐵 × 𝐵))
33 eqid 2798 . . . 4 ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥})
34 eqid 2798 . . . 4 ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}) = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦})
3524, 32, 33, 34ordtprsval 31283 . . 3 ((ODual‘𝐾) ∈ Proset → (ordTop‘ ) = (topGen‘(fi‘({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))))))
3622, 35syl 17 . 2 (𝐾 ∈ Proset → (ordTop‘ ) = (topGen‘(fi‘({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))))))
37 eqid 2798 . . 3 ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥})
38 eqid 2798 . . 3 ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}) = ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦})
3923, 25, 37, 38ordtprsval 31283 . 2 (𝐾 ∈ Proset → (ordTop‘ ) = (topGen‘(fi‘({𝐵} ∪ (ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑦 𝑥}) ∪ ran (𝑥𝐵 ↦ {𝑦𝐵 ∣ ¬ 𝑥 𝑦}))))))
4020, 36, 393eqtr4d 2843 1 (𝐾 ∈ Proset → (ordTop‘ ) = (ordTop‘ ))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2111  {crab 3110   ∪ cun 3879   ∩ cin 3880  {csn 4525   class class class wbr 5030   ↦ cmpt 5110   × cxp 5517  ◡ccnv 5518  ran crn 5520  ‘cfv 6324  ficfi 8860  Basecbs 16477  lecple 16566  topGenctg 16705  ordTopcordt 16766   Proset cproset 17530  ODualcodu 17732 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 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7443  ax-cnex 10584  ax-resscn 10585  ax-1cn 10586  ax-icn 10587  ax-addcl 10588  ax-addrcl 10589  ax-mulcl 10590  ax-mulrcl 10591  ax-mulcom 10592  ax-addass 10593  ax-mulass 10594  ax-distr 10595  ax-i2m1 10596  ax-1ne0 10597  ax-1rid 10598  ax-rnegex 10599  ax-rrecex 10600  ax-cnre 10601  ax-pre-lttri 10602  ax-pre-lttrn 10603  ax-pre-ltadd 10604  ax-pre-mulgt0 10605 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7563  df-wrecs 7932  df-recs 7993  df-rdg 8031  df-er 8274  df-en 8495  df-dom 8496  df-sdom 8497  df-pnf 10668  df-mnf 10669  df-xr 10670  df-ltxr 10671  df-le 10672  df-sub 10863  df-neg 10864  df-nn 11628  df-2 11690  df-3 11691  df-4 11692  df-5 11693  df-6 11694  df-7 11695  df-8 11696  df-9 11697  df-dec 12089  df-ndx 16480  df-slot 16481  df-base 16483  df-sets 16484  df-ple 16579  df-ordt 16768  df-proset 17532  df-odu 17733 This theorem is referenced by:  ordtrest2NEW  31288
 Copyright terms: Public domain W3C validator