ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  opprvalg GIF version

Theorem opprvalg 14458
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
opprvalg (𝑅 ∈ 𝑉 → 𝑂 = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩))

Proof of Theorem opprvalg
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 opprval.3 . 2 𝑂 = (oppr‘𝑅)
2 df-oppr 14457 . . 3 oppr = (𝑥 ∈ V ↦ (𝑥 sSet ⟨(.r‘ndx), tpos (.r‘𝑥)⟩))
3 id 19 . . . 4 (𝑥 = 𝑅 → 𝑥 = 𝑅)
4 fveq2 5695 . . . . . . 7 (𝑥 = 𝑅 → (.r‘𝑥) = (.r‘𝑅))
5 opprval.2 . . . . . . 7 · = (.r‘𝑅)
64, 5eqtr4di 2289 . . . . . 6 (𝑥 = 𝑅 → (.r‘𝑥) = · )
76tposeqd 6519 . . . . 5 (𝑥 = 𝑅 → tpos (.r‘𝑥) = tpos · )
87opeq2d 3911 . . . 4 (𝑥 = 𝑅 → ⟨(.r‘ndx), tpos (.r‘𝑥)⟩ = ⟨(.r‘ndx), tpos · ⟩)
93, 8oveq12d 6103 . . 3 (𝑥 = 𝑅 → (𝑥 sSet ⟨(.r‘ndx), tpos (.r‘𝑥)⟩) = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩))
10 elex 2833 . . 3 (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
11 mulrslid 13539 . . . . . 6 (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
1211simpri 113 . . . . 5 (.r‘ndx) ∈ ℕ
1312a1i 9 . . . 4 (𝑅 ∈ 𝑉 → (.r‘ndx) ∈ ℕ)
1411slotex 13431 . . . . . 6 (𝑅 ∈ 𝑉 → (.r‘𝑅) ∈ V)
155, 14eqeltrid 2325 . . . . 5 (𝑅 ∈ 𝑉 → · ∈ V)
16 tposexg 6529 . . . . 5 ( · ∈ V → tpos · ∈ V)
1715, 16syl 14 . . . 4 (𝑅 ∈ 𝑉 → tpos · ∈ V)
18 setsex 13436 . . . 4 ((𝑅 ∈ V ∧ (.r‘ndx) ∈ ℕ ∧ tpos · ∈ V) → (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩) ∈ V)
1910, 13, 17, 18syl3anc 1278 . . 3 (𝑅 ∈ 𝑉 → (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩) ∈ V)
202, 9, 10, 19fvmptd3 5799 . 2 (𝑅 ∈ 𝑉 → (oppr‘𝑅) = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩))
211, 20eqtrid 2283 1 (𝑅 ∈ 𝑉 → 𝑂 = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∈ wcel 2209  Vcvv 2821  ⟨cop 3712  ‘cfv 5377  (class class class)co 6085  tpos ctpos 6515  ℕcn 9307  ndxcnx 13401   sSet csts 13402  Slot cslot 13403  Basecbs 13404  .rcmulr 13485  opprcoppr 14456
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-tpos 6516  df-inn 9308  df-2 9366  df-3 9367  df-ndx 13407  df-slot 13408  df-sets 13411  df-mulr 13498  df-oppr 14457
This theorem is used by:  opprmulfvalg  14459  opprex  14462  opprsllem  14463
  Copyright terms: Public domain W3C validator