| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > opprabs | Structured version Visualization version GIF version | ||
| Description: The opposite ring of the opposite ring is the original ring. Note the conditions on this theorem, which makes it unpractical in case we only have e.g. 𝑅 ∈ Ring as a premise. (Contributed by Thierry Arnoux, 9-Mar-2025.) |
| Ref | Expression |
|---|---|
| opprabs.o | ⊢ 𝑂 = (oppr‘𝑅) |
| opprabs.m | ⊢ · = (.r‘𝑅) |
| opprabs.1 | ⊢ (𝜑 → 𝑅 ∈ 𝑉) |
| opprabs.2 | ⊢ (𝜑 → Fun 𝑅) |
| opprabs.3 | ⊢ (𝜑 → (.r‘ndx) ∈ dom 𝑅) |
| opprabs.4 | ⊢ (𝜑 → · Fn (𝐵 × 𝐵)) |
| Ref | Expression |
|---|---|
| opprabs | ⊢ (𝜑 → 𝑅 = (oppr‘𝑂)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opprabs.4 | . . . . . 6 ⊢ (𝜑 → · Fn (𝐵 × 𝐵)) | |
| 2 | eqid 2761 | . . . . . . . . 9 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 3 | opprabs.m | . . . . . . . . 9 ⊢ · = (.r‘𝑅) | |
| 4 | opprabs.o | . . . . . . . . 9 ⊢ 𝑂 = (oppr‘𝑅) | |
| 5 | eqid 2761 | . . . . . . . . 9 ⊢ (.r‘𝑂) = (.r‘𝑂) | |
| 6 | 2, 3, 4, 5 | opprmulfval 20562 | . . . . . . . 8 ⊢ (.r‘𝑂) = tpos · |
| 7 | 6 | tposeqi 8269 | . . . . . . 7 ⊢ tpos (.r‘𝑂) = tpos tpos · |
| 8 | fnrel 6639 | . . . . . . . 8 ⊢ ( · Fn (𝐵 × 𝐵) → Rel · ) | |
| 9 | relxp 5669 | . . . . . . . . 9 ⊢ Rel (𝐵 × 𝐵) | |
| 10 | fndm 6640 | . . . . . . . . . 10 ⊢ ( · Fn (𝐵 × 𝐵) → dom · = (𝐵 × 𝐵)) | |
| 11 | 10 | releqd 5755 | . . . . . . . . 9 ⊢ ( · Fn (𝐵 × 𝐵) → (Rel dom · ↔ Rel (𝐵 × 𝐵))) |
| 12 | 9, 11 | mpbiri 261 | . . . . . . . 8 ⊢ ( · Fn (𝐵 × 𝐵) → Rel dom · ) |
| 13 | tpostpos2 8257 | . . . . . . . 8 ⊢ ((Rel · ∧ Rel dom · ) → tpos tpos · = · ) | |
| 14 | 8, 12, 13 | syl2anc 596 | . . . . . . 7 ⊢ ( · Fn (𝐵 × 𝐵) → tpos tpos · = · ) |
| 15 | 7, 14 | eqtrid 2808 | . . . . . 6 ⊢ ( · Fn (𝐵 × 𝐵) → tpos (.r‘𝑂) = · ) |
| 16 | 1, 15 | syl 18 | . . . . 5 ⊢ (𝜑 → tpos (.r‘𝑂) = · ) |
| 17 | 16, 3 | eqtrdi 2812 | . . . 4 ⊢ (𝜑 → tpos (.r‘𝑂) = (.r‘𝑅)) |
| 18 | 17 | opeq2d 4840 | . . 3 ⊢ (𝜑 → 〈(.r‘ndx), tpos (.r‘𝑂)〉 = 〈(.r‘ndx), (.r‘𝑅)〉) |
| 19 | 18 | oveq2d 7434 | . 2 ⊢ (𝜑 → (𝑅 sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉) = (𝑅 sSet 〈(.r‘ndx), (.r‘𝑅)〉)) |
| 20 | opprabs.1 | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑉) | |
| 21 | 4, 2 | opprbas 20566 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑂) |
| 22 | eqid 2761 | . . . . . 6 ⊢ (oppr‘𝑂) = (oppr‘𝑂) | |
| 23 | 21, 5, 22 | opprval 20561 | . . . . 5 ⊢ (oppr‘𝑂) = (𝑂 sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉) |
| 24 | 2, 3, 4 | opprval 20561 | . . . . . 6 ⊢ 𝑂 = (𝑅 sSet 〈(.r‘ndx), tpos · 〉) |
| 25 | 24 | oveq1i 7428 | . . . . 5 ⊢ (𝑂 sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉) = ((𝑅 sSet 〈(.r‘ndx), tpos · 〉) sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉) |
| 26 | 23, 25 | eqtri 2784 | . . . 4 ⊢ (oppr‘𝑂) = ((𝑅 sSet 〈(.r‘ndx), tpos · 〉) sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉) |
| 27 | fvex 6896 | . . . . . 6 ⊢ (.r‘𝑂) ∈ V | |
| 28 | 27 | tposex 8270 | . . . . 5 ⊢ tpos (.r‘𝑂) ∈ V |
| 29 | setsabs 17350 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ tpos (.r‘𝑂) ∈ V) → ((𝑅 sSet 〈(.r‘ndx), tpos · 〉) sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉) = (𝑅 sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉)) | |
| 30 | 28, 29 | mpan2 704 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → ((𝑅 sSet 〈(.r‘ndx), tpos · 〉) sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉) = (𝑅 sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉)) |
| 31 | 26, 30 | eqtrid 2808 | . . 3 ⊢ (𝑅 ∈ 𝑉 → (oppr‘𝑂) = (𝑅 sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉)) |
| 32 | 20, 31 | syl 18 | . 2 ⊢ (𝜑 → (oppr‘𝑂) = (𝑅 sSet 〈(.r‘ndx), tpos (.r‘𝑂)〉)) |
| 33 | mulridx 17459 | . . 3 ⊢ .r = Slot (.r‘ndx) | |
| 34 | opprabs.2 | . . 3 ⊢ (𝜑 → Fun 𝑅) | |
| 35 | opprabs.3 | . . 3 ⊢ (𝜑 → (.r‘ndx) ∈ dom 𝑅) | |
| 36 | 33, 20, 34, 35 | setsidvald 17370 | . 2 ⊢ (𝜑 → 𝑅 = (𝑅 sSet 〈(.r‘ndx), (.r‘𝑅)〉)) |
| 37 | 19, 32, 36 | 3eqtr4rd 2807 | 1 ⊢ (𝜑 → 𝑅 = (oppr‘𝑂)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3451 〈cop 4590 × cxp 5649 dom cdm 5651 Rel wrel 5656 Fun wfun 6531 Fn wfn 6532 ‘cfv 6537 (class class class)co 7418 tpos ctpos 8235 sSet csts 17334 ndxcnx 17364 Basecbs 17380 .rcmulr 17422 opprcoppr 20559 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-tpos 8236 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-3 12399 df-sets 17335 df-slot 17353 df-ndx 17365 df-base 17381 df-mulr 17435 df-oppr 20560 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |