fidomndrnglem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fidomndrnglem		Structured version Visualization version GIF version

Theorem fidomndrnglem 20917

Description: Lemma for fidomndrng 20918. (Contributed by Mario Carneiro, 15-Jun-2015.)

**Hypotheses**
Ref	Expression
fidomndrng.b	⊢ 𝐵 = (Base‘𝑅)
fidomndrng.z	⊢ 0 = (0_g‘𝑅)
fidomndrng.o	⊢ 1 = (1_r‘𝑅)
fidomndrng.d	⊢ ∥ = (∥_r‘𝑅)
fidomndrng.t	⊢ · = (._r‘𝑅)
fidomndrng.r	⊢ (𝜑 → 𝑅 ∈ Domn)
fidomndrng.x	⊢ (𝜑 → 𝐵 ∈ Fin)
fidomndrng.a	⊢ (𝜑 → 𝐴 ∈ (𝐵 ∖ { 0 }))
fidomndrng.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴))

**Assertion**
Ref	Expression
fidomndrnglem	⊢ (𝜑 → 𝐴 ∥ 1 )

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝑥,𝑅 𝑥, · Allowed substitution hints: 𝜑(𝑥) ∥ (𝑥) 1 (𝑥) 𝐹(𝑥) 0 (𝑥)

Proof of Theorem fidomndrnglem Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fidomndrng.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝐵 ∖ { 0 }))
2	1	eldifad 3959	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
3		eldifsni 4792	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ (𝐵 ∖ { 0 }) → 𝐴 ≠ 0 )
4	1, 3	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ≠ 0 )
5	4	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → 𝐴 ≠ 0 )
6		oveq1 7412	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → (𝑥 · 𝐴) = (𝑦 · 𝐴))
7		fidomndrng.f	. . . . . . . . . . . . . . . . 17 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴))
8		ovex 7438	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 · 𝐴) ∈ V
9	6, 7, 8	fvmpt 6995	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ 𝐵 → (𝐹‘𝑦) = (𝑦 · 𝐴))
10	9	adantl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑦) = (𝑦 · 𝐴))
11	10	eqeq1d 2734	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝐹‘𝑦) = 0 ↔ (𝑦 · 𝐴) = 0 ))
12		fidomndrng.r	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑅 ∈ Domn)
13	12	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑅 ∈ Domn)
14		simpr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
15	2	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐴 ∈ 𝐵)
16		fidomndrng.b	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 = (Base‘𝑅)
17		fidomndrng.t	. . . . . . . . . . . . . . . 16 ⊢ · = (._r‘𝑅)
18		fidomndrng.z	. . . . . . . . . . . . . . . 16 ⊢ 0 = (0_g‘𝑅)
19	16, 17, 18	domneq0 20905	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ Domn ∧ 𝑦 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵) → ((𝑦 · 𝐴) = 0 ↔ (𝑦 = 0 ∨ 𝐴 = 0 )))
20	13, 14, 15, 19	syl3anc 1371	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝑦 · 𝐴) = 0 ↔ (𝑦 = 0 ∨ 𝐴 = 0 )))
21	11, 20	bitrd 278	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝐹‘𝑦) = 0 ↔ (𝑦 = 0 ∨ 𝐴 = 0 )))
22	21	biimpa 477	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → (𝑦 = 0 ∨ 𝐴 = 0 ))
23	22	ord 862	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → (¬ 𝑦 = 0 → 𝐴 = 0 ))
24	23	necon1ad 2957	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → (𝐴 ≠ 0 → 𝑦 = 0 ))
25	5, 24	mpd 15	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → 𝑦 = 0 )
26	25	ex 413	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝐹‘𝑦) = 0 → 𝑦 = 0 ))
27	26	ralrimiva 3146	. . . . . . 7 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 0 → 𝑦 = 0 ))
28		domnring 20904	. . . . . . . . . . 11 ⊢ (𝑅 ∈ Domn → 𝑅 ∈ Ring)
29	12, 28	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ Ring)
30	16, 17	ringrghm 20118	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴)) ∈ (𝑅 GrpHom 𝑅))
31	29, 2, 30	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴)) ∈ (𝑅 GrpHom 𝑅))
32	7, 31	eqeltrid 2837	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑅))
33	16, 16, 18, 18	ghmf1 19115	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑅) → (𝐹:𝐵–1-1→𝐵 ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 0 → 𝑦 = 0 )))
34	32, 33	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝐹:𝐵–1-1→𝐵 ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 0 → 𝑦 = 0 )))
35	27, 34	mpbird 256	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐵–1-1→𝐵)
36		fidomndrng.x	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ Fin)
37		enrefg 8976	. . . . . . . 8 ⊢ (𝐵 ∈ Fin → 𝐵 ≈ 𝐵)
38	36, 37	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐵 ≈ 𝐵)
39		f1finf1o 9267	. . . . . . 7 ⊢ ((𝐵 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → (𝐹:𝐵–1-1→𝐵 ↔ 𝐹:𝐵–1-1-onto→𝐵))
40	38, 36, 39	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝐹:𝐵–1-1→𝐵 ↔ 𝐹:𝐵–1-1-onto→𝐵))
41	35, 40	mpbid 231	. . . . 5 ⊢ (𝜑 → 𝐹:𝐵–1-1-onto→𝐵)
42		f1ocnv 6842	. . . . 5 ⊢ (𝐹:𝐵–1-1-onto→𝐵 → ^◡𝐹:𝐵–1-1-onto→𝐵)
43		f1of 6830	. . . . 5 ⊢ (^◡𝐹:𝐵–1-1-onto→𝐵 → ^◡𝐹:𝐵⟶𝐵)
44	41, 42, 43	3syl 18	. . . 4 ⊢ (𝜑 → ^◡𝐹:𝐵⟶𝐵)
45		fidomndrng.o	. . . . . 6 ⊢ 1 = (1_r‘𝑅)
46	16, 45	ringidcl 20076	. . . . 5 ⊢ (𝑅 ∈ Ring → 1 ∈ 𝐵)
47	29, 46	syl 17	. . . 4 ⊢ (𝜑 → 1 ∈ 𝐵)
48	44, 47	ffvelcdmd 7084	. . 3 ⊢ (𝜑 → (^◡𝐹‘ 1 ) ∈ 𝐵)
49		fidomndrng.d	. . . 4 ⊢ ∥ = (∥_r‘𝑅)
50	16, 49, 17	dvdsrmul 20170	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ (^◡𝐹‘ 1 ) ∈ 𝐵) → 𝐴 ∥ ((^◡𝐹‘ 1 ) · 𝐴))
51	2, 48, 50	syl2anc 584	. 2 ⊢ (𝜑 → 𝐴 ∥ ((^◡𝐹‘ 1 ) · 𝐴))
52		oveq1 7412	. . . . 5 ⊢ (𝑦 = (^◡𝐹‘ 1 ) → (𝑦 · 𝐴) = ((^◡𝐹‘ 1 ) · 𝐴))
53	6	cbvmptv 5260	. . . . . 6 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴)) = (𝑦 ∈ 𝐵 ↦ (𝑦 · 𝐴))
54	7, 53	eqtri 2760	. . . . 5 ⊢ 𝐹 = (𝑦 ∈ 𝐵 ↦ (𝑦 · 𝐴))
55		ovex 7438	. . . . 5 ⊢ ((^◡𝐹‘ 1 ) · 𝐴) ∈ V
56	52, 54, 55	fvmpt 6995	. . . 4 ⊢ ((^◡𝐹‘ 1 ) ∈ 𝐵 → (𝐹‘(^◡𝐹‘ 1 )) = ((^◡𝐹‘ 1 ) · 𝐴))
57	48, 56	syl 17	. . 3 ⊢ (𝜑 → (𝐹‘(^◡𝐹‘ 1 )) = ((^◡𝐹‘ 1 ) · 𝐴))
58		f1ocnvfv2 7271	. . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 1 ∈ 𝐵) → (𝐹‘(^◡𝐹‘ 1 )) = 1 )
59	41, 47, 58	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐹‘(^◡𝐹‘ 1 )) = 1 )
60	57, 59	eqtr3d 2774	. 2 ⊢ (𝜑 → ((^◡𝐹‘ 1 ) · 𝐴) = 1 )
61	51, 60	breqtrd 5173	1 ⊢ (𝜑 → 𝐴 ∥ 1 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∖ cdif 3944 {csn 4627 class class class wbr 5147 ↦ cmpt 5230 ^◡ccnv 5674 ⟶wf 6536 –1-1→wf1 6537 –1-1-onto→wf1o 6539 ‘cfv 6540 (class class class)co 7405 ≈ cen 8932 Fincfn 8935 Basecbs 17140 ._rcmulr 17194 0_gc0g 17381 GrpHom cghm 19083 1_rcur 19998 Ringcrg 20049 ∥_rcdsr 20160 Domncdomn 20888

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-plusg 17206 df-0g 17383 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-grp 18818 df-minusg 18819 df-sbg 18820 df-ghm 19084 df-mgp 19982 df-ur 19999 df-ring 20051 df-dvdsr 20163 df-nzr 20284 df-domn 20892

This theorem is referenced by: fidomndrng 20918

W3C validator