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 21247

Description: Lemma for fidomndrng 21248. (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 3956	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
3		eldifsni 4789	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ (𝐵 ∖ { 0 }) → 𝐴 ≠ 0 )
4	1, 3	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ≠ 0 )
5	4	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → 𝐴 ≠ 0 )
6		oveq1 7421	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → (𝑥 · 𝐴) = (𝑦 · 𝐴))
7		fidomndrng.f	. . . . . . . . . . . . . . . . 17 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴))
8		ovex 7447	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 · 𝐴) ∈ V
9	6, 7, 8	fvmpt 6999	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ 𝐵 → (𝐹‘𝑦) = (𝑦 · 𝐴))
10	9	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑦) = (𝑦 · 𝐴))
11	10	eqeq1d 2729	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝐹‘𝑦) = 0 ↔ (𝑦 · 𝐴) = 0 ))
12		fidomndrng.r	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑅 ∈ Domn)
13	12	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑅 ∈ Domn)
14		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
15	2	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐴 ∈ 𝐵)
16		fidomndrng.b	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 = (Base‘𝑅)
17		fidomndrng.t	. . . . . . . . . . . . . . . 16 ⊢ · = (._r‘𝑅)
18		fidomndrng.z	. . . . . . . . . . . . . . . 16 ⊢ 0 = (0_g‘𝑅)
19	16, 17, 18	domneq0 21233	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ Domn ∧ 𝑦 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵) → ((𝑦 · 𝐴) = 0 ↔ (𝑦 = 0 ∨ 𝐴 = 0 )))
20	13, 14, 15, 19	syl3anc 1369	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝑦 · 𝐴) = 0 ↔ (𝑦 = 0 ∨ 𝐴 = 0 )))
21	11, 20	bitrd 279	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝐹‘𝑦) = 0 ↔ (𝑦 = 0 ∨ 𝐴 = 0 )))
22	21	biimpa 476	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → (𝑦 = 0 ∨ 𝐴 = 0 ))
23	22	ord 863	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → (¬ 𝑦 = 0 → 𝐴 = 0 ))
24	23	necon1ad 2952	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → (𝐴 ≠ 0 → 𝑦 = 0 ))
25	5, 24	mpd 15	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ (𝐹‘𝑦) = 0 ) → 𝑦 = 0 )
26	25	ex 412	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝐹‘𝑦) = 0 → 𝑦 = 0 ))
27	26	ralrimiva 3141	. . . . . . 7 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 0 → 𝑦 = 0 ))
28		domnring 21232	. . . . . . . . . . 11 ⊢ (𝑅 ∈ Domn → 𝑅 ∈ Ring)
29	12, 28	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ Ring)
30	16, 17	ringrghm 20238	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝐴 ∈ 𝐵) → (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴)) ∈ (𝑅 GrpHom 𝑅))
31	29, 2, 30	syl2anc 583	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴)) ∈ (𝑅 GrpHom 𝑅))
32	7, 31	eqeltrid 2832	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑅))
33	16, 16, 18, 18	ghmf1 19191	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑅) → (𝐹:𝐵–1-1→𝐵 ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 0 → 𝑦 = 0 )))
34	32, 33	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝐹:𝐵–1-1→𝐵 ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 0 → 𝑦 = 0 )))
35	27, 34	mpbird 257	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐵–1-1→𝐵)
36		fidomndrng.x	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ Fin)
37		enreffi 9202	. . . . . . . 8 ⊢ (𝐵 ∈ Fin → 𝐵 ≈ 𝐵)
38	36, 37	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐵 ≈ 𝐵)
39		f1finf1o 9287	. . . . . . 7 ⊢ ((𝐵 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → (𝐹:𝐵–1-1→𝐵 ↔ 𝐹:𝐵–1-1-onto→𝐵))
40	38, 36, 39	syl2anc 583	. . . . . 6 ⊢ (𝜑 → (𝐹:𝐵–1-1→𝐵 ↔ 𝐹:𝐵–1-1-onto→𝐵))
41	35, 40	mpbid 231	. . . . 5 ⊢ (𝜑 → 𝐹:𝐵–1-1-onto→𝐵)
42		f1ocnv 6845	. . . . 5 ⊢ (𝐹:𝐵–1-1-onto→𝐵 → ^◡𝐹:𝐵–1-1-onto→𝐵)
43		f1of 6833	. . . . 5 ⊢ (^◡𝐹:𝐵–1-1-onto→𝐵 → ^◡𝐹:𝐵⟶𝐵)
44	41, 42, 43	3syl 18	. . . 4 ⊢ (𝜑 → ^◡𝐹:𝐵⟶𝐵)
45		fidomndrng.o	. . . . . 6 ⊢ 1 = (1_r‘𝑅)
46	16, 45	ringidcl 20191	. . . . 5 ⊢ (𝑅 ∈ Ring → 1 ∈ 𝐵)
47	29, 46	syl 17	. . . 4 ⊢ (𝜑 → 1 ∈ 𝐵)
48	44, 47	ffvelcdmd 7089	. . 3 ⊢ (𝜑 → (^◡𝐹‘ 1 ) ∈ 𝐵)
49		fidomndrng.d	. . . 4 ⊢ ∥ = (∥_r‘𝑅)
50	16, 49, 17	dvdsrmul 20292	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ (^◡𝐹‘ 1 ) ∈ 𝐵) → 𝐴 ∥ ((^◡𝐹‘ 1 ) · 𝐴))
51	2, 48, 50	syl2anc 583	. 2 ⊢ (𝜑 → 𝐴 ∥ ((^◡𝐹‘ 1 ) · 𝐴))
52		oveq1 7421	. . . . 5 ⊢ (𝑦 = (^◡𝐹‘ 1 ) → (𝑦 · 𝐴) = ((^◡𝐹‘ 1 ) · 𝐴))
53	6	cbvmptv 5255	. . . . . 6 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑥 · 𝐴)) = (𝑦 ∈ 𝐵 ↦ (𝑦 · 𝐴))
54	7, 53	eqtri 2755	. . . . 5 ⊢ 𝐹 = (𝑦 ∈ 𝐵 ↦ (𝑦 · 𝐴))
55		ovex 7447	. . . . 5 ⊢ ((^◡𝐹‘ 1 ) · 𝐴) ∈ V
56	52, 54, 55	fvmpt 6999	. . . 4 ⊢ ((^◡𝐹‘ 1 ) ∈ 𝐵 → (𝐹‘(^◡𝐹‘ 1 )) = ((^◡𝐹‘ 1 ) · 𝐴))
57	48, 56	syl 17	. . 3 ⊢ (𝜑 → (𝐹‘(^◡𝐹‘ 1 )) = ((^◡𝐹‘ 1 ) · 𝐴))
58		f1ocnvfv2 7280	. . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 1 ∈ 𝐵) → (𝐹‘(^◡𝐹‘ 1 )) = 1 )
59	41, 47, 58	syl2anc 583	. . 3 ⊢ (𝜑 → (𝐹‘(^◡𝐹‘ 1 )) = 1 )
60	57, 59	eqtr3d 2769	. 2 ⊢ (𝜑 → ((^◡𝐹‘ 1 ) · 𝐴) = 1 )
61	51, 60	breqtrd 5168	1 ⊢ (𝜑 → 𝐴 ∥ 1 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 846 = wceq 1534 ∈ wcel 2099 ≠ wne 2935 ∀wral 3056 ∖ cdif 3941 {csn 4624 class class class wbr 5142 ↦ cmpt 5225 ^◡ccnv 5671 ⟶wf 6538 –1-1→wf1 6539 –1-1-onto→wf1o 6541 ‘cfv 6542 (class class class)co 7414 ≈ cen 8952 Fincfn 8955 Basecbs 17171 ._rcmulr 17225 0_gc0g 17412 GrpHom cghm 19158 1_rcur 20112 Ringcrg 20164 ∥_rcdsr 20282 Domncdomn 21216

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8718 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-nn 12235 df-2 12297 df-sets 17124 df-slot 17142 df-ndx 17154 df-base 17172 df-plusg 17237 df-0g 17414 df-mgm 18591 df-sgrp 18670 df-mnd 18686 df-grp 18884 df-minusg 18885 df-sbg 18886 df-ghm 19159 df-cmn 19728 df-abl 19729 df-mgp 20066 df-rng 20084 df-ur 20113 df-ring 20166 df-dvdsr 20285 df-nzr 20441 df-domn 21220

This theorem is referenced by: fidomndrng 21248

W3C validator