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

Theorem oduval 18223
Description: Value of an order dual structure. (Contributed by Stefan O'Rear, 29-Jan-2015.)
Hypotheses
Ref Expression
oduval.d 𝐷 = (ODual‘𝑂)
oduval.l = (le‘𝑂)
Assertion
Ref Expression
oduval 𝐷 = (𝑂 sSet ⟨(le‘ndx), ⟩)

Proof of Theorem oduval
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 id 22 . . . . 5 (𝑎 = 𝑂𝑎 = 𝑂)
2 fveq2 6842 . . . . . . 7 (𝑎 = 𝑂 → (le‘𝑎) = (le‘𝑂))
32cnveqd 5832 . . . . . 6 (𝑎 = 𝑂(le‘𝑎) = (le‘𝑂))
43opeq2d 4838 . . . . 5 (𝑎 = 𝑂 → ⟨(le‘ndx), (le‘𝑎)⟩ = ⟨(le‘ndx), (le‘𝑂)⟩)
51, 4oveq12d 7386 . . . 4 (𝑎 = 𝑂 → (𝑎 sSet ⟨(le‘ndx), (le‘𝑎)⟩) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩))
6 df-odu 18222 . . . 4 ODual = (𝑎 ∈ V ↦ (𝑎 sSet ⟨(le‘ndx), (le‘𝑎)⟩))
7 ovex 7401 . . . 4 (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩) ∈ V
85, 6, 7fvmpt 6949 . . 3 (𝑂 ∈ V → (ODual‘𝑂) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩))
9 fvprc 6834 . . . 4 𝑂 ∈ V → (ODual‘𝑂) = ∅)
10 reldmsets 17104 . . . . 5 Rel dom sSet
1110ovprc1 7407 . . . 4 𝑂 ∈ V → (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩) = ∅)
129, 11eqtr4d 2775 . . 3 𝑂 ∈ V → (ODual‘𝑂) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩))
138, 12pm2.61i 182 . 2 (ODual‘𝑂) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩)
14 oduval.d . 2 𝐷 = (ODual‘𝑂)
15 oduval.l . . . . 5 = (le‘𝑂)
1615cnveqi 5831 . . . 4 = (le‘𝑂)
1716opeq2i 4835 . . 3 ⟨(le‘ndx), ⟩ = ⟨(le‘ndx), (le‘𝑂)⟩
1817oveq2i 7379 . 2 (𝑂 sSet ⟨(le‘ndx), ⟩) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩)
1913, 14, 183eqtr4i 2770 1 𝐷 = (𝑂 sSet ⟨(le‘ndx), ⟩)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1542  wcel 2114  Vcvv 3442  c0 4287  cop 4588  ccnv 5631  cfv 6500  (class class class)co 7368   sSet csts 17102  ndxcnx 17132  lecple 17196  ODualcodu 18221
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-sets 17103  df-odu 18222
This theorem is referenced by:  oduleval  18224  odubas  18226
  Copyright terms: Public domain W3C validator