Theorem zerdivemp1x 38849

Description: Obsolete theorem, use ringinvnzdiv 20512 instead. In a unital ring a left invertible element is not a zero divisor. See also ringinvnzdiv 20512. (Contributed by Jeff Madsen, 18-Apr-2010.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
zerdivempx.1	⊢ 𝐺 = (1st ‘𝑅)
zerdivempx.2	⊢ 𝐻 = (2nd ‘𝑅)
zerdivempx.3	⊢ 𝑍 = (GId‘𝐺)
zerdivempx.4	⊢ 𝑋 = ran 𝐺
zerdivempx.5	⊢ 𝑈 = (GId‘𝐻)

Assertion

Ref	Expression
zerdivemp1x	⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ ∃𝑎 ∈ 𝑋 (𝑎𝐻𝐴) = 𝑈) → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵) = 𝑍 → 𝐵 = 𝑍)))

Distinct variable groups:   𝐴,𝑎   𝐵,𝑎   𝐻,𝑎   𝑅,𝑎   𝑋,𝑎   𝑍,𝑎

Allowed substitution hints:   𝑈(𝑎)   𝐺(𝑎)

Proof of Theorem zerdivemp1x

Step	Hyp	Ref	Expression
1		oveq2 7420	. . . . . . 7 ⊢ ((𝐴𝐻𝐵) = 𝑍 → (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍))
2		simpl1 1210	. . . . . . . . . 10 ⊢ (((𝑅 ∈ RingOps ∧ (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) ∧ 𝐵 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋)) → 𝑅 ∈ RingOps)
3		simpr1 1213	. . . . . . . . . 10 ⊢ (((𝑅 ∈ RingOps ∧ (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) ∧ 𝐵 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋)) → 𝑎 ∈ 𝑋)
4		simpr3 1215	. . . . . . . . . 10 ⊢ (((𝑅 ∈ RingOps ∧ (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) ∧ 𝐵 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
5		simpl3 1212	. . . . . . . . . 10 ⊢ (((𝑅 ∈ RingOps ∧ (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) ∧ 𝐵 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋)) → 𝐵 ∈ 𝑋)
6		zerdivempx.1	. . . . . . . . . . 11 ⊢ 𝐺 = (1st ‘𝑅)
7		zerdivempx.2	. . . . . . . . . . 11 ⊢ 𝐻 = (2nd ‘𝑅)
8		zerdivempx.4	. . . . . . . . . . 11 ⊢ 𝑋 = ran 𝐺
9	6, 7, 8	rngoass 38808	. . . . . . . . . 10 ⊢ ((𝑅 ∈ RingOps ∧ (𝑎 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻(𝐴𝐻𝐵)))
10	2, 3, 4, 5, 9	syl13anc 1399	. . . . . . . . 9 ⊢ (((𝑅 ∈ RingOps ∧ (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) ∧ 𝐵 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋)) → ((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻(𝐴𝐻𝐵)))
11		eqtr 2781	. . . . . . . . . . . . 13 ⊢ ((((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻(𝐴𝐻𝐵)) ∧ (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍)) → ((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍))
12	11	ex 418	. . . . . . . . . . . 12 ⊢ (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻(𝐴𝐻𝐵)) → ((𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) → ((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍)))
13		eqtr 2781	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑈𝐻𝐵) = ((𝑎𝐻𝐴)𝐻𝐵) ∧ ((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍)) → (𝑈𝐻𝐵) = (𝑎𝐻𝑍))
14		zerdivempx.3	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 𝑍 = (GId‘𝐺)
15	14, 8, 6, 7	rngorz 38825	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑅 ∈ RingOps ∧ 𝑎 ∈ 𝑋) → (𝑎𝐻𝑍) = 𝑍)
16	15	3adant3 1150	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑅 ∈ RingOps ∧ 𝑎 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑎𝐻𝑍) = 𝑍)
17	6	rneqi 5919	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ran 𝐺 = ran (1st ‘𝑅)
18	8, 17	eqtri 2784	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 𝑋 = ran (1st ‘𝑅)
19		zerdivempx.5	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 𝑈 = (GId‘𝐻)
20	7, 18, 19	rngolidm 38839	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑅 ∈ RingOps ∧ 𝐵 ∈ 𝑋) → (𝑈𝐻𝐵) = 𝐵)
21	20	3adant2 1149	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑅 ∈ RingOps ∧ 𝑎 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑈𝐻𝐵) = 𝐵)
22		simp1 1154	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝑈𝐻𝐵) = (𝑎𝐻𝑍) ∧ (𝑈𝐻𝐵) = 𝐵 ∧ (𝑎𝐻𝑍) = 𝑍) → (𝑈𝐻𝐵) = (𝑎𝐻𝑍))
23		simp2 1155	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝑈𝐻𝐵) = (𝑎𝐻𝑍) ∧ (𝑈𝐻𝐵) = 𝐵 ∧ (𝑎𝐻𝑍) = 𝑍) → (𝑈𝐻𝐵) = 𝐵)
24		simp3 1156	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝑈𝐻𝐵) = (𝑎𝐻𝑍) ∧ (𝑈𝐻𝐵) = 𝐵 ∧ (𝑎𝐻𝑍) = 𝑍) → (𝑎𝐻𝑍) = 𝑍)
25	22, 23, 24	3eqtr3d 2804	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝑈𝐻𝐵) = (𝑎𝐻𝑍) ∧ (𝑈𝐻𝐵) = 𝐵 ∧ (𝑎𝐻𝑍) = 𝑍) → 𝐵 = 𝑍)
26	25	a1d 26	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝑈𝐻𝐵) = (𝑎𝐻𝑍) ∧ (𝑈𝐻𝐵) = 𝐵 ∧ (𝑎𝐻𝑍) = 𝑍) → (𝐴 ∈ 𝑋 → 𝐵 = 𝑍))
27	26	3exp 1137	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑈𝐻𝐵) = (𝑎𝐻𝑍) → ((𝑈𝐻𝐵) = 𝐵 → ((𝑎𝐻𝑍) = 𝑍 → (𝐴 ∈ 𝑋 → 𝐵 = 𝑍))))
28	27	com14 97	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐴 ∈ 𝑋 → ((𝑈𝐻𝐵) = 𝐵 → ((𝑎𝐻𝑍) = 𝑍 → ((𝑈𝐻𝐵) = (𝑎𝐻𝑍) → 𝐵 = 𝑍))))
29	28	com13 89	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑎𝐻𝑍) = 𝑍 → ((𝑈𝐻𝐵) = 𝐵 → (𝐴 ∈ 𝑋 → ((𝑈𝐻𝐵) = (𝑎𝐻𝑍) → 𝐵 = 𝑍))))
30	16, 21, 29	sylc 66	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑅 ∈ RingOps ∧ 𝑎 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ∈ 𝑋 → ((𝑈𝐻𝐵) = (𝑎𝐻𝑍) → 𝐵 = 𝑍)))
31	30	3exp 1137	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑅 ∈ RingOps → (𝑎 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝐴 ∈ 𝑋 → ((𝑈𝐻𝐵) = (𝑎𝐻𝑍) → 𝐵 = 𝑍)))))
32	31	com15 102	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑈𝐻𝐵) = (𝑎𝐻𝑍) → (𝑎 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝐴 ∈ 𝑋 → (𝑅 ∈ RingOps → 𝐵 = 𝑍)))))
33	32	com24 96	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑈𝐻𝐵) = (𝑎𝐻𝑍) → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝑎 ∈ 𝑋 → (𝑅 ∈ RingOps → 𝐵 = 𝑍)))))
34	13, 33	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑈𝐻𝐵) = ((𝑎𝐻𝐴)𝐻𝐵) ∧ ((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍)) → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝑎 ∈ 𝑋 → (𝑅 ∈ RingOps → 𝐵 = 𝑍)))))
35	34	ex 418	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑈𝐻𝐵) = ((𝑎𝐻𝐴)𝐻𝐵) → (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍) → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝑎 ∈ 𝑋 → (𝑅 ∈ RingOps → 𝐵 = 𝑍))))))
36	35	eqcoms 2769	. . . . . . . . . . . . . . . 16 ⊢ (((𝑎𝐻𝐴)𝐻𝐵) = (𝑈𝐻𝐵) → (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍) → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝑎 ∈ 𝑋 → (𝑅 ∈ RingOps → 𝐵 = 𝑍))))))
37	36	com25 100	. . . . . . . . . . . . . . 15 ⊢ (((𝑎𝐻𝐴)𝐻𝐵) = (𝑈𝐻𝐵) → (𝑎 ∈ 𝑋 → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍) → (𝑅 ∈ RingOps → 𝐵 = 𝑍))))))
38		oveq1 7419	. . . . . . . . . . . . . . 15 ⊢ ((𝑎𝐻𝐴) = 𝑈 → ((𝑎𝐻𝐴)𝐻𝐵) = (𝑈𝐻𝐵))
39	37, 38	syl11 34	. . . . . . . . . . . . . 14 ⊢ (𝑎 ∈ 𝑋 → ((𝑎𝐻𝐴) = 𝑈 → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍) → (𝑅 ∈ RingOps → 𝐵 = 𝑍))))))
40	39	3imp 1128	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋) → (𝐵 ∈ 𝑋 → (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍) → (𝑅 ∈ RingOps → 𝐵 = 𝑍))))
41	40	com13 89	. . . . . . . . . . . 12 ⊢ (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻𝑍) → (𝐵 ∈ 𝑋 → ((𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋) → (𝑅 ∈ RingOps → 𝐵 = 𝑍))))
42	12, 41	syl6 36	. . . . . . . . . . 11 ⊢ (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻(𝐴𝐻𝐵)) → ((𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) → (𝐵 ∈ 𝑋 → ((𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋) → (𝑅 ∈ RingOps → 𝐵 = 𝑍)))))
43	42	com15 102	. . . . . . . . . 10 ⊢ (𝑅 ∈ RingOps → ((𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) → (𝐵 ∈ 𝑋 → ((𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋) → (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻(𝐴𝐻𝐵)) → 𝐵 = 𝑍)))))
44	43	3imp1 1366	. . . . . . . . 9 ⊢ (((𝑅 ∈ RingOps ∧ (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) ∧ 𝐵 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋)) → (((𝑎𝐻𝐴)𝐻𝐵) = (𝑎𝐻(𝐴𝐻𝐵)) → 𝐵 = 𝑍))
45	10, 44	mpd 16	. . . . . . . 8 ⊢ (((𝑅 ∈ RingOps ∧ (𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) ∧ 𝐵 ∈ 𝑋) ∧ (𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋)) → 𝐵 = 𝑍)
46	45	3exp1 1371	. . . . . . 7 ⊢ (𝑅 ∈ RingOps → ((𝑎𝐻(𝐴𝐻𝐵)) = (𝑎𝐻𝑍) → (𝐵 ∈ 𝑋 → ((𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋) → 𝐵 = 𝑍))))
47	1, 46	syl5com 32	. . . . . 6 ⊢ ((𝐴𝐻𝐵) = 𝑍 → (𝑅 ∈ RingOps → (𝐵 ∈ 𝑋 → ((𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋) → 𝐵 = 𝑍))))
48	47	com14 97	. . . . 5 ⊢ ((𝑎 ∈ 𝑋 ∧ (𝑎𝐻𝐴) = 𝑈 ∧ 𝐴 ∈ 𝑋) → (𝑅 ∈ RingOps → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵) = 𝑍 → 𝐵 = 𝑍))))
49	48	3exp 1137	. . . 4 ⊢ (𝑎 ∈ 𝑋 → ((𝑎𝐻𝐴) = 𝑈 → (𝐴 ∈ 𝑋 → (𝑅 ∈ RingOps → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵) = 𝑍 → 𝐵 = 𝑍))))))
50	49	rexlimiv 3157	. . 3 ⊢ (∃𝑎 ∈ 𝑋 (𝑎𝐻𝐴) = 𝑈 → (𝐴 ∈ 𝑋 → (𝑅 ∈ RingOps → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵) = 𝑍 → 𝐵 = 𝑍)))))
51	50	com13 89	. 2 ⊢ (𝑅 ∈ RingOps → (𝐴 ∈ 𝑋 → (∃𝑎 ∈ 𝑋 (𝑎𝐻𝐴) = 𝑈 → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵) = 𝑍 → 𝐵 = 𝑍)))))
52	51	3imp 1128	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ ∃𝑎 ∈ 𝑋 (𝑎𝐻𝐴) = 𝑈) → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵) = 𝑍 → 𝐵 = 𝑍)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  ran crn 5652  ‘cfv 6531  (class class class)co 7412  1^st c1st 7988  2^nd c2nd 7989  GIdcgi 31074  RingOpscrngo 38796

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-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3078  df-rex 3088  df-rmo 3366  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-nul 4280  df-if 4483  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-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fo 6537  df-fv 6539  df-riota 7369  df-ov 7415  df-1st 7990  df-2nd 7991  df-grpo 31077  df-gid 31078  df-ablo 31129  df-ass 38745  df-exid 38747  df-mgmOLD 38751  df-sgrOLD 38763  df-mndo 38769  df-rngo 38797

This theorem is used by:  isdrngo2  38860