gzrngunit - Metamath Proof Explorer

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

Theorem gzrngunit 21540

Description: The units on ℤ[i] are the gaussian integers with norm 1. (Contributed by Mario Carneiro, 4-Dec-2014.)

**Hypothesis**
Ref	Expression
gzrng.1	⊢ 𝑍 = (ℂ_fld ↾_s ℤ[i])

**Assertion**
Ref	Expression
gzrngunit	⊢ (𝐴 ∈ (Unit‘𝑍) ↔ (𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1))

**Proof of Theorem gzrngunit**
Step	Hyp	Ref	Expression
1		gzsubrg 21528	. . . . 5 ⊢ ℤ[i] ∈ (SubRing‘ℂ_fld)
2		gzrng.1	. . . . . 6 ⊢ 𝑍 = (ℂ_fld ↾_s ℤ[i])
3	2	subrgbas 20654	. . . . 5 ⊢ (ℤ[i] ∈ (SubRing‘ℂ_fld) → ℤ[i] = (Base‘𝑍))
4	1, 3	ax-mp 5	. . . 4 ⊢ ℤ[i] = (Base‘𝑍)
5		eqid 2765	. . . 4 ⊢ (Unit‘𝑍) = (Unit‘𝑍)
6	4, 5	unitcl 20445	. . 3 ⊢ (𝐴 ∈ (Unit‘𝑍) → 𝐴 ∈ ℤ[i])
7		eqid 2765	. . . . . . . . . . . 12 ⊢ (inv_r‘ℂ_fld) = (inv_r‘ℂ_fld)
8		eqid 2765	. . . . . . . . . . . 12 ⊢ (inv_r‘𝑍) = (inv_r‘𝑍)
9	2, 7, 5, 8	subrginv 20661	. . . . . . . . . . 11 ⊢ ((ℤ[i] ∈ (SubRing‘ℂ_fld) ∧ 𝐴 ∈ (Unit‘𝑍)) → ((inv_r‘ℂ_fld)‘𝐴) = ((inv_r‘𝑍)‘𝐴))
10	1, 9	mpan 702	. . . . . . . . . 10 ⊢ (𝐴 ∈ (Unit‘𝑍) → ((inv_r‘ℂ_fld)‘𝐴) = ((inv_r‘𝑍)‘𝐴))
11		gzcn 16980	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℤ[i] → 𝐴 ∈ ℂ)
12	6, 11	syl 18	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (Unit‘𝑍) → 𝐴 ∈ ℂ)
13		0red 11199	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ (Unit‘𝑍) → 0 ∈ ℝ)
14		1re 11196	. . . . . . . . . . . . . . 15 ⊢ 1 ∈ ℝ
15	14	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ (Unit‘𝑍) → 1 ∈ ℝ)
16	12	abscld 15478	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ (Unit‘𝑍) → (abs‘𝐴) ∈ ℝ)
17		0lt1 11724	. . . . . . . . . . . . . . 15 ⊢ 0 < 1
18	17	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ (Unit‘𝑍) → 0 < 1)
19	2	gzrngunitlem 21539	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ (Unit‘𝑍) → 1 ≤ (abs‘𝐴))
20	13, 15, 16, 18, 19	ltletrd 11358	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ (Unit‘𝑍) → 0 < (abs‘𝐴))
21	20	gt0ne0d 11766	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ (Unit‘𝑍) → (abs‘𝐴) ≠ 0)
22	12	abs00ad 15329	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ (Unit‘𝑍) → ((abs‘𝐴) = 0 ↔ 𝐴 = 0))
23	22	necon3bid 3004	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ (Unit‘𝑍) → ((abs‘𝐴) ≠ 0 ↔ 𝐴 ≠ 0))
24	21, 23	mpbid 235	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (Unit‘𝑍) → 𝐴 ≠ 0)
25		cnfldinv 21510	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → ((inv_r‘ℂ_fld)‘𝐴) = (1 / 𝐴))
26	12, 24, 25	syl2anc 595	. . . . . . . . . 10 ⊢ (𝐴 ∈ (Unit‘𝑍) → ((inv_r‘ℂ_fld)‘𝐴) = (1 / 𝐴))
27	10, 26	eqtr3d 2802	. . . . . . . . 9 ⊢ (𝐴 ∈ (Unit‘𝑍) → ((inv_r‘𝑍)‘𝐴) = (1 / 𝐴))
28	2	subrgring 20647	. . . . . . . . . . 11 ⊢ (ℤ[i] ∈ (SubRing‘ℂ_fld) → 𝑍 ∈ Ring)
29	1, 28	ax-mp 5	. . . . . . . . . 10 ⊢ 𝑍 ∈ Ring
30	5, 8	unitinvcl 20460	. . . . . . . . . 10 ⊢ ((𝑍 ∈ Ring ∧ 𝐴 ∈ (Unit‘𝑍)) → ((inv_r‘𝑍)‘𝐴) ∈ (Unit‘𝑍))
31	29, 30	mpan 702	. . . . . . . . 9 ⊢ (𝐴 ∈ (Unit‘𝑍) → ((inv_r‘𝑍)‘𝐴) ∈ (Unit‘𝑍))
32	27, 31	eqeltrrd 2866	. . . . . . . 8 ⊢ (𝐴 ∈ (Unit‘𝑍) → (1 / 𝐴) ∈ (Unit‘𝑍))
33	2	gzrngunitlem 21539	. . . . . . . 8 ⊢ ((1 / 𝐴) ∈ (Unit‘𝑍) → 1 ≤ (abs‘(1 / 𝐴)))
34	32, 33	syl 18	. . . . . . 7 ⊢ (𝐴 ∈ (Unit‘𝑍) → 1 ≤ (abs‘(1 / 𝐴)))
35		1cnd 11190	. . . . . . . 8 ⊢ (𝐴 ∈ (Unit‘𝑍) → 1 ∈ ℂ)
36	35, 12, 24	absdivd 15497	. . . . . . 7 ⊢ (𝐴 ∈ (Unit‘𝑍) → (abs‘(1 / 𝐴)) = ((abs‘1) / (abs‘𝐴)))
37	34, 36	breqtrd 5130	. . . . . 6 ⊢ (𝐴 ∈ (Unit‘𝑍) → 1 ≤ ((abs‘1) / (abs‘𝐴)))
38		1div1e1 11893	. . . . . 6 ⊢ (1 / 1) = 1
39		abs1 15336	. . . . . . . 8 ⊢ (abs‘1) = 1
40	39	eqcomi 2774	. . . . . . 7 ⊢ 1 = (abs‘1)
41	40	oveq1i 7410	. . . . . 6 ⊢ (1 / (abs‘𝐴)) = ((abs‘1) / (abs‘𝐴))
42	37, 38, 41	3brtr4g 5138	. . . . 5 ⊢ (𝐴 ∈ (Unit‘𝑍) → (1 / 1) ≤ (1 / (abs‘𝐴)))
43		lerec 12086	. . . . . 6 ⊢ ((((abs‘𝐴) ∈ ℝ ∧ 0 < (abs‘𝐴)) ∧ (1 ∈ ℝ ∧ 0 < 1)) → ((abs‘𝐴) ≤ 1 ↔ (1 / 1) ≤ (1 / (abs‘𝐴))))
44	16, 20, 15, 18, 43	syl22anc 851	. . . . 5 ⊢ (𝐴 ∈ (Unit‘𝑍) → ((abs‘𝐴) ≤ 1 ↔ (1 / 1) ≤ (1 / (abs‘𝐴))))
45	42, 44	mpbird 260	. . . 4 ⊢ (𝐴 ∈ (Unit‘𝑍) → (abs‘𝐴) ≤ 1)
46		letri3 11283	. . . . 5 ⊢ (((abs‘𝐴) ∈ ℝ ∧ 1 ∈ ℝ) → ((abs‘𝐴) = 1 ↔ ((abs‘𝐴) ≤ 1 ∧ 1 ≤ (abs‘𝐴))))
47	16, 14, 46	sylancl 597	. . . 4 ⊢ (𝐴 ∈ (Unit‘𝑍) → ((abs‘𝐴) = 1 ↔ ((abs‘𝐴) ≤ 1 ∧ 1 ≤ (abs‘𝐴))))
48	45, 19, 47	mpbir2and 725	. . 3 ⊢ (𝐴 ∈ (Unit‘𝑍) → (abs‘𝐴) = 1)
49	6, 48	jca 520	. 2 ⊢ (𝐴 ∈ (Unit‘𝑍) → (𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1))
50	11	adantr 485	. . . 4 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → 𝐴 ∈ ℂ)
51		simpr 489	. . . . . 6 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → (abs‘𝐴) = 1)
52		ax-1ne0 11157	. . . . . . 7 ⊢ 1 ≠ 0
53	52	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → 1 ≠ 0)
54	51, 53	eqnetrd 3027	. . . . 5 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → (abs‘𝐴) ≠ 0)
55		fveq2 6871	. . . . . . 7 ⊢ (𝐴 = 0 → (abs‘𝐴) = (abs‘0))
56		abs0 15324	. . . . . . 7 ⊢ (abs‘0) = 0
57	55, 56	eqtrdi 2816	. . . . . 6 ⊢ (𝐴 = 0 → (abs‘𝐴) = 0)
58	57	necon3i 2992	. . . . 5 ⊢ ((abs‘𝐴) ≠ 0 → 𝐴 ≠ 0)
59	54, 58	syl 18	. . . 4 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → 𝐴 ≠ 0)
60		eldifsn 4749	. . . 4 ⊢ (𝐴 ∈ (ℂ ∖ {0}) ↔ (𝐴 ∈ ℂ ∧ 𝐴 ≠ 0))
61	50, 59, 60	sylanbrc 594	. . 3 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → 𝐴 ∈ (ℂ ∖ {0}))
62		simpl 487	. . 3 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → 𝐴 ∈ ℤ[i])
63	50, 59, 25	syl2anc 595	. . . . 5 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → ((inv_r‘ℂ_fld)‘𝐴) = (1 / 𝐴))
64	50	absvalsqd 15484	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → ((abs‘𝐴)↑2) = (𝐴 · (∗‘𝐴)))
65	51	oveq1d 7415	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → ((abs‘𝐴)↑2) = (1↑2))
66		sq1 14219	. . . . . . . 8 ⊢ (1↑2) = 1
67	65, 66	eqtrdi 2816	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → ((abs‘𝐴)↑2) = 1)
68	64, 67	eqtr3d 2802	. . . . . 6 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → (𝐴 · (∗‘𝐴)) = 1)
69	68	oveq1d 7415	. . . . 5 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → ((𝐴 · (∗‘𝐴)) / 𝐴) = (1 / 𝐴))
70	50	cjcld 15235	. . . . . 6 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → (∗‘𝐴) ∈ ℂ)
71	70, 50, 59	divcan3d 11984	. . . . 5 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → ((𝐴 · (∗‘𝐴)) / 𝐴) = (∗‘𝐴))
72	63, 69, 71	3eqtr2d 2806	. . . 4 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → ((inv_r‘ℂ_fld)‘𝐴) = (∗‘𝐴))
73		gzcjcl 16984	. . . . 5 ⊢ (𝐴 ∈ ℤ[i] → (∗‘𝐴) ∈ ℤ[i])
74	73	adantr 485	. . . 4 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → (∗‘𝐴) ∈ ℤ[i])
75	72, 74	eqeltrd 2865	. . 3 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → ((inv_r‘ℂ_fld)‘𝐴) ∈ ℤ[i])
76		cnfldbas 21483	. . . . . 6 ⊢ ℂ = (Base‘ℂ_fld)
77		cnfld0 21503	. . . . . 6 ⊢ 0 = (0_g‘ℂ_fld)
78		cndrng 21508	. . . . . 6 ⊢ ℂ_fld ∈ DivRing
79	76, 77, 78	drngui 20807	. . . . 5 ⊢ (ℂ ∖ {0}) = (Unit‘ℂ_fld)
80	2, 79, 5, 7	subrgunit 20663	. . . 4 ⊢ (ℤ[i] ∈ (SubRing‘ℂ_fld) → (𝐴 ∈ (Unit‘𝑍) ↔ (𝐴 ∈ (ℂ ∖ {0}) ∧ 𝐴 ∈ ℤ[i] ∧ ((inv_r‘ℂ_fld)‘𝐴) ∈ ℤ[i])))
81	1, 80	ax-mp 5	. . 3 ⊢ (𝐴 ∈ (Unit‘𝑍) ↔ (𝐴 ∈ (ℂ ∖ {0}) ∧ 𝐴 ∈ ℤ[i] ∧ ((inv_r‘ℂ_fld)‘𝐴) ∈ ℤ[i]))
82	61, 62, 75, 81	syl3anbrc 1360	. 2 ⊢ ((𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1) → 𝐴 ∈ (Unit‘𝑍))
83	49, 82	impbii 212	1 ⊢ (𝐴 ∈ (Unit‘𝑍) ↔ (𝐴 ∈ ℤ[i] ∧ (abs‘𝐴) = 1))

