| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opprdomnb | Structured version Visualization version GIF version | ||
| Description: A class is a domain if and only if its opposite is a domain, biconditional form of opprdomn 20653. (Contributed by SN, 15-Jun-2015.) |
| Ref | Expression |
|---|---|
| opprdomn.1 | ⊢ 𝑂 = (oppr‘𝑅) |
| Ref | Expression |
|---|---|
| opprdomnb | ⊢ (𝑅 ∈ Domn ↔ 𝑂 ∈ Domn) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opprdomn.1 | . . . 4 ⊢ 𝑂 = (oppr‘𝑅) | |
| 2 | 1 | opprnzrb 20456 | . . 3 ⊢ (𝑅 ∈ NzRing ↔ 𝑂 ∈ NzRing) |
| 3 | eqid 2735 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | 1, 3 | opprbas 20281 | . . . . 5 ⊢ (Base‘𝑅) = (Base‘𝑂) |
| 5 | eqid 2735 | . . . . . . . . . 10 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | eqid 2735 | . . . . . . . . . 10 ⊢ (.r‘𝑂) = (.r‘𝑂) | |
| 7 | 3, 5, 1, 6 | opprmul 20278 | . . . . . . . . 9 ⊢ (𝑦(.r‘𝑂)𝑥) = (𝑥(.r‘𝑅)𝑦) |
| 8 | 7 | eqcomi 2744 | . . . . . . . 8 ⊢ (𝑥(.r‘𝑅)𝑦) = (𝑦(.r‘𝑂)𝑥) |
| 9 | eqid 2735 | . . . . . . . . 9 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 10 | 1, 9 | oppr0 20287 | . . . . . . . 8 ⊢ (0g‘𝑅) = (0g‘𝑂) |
| 11 | 8, 10 | eqeq12i 2753 | . . . . . . 7 ⊢ ((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) ↔ (𝑦(.r‘𝑂)𝑥) = (0g‘𝑂)) |
| 12 | 10 | eqeq2i 2748 | . . . . . . . . 9 ⊢ (𝑥 = (0g‘𝑅) ↔ 𝑥 = (0g‘𝑂)) |
| 13 | 10 | eqeq2i 2748 | . . . . . . . . 9 ⊢ (𝑦 = (0g‘𝑅) ↔ 𝑦 = (0g‘𝑂)) |
| 14 | 12, 13 | orbi12i 915 | . . . . . . . 8 ⊢ ((𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅)) ↔ (𝑥 = (0g‘𝑂) ∨ 𝑦 = (0g‘𝑂))) |
| 15 | orcom 871 | . . . . . . . 8 ⊢ ((𝑥 = (0g‘𝑂) ∨ 𝑦 = (0g‘𝑂)) ↔ (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))) | |
| 16 | 14, 15 | bitri 275 | . . . . . . 7 ⊢ ((𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅)) ↔ (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))) |
| 17 | 11, 16 | imbi12i 350 | . . . . . 6 ⊢ (((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))) |
| 18 | 4, 17 | raleqbii 3313 | . . . . 5 ⊢ (∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ∀𝑦 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))) |
| 19 | 4, 18 | raleqbii 3313 | . . . 4 ⊢ (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ∀𝑥 ∈ (Base‘𝑂)∀𝑦 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))) |
| 20 | ralcom 3263 | . . . 4 ⊢ (∀𝑥 ∈ (Base‘𝑂)∀𝑦 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))) ↔ ∀𝑦 ∈ (Base‘𝑂)∀𝑥 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))) | |
| 21 | 19, 20 | bitri 275 | . . 3 ⊢ (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ∀𝑦 ∈ (Base‘𝑂)∀𝑥 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))) |
| 22 | 2, 21 | anbi12i 629 | . 2 ⊢ ((𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅)))) ↔ (𝑂 ∈ NzRing ∧ ∀𝑦 ∈ (Base‘𝑂)∀𝑥 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))))) |
| 23 | 3, 5, 9 | isdomn 20640 | . 2 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))))) |
| 24 | eqid 2735 | . . 3 ⊢ (Base‘𝑂) = (Base‘𝑂) | |
| 25 | eqid 2735 | . . 3 ⊢ (0g‘𝑂) = (0g‘𝑂) | |
| 26 | 24, 6, 25 | isdomn 20640 | . 2 ⊢ (𝑂 ∈ Domn ↔ (𝑂 ∈ NzRing ∧ ∀𝑦 ∈ (Base‘𝑂)∀𝑥 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))))) |
| 27 | 22, 23, 26 | 3bitr4i 303 | 1 ⊢ (𝑅 ∈ Domn ↔ 𝑂 ∈ Domn) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ∀wral 3050 ‘cfv 6491 (class class class)co 7358 Basecbs 17138 .rcmulr 17180 0gc0g 17361 opprcoppr 20274 NzRingcnzr 20447 Domncdomn 20627 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3349 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-tpos 8168 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12148 df-2 12210 df-3 12211 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17139 df-plusg 17192 df-mulr 17193 df-0g 17363 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-grp 18868 df-minusg 18869 df-cmn 19713 df-abl 19714 df-mgp 20078 df-rng 20090 df-ur 20119 df-ring 20172 df-oppr 20275 df-nzr 20448 df-domn 20630 |
| This theorem is referenced by: opprdomn 20653 isdomn4r 20654 |
| Copyright terms: Public domain | W3C validator |