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

Theorem opprval 20274
Description: Value of the opposite ring. (Contributed by Mario Carneiro, 1-Dec-2014.)
Hypotheses
Ref Expression
opprval.1 𝐵 = (Base‘𝑅)
opprval.2 · = (.r𝑅)
opprval.3 𝑂 = (oppr𝑅)
Assertion
Ref Expression
opprval 𝑂 = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩)

Proof of Theorem opprval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 opprval.3 . 2 𝑂 = (oppr𝑅)
2 id 22 . . . . 5 (𝑥 = 𝑅𝑥 = 𝑅)
3 fveq2 6897 . . . . . . . 8 (𝑥 = 𝑅 → (.r𝑥) = (.r𝑅))
4 opprval.2 . . . . . . . 8 · = (.r𝑅)
53, 4eqtr4di 2786 . . . . . . 7 (𝑥 = 𝑅 → (.r𝑥) = · )
65tposeqd 8235 . . . . . 6 (𝑥 = 𝑅 → tpos (.r𝑥) = tpos · )
76opeq2d 4881 . . . . 5 (𝑥 = 𝑅 → ⟨(.r‘ndx), tpos (.r𝑥)⟩ = ⟨(.r‘ndx), tpos · ⟩)
82, 7oveq12d 7438 . . . 4 (𝑥 = 𝑅 → (𝑥 sSet ⟨(.r‘ndx), tpos (.r𝑥)⟩) = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩))
9 df-oppr 20273 . . . 4 oppr = (𝑥 ∈ V ↦ (𝑥 sSet ⟨(.r‘ndx), tpos (.r𝑥)⟩))
10 ovex 7453 . . . 4 (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩) ∈ V
118, 9, 10fvmpt 7005 . . 3 (𝑅 ∈ V → (oppr𝑅) = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩))
12 fvprc 6889 . . . 4 𝑅 ∈ V → (oppr𝑅) = ∅)
13 reldmsets 17134 . . . . 5 Rel dom sSet
1413ovprc1 7459 . . . 4 𝑅 ∈ V → (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩) = ∅)
1512, 14eqtr4d 2771 . . 3 𝑅 ∈ V → (oppr𝑅) = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩))
1611, 15pm2.61i 182 . 2 (oppr𝑅) = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩)
171, 16eqtri 2756 1 𝑂 = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1534  wcel 2099  Vcvv 3471  c0 4323  cop 4635  cfv 6548  (class class class)co 7420  tpos ctpos 8231   sSet csts 17132  ndxcnx 17162  Basecbs 17180  .rcmulr 17234  opprcoppr 20272
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-res 5690  df-iota 6500  df-fun 6550  df-fv 6556  df-ov 7423  df-oprab 7424  df-mpo 7425  df-tpos 8232  df-sets 17133  df-oppr 20273
This theorem is referenced by:  opprmulfval  20275  opprlem  20278  opprlemOLD  20279  opprabs  33206
  Copyright terms: Public domain W3C validator
OSZAR »