Theorem opprdomnbg 14294

Description: A class is a domain if and only if its opposite is a domain, biconditional form of opprdomn 14295. (Contributed by SN, 15-Jun-2015.)

Hypothesis

Ref	Expression
opprdomn.1	⊢ 𝑂 = (oppr‘𝑅)

Assertion

Ref	Expression
opprdomnbg	⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ Domn ↔ 𝑂 ∈ Domn))

Proof of Theorem opprdomnbg

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opprdomn.1	. . . 4 ⊢ 𝑂 = (oppr‘𝑅)
2	1	opprnzrbg 14205	. . 3 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ NzRing ↔ 𝑂 ∈ NzRing))
3		eqid 2231	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
4	1, 3	opprbasg 14094	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → (Base‘𝑅) = (Base‘𝑂))
5		vex 2805	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
6		vex 2805	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
7		eqid 2231	. . . . . . . . . . 11 ⊢ (.r‘𝑅) = (.r‘𝑅)
8		eqid 2231	. . . . . . . . . . 11 ⊢ (.r‘𝑂) = (.r‘𝑂)
9	3, 7, 1, 8	opprmulg 14090	. . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑦 ∈ V ∧ 𝑥 ∈ V) → (𝑦(.r‘𝑂)𝑥) = (𝑥(.r‘𝑅)𝑦))
10	5, 6, 9	mp3an23 1365	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → (𝑦(.r‘𝑂)𝑥) = (𝑥(.r‘𝑅)𝑦))
11	10	eqcomd 2237	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → (𝑥(.r‘𝑅)𝑦) = (𝑦(.r‘𝑂)𝑥))
12		eqid 2231	. . . . . . . . 9 ⊢ (0g‘𝑅) = (0g‘𝑅)
13	1, 12	oppr0g 14100	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → (0g‘𝑅) = (0g‘𝑂))
14	11, 13	eqeq12d 2246	. . . . . . 7 ⊢ (𝑅 ∈ 𝑉 → ((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) ↔ (𝑦(.r‘𝑂)𝑥) = (0g‘𝑂)))
15	13	eqeq2d 2243	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → (𝑥 = (0g‘𝑅) ↔ 𝑥 = (0g‘𝑂)))
16	13	eqeq2d 2243	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → (𝑦 = (0g‘𝑅) ↔ 𝑦 = (0g‘𝑂)))
17	15, 16	orbi12d 800	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → ((𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅)) ↔ (𝑥 = (0g‘𝑂) ∨ 𝑦 = (0g‘𝑂))))
18		orcom 735	. . . . . . . 8 ⊢ ((𝑥 = (0g‘𝑂) ∨ 𝑦 = (0g‘𝑂)) ↔ (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))
19	17, 18	bitrdi 196	. . . . . . 7 ⊢ (𝑅 ∈ 𝑉 → ((𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅)) ↔ (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))))
20	14, 19	imbi12d 234	. . . . . 6 ⊢ (𝑅 ∈ 𝑉 → (((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))))
21	4, 20	raleqbidv 2746	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → (∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ∀𝑦 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))))
22	4, 21	raleqbidv 2746	. . . 4 ⊢ (𝑅 ∈ 𝑉 → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ∀𝑥 ∈ (Base‘𝑂)∀𝑦 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))))
23		ralcom 2696	. . . 4 ⊢ (∀𝑥 ∈ (Base‘𝑂)∀𝑦 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))) ↔ ∀𝑦 ∈ (Base‘𝑂)∀𝑥 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))))
24	22, 23	bitrdi 196	. . 3 ⊢ (𝑅 ∈ 𝑉 → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅))) ↔ ∀𝑦 ∈ (Base‘𝑂)∀𝑥 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))))
25	2, 24	anbi12d 473	. 2 ⊢ (𝑅 ∈ 𝑉 → ((𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅)))) ↔ (𝑂 ∈ NzRing ∧ ∀𝑦 ∈ (Base‘𝑂)∀𝑥 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂))))))
26	3, 7, 12	isdomn 14289	. 2 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = (0g‘𝑅) → (𝑥 = (0g‘𝑅) ∨ 𝑦 = (0g‘𝑅)))))
27		eqid 2231	. . 3 ⊢ (Base‘𝑂) = (Base‘𝑂)
28		eqid 2231	. . 3 ⊢ (0g‘𝑂) = (0g‘𝑂)
29	27, 8, 28	isdomn 14289	. 2 ⊢ (𝑂 ∈ Domn ↔ (𝑂 ∈ NzRing ∧ ∀𝑦 ∈ (Base‘𝑂)∀𝑥 ∈ (Base‘𝑂)((𝑦(.r‘𝑂)𝑥) = (0g‘𝑂) → (𝑦 = (0g‘𝑂) ∨ 𝑥 = (0g‘𝑂)))))
30	25, 26, 29	3bitr4g 223	1 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∈ Domn ↔ 𝑂 ∈ Domn))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 715   = wceq 1397   ∈ wcel 2202  ∀wral 2510  Vcvv 2802  ‘cfv 5326  (class class class)co 6018  Basecbs 13087  ._rcmulr 13166  0_gc0g 13344  opp_rcoppr 14086  NzRingcnzr 14199  Domncdomn 14276

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-lttrn 8146  ax-pre-ltadd 8148

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-tpos 6411  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-plusg 13178  df-mulr 13179  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591  df-mgp 13940  df-ur 13979  df-ring 14017  df-oppr 14087  df-nzr 14200  df-domn 14279

This theorem is referenced by:  opprdomn  14295