| 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 20668. (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 20471 | . . 3 ⊢ (𝑅 ∈ NzRing ↔ 𝑂 ∈ NzRing) |
| 3 | eqid 2737 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | 1, 3 | opprbas 20296 | . . . . 5 ⊢ (Base‘𝑅) = (Base‘𝑂) |
| 5 | eqid 2737 | . . . . . . . . . 10 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | eqid 2737 | . . . . . . . . . 10 ⊢ (.r‘𝑂) = (.r‘𝑂) | |
| 7 | 3, 5, 1, 6 | opprmul 20293 | . . . . . . . . 9 ⊢ (𝑦(.r‘𝑂)𝑥) = (𝑥(.r‘𝑅)𝑦) |
| 8 | 7 | eqcomi 2746 | . . . . . . . 8 ⊢ (𝑥(.r‘𝑅)𝑦) = (𝑦(.r‘𝑂)𝑥) |
| 9 | eqid 2737 | . . . . . . . . 9 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 10 | 1, 9 | oppr0 20302 | . . . . . . . 8 ⊢ (0g‘𝑅) = (0g‘𝑂) |
| 11 | 8, 10 | eqeq12i 2755 | . . . . . . 7 ⊢ ((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) ↔ (𝑦(.r‘𝑂)𝑥) = (0g‘𝑂)) |
| 12 | 10 | eqeq2i 2750 | . . . . . . . . 9 ⊢ (𝑥 = (0g‘𝑅) ↔ 𝑥 = (0g‘𝑂)) |
| 13 | 10 | eqeq2i 2750 | . . . . . . . . 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 3316 | . . . . 5 ⊢ (∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ∀𝑦 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))) |
| 19 | 4, 18 | raleqbii 3316 | . . . 4 ⊢ (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ∀𝑥 ∈ (Base‘𝑂)∀𝑦 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))) |
| 20 | ralcom 3266 | . . . 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 20655 | . 2 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))))) |
| 24 | eqid 2737 | . . 3 ⊢ (Base‘𝑂) = (Base‘𝑂) | |
| 25 | eqid 2737 | . . 3 ⊢ (0g‘𝑂) = (0g‘𝑂) | |
| 26 | 24, 6, 25 | isdomn 20655 | . 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 3052 ‘cfv 6502 (class class class)co 7370 Basecbs 17150 .rcmulr 17192 0gc0g 17373 opprcoppr 20289 NzRingcnzr 20462 Domncdomn 20642 |
| 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 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-2nd 7946 df-tpos 8180 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-3 12223 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-plusg 17204 df-mulr 17205 df-0g 17375 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-grp 18883 df-minusg 18884 df-cmn 19728 df-abl 19729 df-mgp 20093 df-rng 20105 df-ur 20134 df-ring 20187 df-oppr 20290 df-nzr 20463 df-domn 20645 |
| This theorem is referenced by: opprdomn 20668 isdomn4r 20669 |
| Copyright terms: Public domain | W3C validator |