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

Theorem oduval 18339
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 23 . . . . 5 (𝑎 = 𝑂𝑎 = 𝑂)
2 fveq2 6881 . . . . . . 7 (𝑎 = 𝑂 → (le‘𝑎) = (le‘𝑂))
32cnveqd 5861 . . . . . 6 (𝑎 = 𝑂(le‘𝑎) = (le‘𝑂))
43opeq2d 4845 . . . . 5 (𝑎 = 𝑂 → ⟨(le‘ndx), (le‘𝑎)⟩ = ⟨(le‘ndx), (le‘𝑂)⟩)
51, 4oveq12d 7428 . . . 4 (𝑎 = 𝑂 → (𝑎 sSet ⟨(le‘ndx), (le‘𝑎)⟩) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩))
6 df-odu 18338 . . . 4 ODual = (𝑎 ∈ V ↦ (𝑎 sSet ⟨(le‘ndx), (le‘𝑎)⟩))
7 ovex 7443 . . . 4 (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩) ∈ V
85, 6, 7fvmpt 6989 . . 3 (𝑂 ∈ V → (ODual‘𝑂) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩))
9 fvprc 6873 . . . 4 𝑂 ∈ V → (ODual‘𝑂) = ∅)
10 reldmsets 17220 . . . . 5 Rel dom sSet
1110ovprc1 7449 . . . 4 𝑂 ∈ V → (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩) = ∅)
129, 11eqtr4d 2801 . . 3 𝑂 ∈ V → (ODual‘𝑂) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩))
138, 12pm2.61i 184 . 2 (ODual‘𝑂) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩)
14 oduval.d . 2 𝐷 = (ODual‘𝑂)
15 oduval.l . . . . 5 = (le‘𝑂)
1615cnveqi 5860 . . . 4 = (le‘𝑂)
1716opeq2i 4842 . . 3 ⟨(le‘ndx), ⟩ = ⟨(le‘ndx), (le‘𝑂)⟩
1817oveq2i 7421 . 2 (𝑂 sSet ⟨(le‘ndx), ⟩) = (𝑂 sSet ⟨(le‘ndx), (le‘𝑂)⟩)
1913, 14, 183eqtr4i 2796 1 𝐷 = (𝑂 sSet ⟨(le‘ndx), ⟩)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1570  wcel 2143  Vcvv 3455  c0 4286  cop 4595  ccnv 5660  cfv 6536  (class class class)co 7410   sSet csts 17218  ndxcnx 17248  lecple 17312  ODualcodu 18337
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-sets 17219  df-odu 18338
This theorem is referenced by:  oduleval  18340  odubas  18342
  Copyright terms: Public domain W3C validator