Colors of variables: wff setvar class

Syntax hints: ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∖ cdif 3904 {csn 4585 class class class wbr 5104 ‘cfv 6525 (class class class)co 7400 ℂcc 11086 ℝcr 11087 0cc0 11088 1c1 11089 · cmul 11093 < clt 11231 ≤ cle 11232 / cdiv 11859 2c2 12283 ↑cexp 14085 ∗ccj 15135 abscabs 15273 ℤ[i]cgz 16977 Basecbs 17257 ↾_s cress 17278 Ringcrg 20303 Unitcui 20425 inv_rcinvr 20457 SubRingcsubrg 20642 ℂ_fldccnfld 21479

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 ax-addf 11167

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-tpos 8210 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12222 df-2 12291 df-3 12292 df-4 12293 df-5 12294 df-6 12295 df-7 12296 df-8 12297 df-9 12298 df-n0 12493 df-z 12580 df-dec 12700 df-uz 12851 df-rp 13005 df-fz 13524 df-seq 14026 df-exp 14086 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-gz 16978 df-struct 17195 df-sets 17212 df-slot 17230 df-ndx 17242 df-base 17258 df-ress 17279 df-plusg 17311 df-mulr 17312 df-starv 17313 df-tset 17317 df-ple 17318 df-ds 17320 df-unif 17321 df-0g 17482 df-mgm 18686 df-sgrp 18765 df-mnd 18781 df-grp 18991 df-minusg 18992 df-subg 19177 df-cmn 19840 df-abl 19841 df-mgp 20205 df-rng 20219 df-ur 20252 df-ring 20305 df-cring 20306 df-oppr 20407 df-dvdsr 20427 df-unit 20428 df-invr 20458 df-dvr 20471 df-subrng 20619 df-subrg 20643 df-drng 20803 df-cnfld 21480

This theorem is referenced by: zringunit 21573

W3C validator