| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opprval | Structured version Visualization version GIF version | ||
| Description: Value of the opposite ring. (Contributed by Mario Carneiro, 1-Dec-2014.) |
| Ref | Expression |
|---|---|
| opprval.1 | ⊢ 𝐵 = (Base‘𝑅) |
| opprval.2 | ⊢ · = (.r‘𝑅) |
| opprval.3 | ⊢ 𝑂 = (oppr‘𝑅) |
| Ref | Expression |
|---|---|
| opprval | ⊢ 𝑂 = (𝑅 sSet 〈(.r‘ndx), tpos · 〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opprval.3 | . 2 ⊢ 𝑂 = (oppr‘𝑅) | |
| 2 | id 23 | . . . . 5 ⊢ (𝑥 = 𝑅 → 𝑥 = 𝑅) | |
| 3 | fveq2 6882 | . . . . . . . 8 ⊢ (𝑥 = 𝑅 → (.r‘𝑥) = (.r‘𝑅)) | |
| 4 | opprval.2 | . . . . . . . 8 ⊢ · = (.r‘𝑅) | |
| 5 | 3, 4 | eqtr4di 2815 | . . . . . . 7 ⊢ (𝑥 = 𝑅 → (.r‘𝑥) = · ) |
| 6 | 5 | tposeqd 8231 | . . . . . 6 ⊢ (𝑥 = 𝑅 → tpos (.r‘𝑥) = tpos · ) |
| 7 | 6 | opeq2d 4843 | . . . . 5 ⊢ (𝑥 = 𝑅 → 〈(.r‘ndx), tpos (.r‘𝑥)〉 = 〈(.r‘ndx), tpos · 〉) |
| 8 | 2, 7 | oveq12d 7435 | . . . 4 ⊢ (𝑥 = 𝑅 → (𝑥 sSet 〈(.r‘ndx), tpos (.r‘𝑥)〉) = (𝑅 sSet 〈(.r‘ndx), tpos · 〉)) |
| 9 | df-oppr 20484 | . . . 4 ⊢ oppr = (𝑥 ∈ V ↦ (𝑥 sSet 〈(.r‘ndx), tpos (.r‘𝑥)〉)) | |
| 10 | ovex 7450 | . . . 4 ⊢ (𝑅 sSet 〈(.r‘ndx), tpos · 〉) ∈ V | |
| 11 | 8, 9, 10 | fvmpt 6990 | . . 3 ⊢ (𝑅 ∈ V → (oppr‘𝑅) = (𝑅 sSet 〈(.r‘ndx), tpos · 〉)) |
| 12 | fvprc 6874 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (oppr‘𝑅) = ∅) | |
| 13 | reldmsets 17263 | . . . . 5 ⊢ Rel dom sSet | |
| 14 | 13 | ovprc1 7456 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑅 sSet 〈(.r‘ndx), tpos · 〉) = ∅) |
| 15 | 12, 14 | eqtr4d 2800 | . . 3 ⊢ (¬ 𝑅 ∈ V → (oppr‘𝑅) = (𝑅 sSet 〈(.r‘ndx), tpos · 〉)) |
| 16 | 11, 15 | pm2.61i 184 | . 2 ⊢ (oppr‘𝑅) = (𝑅 sSet 〈(.r‘ndx), tpos · 〉) |
| 17 | 1, 16 | eqtri 2785 | 1 ⊢ 𝑂 = (𝑅 sSet 〈(.r‘ndx), tpos · 〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ∅c0 4282 〈cop 4593 ‘cfv 6537 (class class class)co 7417 tpos ctpos 8227 sSet csts 17261 ndxcnx 17291 Basecbs 17307 .rcmulr 17349 opprcoppr 20483 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-res 5671 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-tpos 8228 df-sets 17262 df-oppr 20484 |
| This theorem is used by: opprmulfval 20486 opprlem 20489 opprabs 33892 |
| Copyright terms: Public domain | W3C validator |