q1peqb - Metamath Proof Explorer

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

Theorem q1peqb 25319

Description: Characterizing property of the polynomial quotient. (Contributed by Stefan O'Rear, 28-Mar-2015.)

**Hypotheses**
Ref	Expression
q1pval.q	⊢ 𝑄 = (quot_1p‘𝑅)
q1pval.p	⊢ 𝑃 = (Poly₁‘𝑅)
q1pval.b	⊢ 𝐵 = (Base‘𝑃)
q1pval.d	⊢ 𝐷 = ( deg₁ ‘𝑅)
q1pval.m	⊢ − = (-_g‘𝑃)
q1pval.t	⊢ · = (._r‘𝑃)
q1peqb.c	⊢ 𝐶 = (Unic_1p‘𝑅)

**Assertion**
Ref	Expression
q1peqb	⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝐹𝑄𝐺) = 𝑋))

Proof of Theorem q1peqb Dummy variable 𝑞 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3450	. . . 4 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ V)
2	1	adantr 481	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) → 𝑋 ∈ V)
3	2	a1i 11	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) → 𝑋 ∈ V))
4		ovex 7308	. . . 4 ⊢ (𝐹𝑄𝐺) ∈ V
5		eleq1 2826	. . . 4 ⊢ ((𝐹𝑄𝐺) = 𝑋 → ((𝐹𝑄𝐺) ∈ V ↔ 𝑋 ∈ V))
6	4, 5	mpbii 232	. . 3 ⊢ ((𝐹𝑄𝐺) = 𝑋 → 𝑋 ∈ V)
7	6	a1i 11	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((𝐹𝑄𝐺) = 𝑋 → 𝑋 ∈ V))
8		simpr 485	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → 𝑋 ∈ V)
9		q1pval.p	. . . . . . . 8 ⊢ 𝑃 = (Poly₁‘𝑅)
10		q1pval.d	. . . . . . . 8 ⊢ 𝐷 = ( deg₁ ‘𝑅)
11		q1pval.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑃)
12		q1pval.m	. . . . . . . 8 ⊢ − = (-_g‘𝑃)
13		eqid 2738	. . . . . . . 8 ⊢ (0_g‘𝑃) = (0_g‘𝑃)
14		q1pval.t	. . . . . . . 8 ⊢ · = (._r‘𝑃)
15		simp1 1135	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝑅 ∈ Ring)
16		simp2 1136	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐹 ∈ 𝐵)
17		q1peqb.c	. . . . . . . . . 10 ⊢ 𝐶 = (Unic_1p‘𝑅)
18	9, 11, 17	uc1pcl 25308	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → 𝐺 ∈ 𝐵)
19	18	3ad2ant3 1134	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐺 ∈ 𝐵)
20	9, 13, 17	uc1pn0 25310	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → 𝐺 ≠ (0_g‘𝑃))
21	20	3ad2ant3 1134	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐺 ≠ (0_g‘𝑃))
22		eqid 2738	. . . . . . . . . 10 ⊢ (Unit‘𝑅) = (Unit‘𝑅)
23	10, 22, 17	uc1pldg 25313	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → ((coe₁‘𝐺)‘(𝐷‘𝐺)) ∈ (Unit‘𝑅))
24	23	3ad2ant3 1134	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((coe₁‘𝐺)‘(𝐷‘𝐺)) ∈ (Unit‘𝑅))
25	9, 10, 11, 12, 13, 14, 15, 16, 19, 21, 24, 22	ply1divalg2 25303	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ∃!𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))
26		df-reu 3072	. . . . . . 7 ⊢ (∃!𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺) ↔ ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
27	25, 26	sylib 217	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
28	27	adantr 481	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
29		eleq1 2826	. . . . . . 7 ⊢ (𝑞 = 𝑋 → (𝑞 ∈ 𝐵 ↔ 𝑋 ∈ 𝐵))
30		oveq1 7282	. . . . . . . . . 10 ⊢ (𝑞 = 𝑋 → (𝑞 · 𝐺) = (𝑋 · 𝐺))
31	30	oveq2d 7291	. . . . . . . . 9 ⊢ (𝑞 = 𝑋 → (𝐹 − (𝑞 · 𝐺)) = (𝐹 − (𝑋 · 𝐺)))
32	31	fveq2d 6778	. . . . . . . 8 ⊢ (𝑞 = 𝑋 → (𝐷‘(𝐹 − (𝑞 · 𝐺))) = (𝐷‘(𝐹 − (𝑋 · 𝐺))))
33	32	breq1d 5084	. . . . . . 7 ⊢ (𝑞 = 𝑋 → ((𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺) ↔ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)))
34	29, 33	anbi12d 631	. . . . . 6 ⊢ (𝑞 = 𝑋 → ((𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺))))
35	34	adantl 482	. . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) ∧ 𝑞 = 𝑋) → ((𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺))))
36	8, 28, 35	iota2d 6421	. . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))) = 𝑋))
37		q1pval.q	. . . . . . . . 9 ⊢ 𝑄 = (quot_1p‘𝑅)
38	37, 9, 11, 10, 12, 14	q1pval 25318	. . . . . . . 8 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹𝑄𝐺) = (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
39	16, 19, 38	syl2anc 584	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → (𝐹𝑄𝐺) = (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
40		df-riota 7232	. . . . . . 7 ⊢ (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
41	39, 40	eqtrdi 2794	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → (𝐹𝑄𝐺) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))))
42	41	adantr 481	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → (𝐹𝑄𝐺) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))))
43	42	eqeq1d 2740	. . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝐹𝑄𝐺) = 𝑋 ↔ (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))) = 𝑋))
44	36, 43	bitr4d 281	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝐹𝑄𝐺) = 𝑋))
45	44	ex 413	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → (𝑋 ∈ V → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝐹𝑄𝐺) = 𝑋)))
46	3, 7, 45	pm5.21ndd 381	1 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝐹𝑄𝐺) = 𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∃!weu 2568 ≠ wne 2943 ∃!wreu 3066 Vcvv 3432 class class class wbr 5074 ℩cio 6389 ‘cfv 6433 ℩crio 7231 (class class class)co 7275 < clt 11009 Basecbs 16912 ._rcmulr 16963 0_gc0g 17150 -_gcsg 18579 Ringcrg 19783 Unitcui 19881 Poly₁cpl1 21348 coe₁cco1 21349 deg₁ cdg1 25216 Unic_1pcuc1p 25291 quot_1pcq1p 25292

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 ax-addf 10950 ax-mulf 10951

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-iin 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-ofr 7534 df-om 7713 df-1st 7831 df-2nd 7832 df-supp 7978 df-tpos 8042 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-pm 8618 df-ixp 8686 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-fsupp 9129 df-sup 9201 df-oi 9269 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-9 12043 df-n0 12234 df-z 12320 df-dec 12438 df-uz 12583 df-fz 13240 df-fzo 13383 df-seq 13722 df-hash 14045 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-starv 16977 df-sca 16978 df-vsca 16979 df-tset 16981 df-ple 16982 df-ds 16984 df-unif 16985 df-0g 17152 df-gsum 17153 df-mre 17295 df-mrc 17296 df-acs 17298 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-mhm 18430 df-submnd 18431 df-grp 18580 df-minusg 18581 df-sbg 18582 df-mulg 18701 df-subg 18752 df-ghm 18832 df-cntz 18923 df-cmn 19388 df-abl 19389 df-mgp 19721 df-ur 19738 df-ring 19785 df-cring 19786 df-oppr 19862 df-dvdsr 19883 df-unit 19884 df-invr 19914 df-subrg 20022 df-lmod 20125 df-lss 20194 df-rlreg 20554 df-cnfld 20598 df-psr 21112 df-mvr 21113 df-mpl 21114 df-opsr 21116 df-psr1 21351 df-vr1 21352 df-ply1 21353 df-coe1 21354 df-mdeg 25217 df-deg1 25218 df-uc1p 25296 df-q1p 25297

This theorem is referenced by: q1pcl 25320 r1pdeglt 25323 dvdsq1p 25325

W3C validator