| 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 6890 | . . . . . . . 8 ⊢ (𝑥 = 𝑅 → (.r‘𝑥) = (.r‘𝑅)) | |
| 4 | opprval.2 | . . . . . . . 8 ⊢ · = (.r‘𝑅) | |
| 5 | 3, 4 | eqtr4di 2813 | . . . . . . 7 ⊢ (𝑥 = 𝑅 → (.r‘𝑥) = · ) |
| 6 | 5 | tposeqd 8253 | . . . . . 6 ⊢ (𝑥 = 𝑅 → tpos (.r‘𝑥) = tpos · ) |
| 7 | 6 | opeq2d 4846 | . . . . 5 ⊢ (𝑥 = 𝑅 → 〈(.r‘ndx), tpos (.r‘𝑥)〉 = 〈(.r‘ndx), tpos · 〉) |
| 8 | 2, 7 | oveq12d 7442 | . . . 4 ⊢ (𝑥 = 𝑅 → (𝑥 sSet 〈(.r‘ndx), tpos (.r‘𝑥)〉) = (𝑅 sSet 〈(.r‘ndx), tpos · 〉)) |
| 9 | df-oppr 20576 | . . . 4 ⊢ oppr = (𝑥 ∈ V ↦ (𝑥 sSet 〈(.r‘ndx), tpos (.r‘𝑥)〉)) | |
| 10 | ovex 7457 | . . . 4 ⊢ (𝑅 sSet 〈(.r‘ndx), tpos · 〉) ∈ V | |
| 11 | 8, 9, 10 | fvmpt 6998 | . . 3 ⊢ (𝑅 ∈ V → (oppr‘𝑅) = (𝑅 sSet 〈(.r‘ndx), tpos · 〉)) |
| 12 | fvprc 6882 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (oppr‘𝑅) = ∅) | |
| 13 | reldmsets 17352 | . . . . 5 ⊢ Rel dom sSet | |
| 14 | 13 | ovprc1 7463 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑅 sSet 〈(.r‘ndx), tpos · 〉) = ∅) |
| 15 | 12, 14 | eqtr4d 2798 | . . 3 ⊢ (¬ 𝑅 ∈ V → (oppr‘𝑅) = (𝑅 sSet 〈(.r‘ndx), tpos · 〉)) |
| 16 | 11, 15 | pm2.61i 184 | . 2 ⊢ (oppr‘𝑅) = (𝑅 sSet 〈(.r‘ndx), tpos · 〉) |
| 17 | 1, 16 | eqtri 2783 | 1 ⊢ 𝑂 = (𝑅 sSet 〈(.r‘ndx), tpos · 〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∅c0 4277 〈cop 4834 ‘cfv 6543 (class class class)co 7424 tpos ctpos 8249 sSet csts 17350 ndxcnx 17380 Basecbs 17396 .rcmulr 17438 opprcoppr 20575 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-res 5663 df-iota 6497 df-fun 6545 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-tpos 8250 df-sets 17351 df-oppr 20576 |
| This theorem is used by: opprmulfval 20578 opprlem 20581 opprabs 34056 |
| Copyright terms: Public domain | W3C validator |