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 25664

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 3493	. . . 4 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ V)
2	1	adantr 482	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) → 𝑋 ∈ V)
3	2	a1i 11	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) → 𝑋 ∈ V))
4		ovex 7439	. . . 4 ⊢ (𝐹𝑄𝐺) ∈ V
5		eleq1 2822	. . . 4 ⊢ ((𝐹𝑄𝐺) = 𝑋 → ((𝐹𝑄𝐺) ∈ V ↔ 𝑋 ∈ V))
6	4, 5	mpbii 232	. . 3 ⊢ ((𝐹𝑄𝐺) = 𝑋 → 𝑋 ∈ V)
7	6	a1i 11	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((𝐹𝑄𝐺) = 𝑋 → 𝑋 ∈ V))
8		simpr 486	. . . . 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 2733	. . . . . . . 8 ⊢ (0_g‘𝑃) = (0_g‘𝑃)
14		q1pval.t	. . . . . . . 8 ⊢ · = (._r‘𝑃)
15		simp1 1137	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝑅 ∈ Ring)
16		simp2 1138	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐹 ∈ 𝐵)
17		q1peqb.c	. . . . . . . . . 10 ⊢ 𝐶 = (Unic_1p‘𝑅)
18	9, 11, 17	uc1pcl 25653	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → 𝐺 ∈ 𝐵)
19	18	3ad2ant3 1136	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐺 ∈ 𝐵)
20	9, 13, 17	uc1pn0 25655	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → 𝐺 ≠ (0_g‘𝑃))
21	20	3ad2ant3 1136	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐺 ≠ (0_g‘𝑃))
22		eqid 2733	. . . . . . . . . 10 ⊢ (Unit‘𝑅) = (Unit‘𝑅)
23	10, 22, 17	uc1pldg 25658	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → ((coe₁‘𝐺)‘(𝐷‘𝐺)) ∈ (Unit‘𝑅))
24	23	3ad2ant3 1136	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((coe₁‘𝐺)‘(𝐷‘𝐺)) ∈ (Unit‘𝑅))
25	9, 10, 11, 12, 13, 14, 15, 16, 19, 21, 24, 22	ply1divalg2 25648	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ∃!𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))
26		df-reu 3378	. . . . . . 7 ⊢ (∃!𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺) ↔ ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
27	25, 26	sylib 217	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
28	27	adantr 482	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
29		eleq1 2822	. . . . . . 7 ⊢ (𝑞 = 𝑋 → (𝑞 ∈ 𝐵 ↔ 𝑋 ∈ 𝐵))
30		oveq1 7413	. . . . . . . . . 10 ⊢ (𝑞 = 𝑋 → (𝑞 · 𝐺) = (𝑋 · 𝐺))
31	30	oveq2d 7422	. . . . . . . . 9 ⊢ (𝑞 = 𝑋 → (𝐹 − (𝑞 · 𝐺)) = (𝐹 − (𝑋 · 𝐺)))
32	31	fveq2d 6893	. . . . . . . 8 ⊢ (𝑞 = 𝑋 → (𝐷‘(𝐹 − (𝑞 · 𝐺))) = (𝐷‘(𝐹 − (𝑋 · 𝐺))))
33	32	breq1d 5158	. . . . . . 7 ⊢ (𝑞 = 𝑋 → ((𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺) ↔ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)))
34	29, 33	anbi12d 632	. . . . . 6 ⊢ (𝑞 = 𝑋 → ((𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺))))
35	34	adantl 483	. . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) ∧ 𝑞 = 𝑋) → ((𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺))))
36	8, 28, 35	iota2d 6529	. . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))) = 𝑋))
37		q1pval.q	. . . . . . . . 9 ⊢ 𝑄 = (quot_1p‘𝑅)
38	37, 9, 11, 10, 12, 14	q1pval 25663	. . . . . . . 8 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹𝑄𝐺) = (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
39	16, 19, 38	syl2anc 585	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → (𝐹𝑄𝐺) = (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
40		df-riota 7362	. . . . . . 7 ⊢ (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
41	39, 40	eqtrdi 2789	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → (𝐹𝑄𝐺) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))))
42	41	adantr 482	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → (𝐹𝑄𝐺) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))))
43	42	eqeq1d 2735	. . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝐹𝑄𝐺) = 𝑋 ↔ (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))) = 𝑋))
44	36, 43	bitr4d 282	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝐹𝑄𝐺) = 𝑋))
45	44	ex 414	. 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 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∃!weu 2563 ≠ wne 2941 ∃!wreu 3375 Vcvv 3475 class class class wbr 5148 ℩cio 6491 ‘cfv 6541 ℩crio 7361 (class class class)co 7406 < clt 11245 Basecbs 17141 ._rcmulr 17195 0_gc0g 17382 -_gcsg 18818 Ringcrg 20050 Unitcui 20162 Poly₁cpl1 21693 coe₁cco1 21694 deg₁ cdg1 25561 Unic_1pcuc1p 25636 quot_1pcq1p 25637

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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185 ax-addf 11186 ax-mulf 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-of 7667 df-ofr 7668 df-om 7853 df-1st 7972 df-2nd 7973 df-supp 8144 df-tpos 8208 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-er 8700 df-map 8819 df-pm 8820 df-ixp 8889 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-fsupp 9359 df-sup 9434 df-oi 9502 df-card 9931 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-5 12275 df-6 12276 df-7 12277 df-8 12278 df-9 12279 df-n0 12470 df-z 12556 df-dec 12675 df-uz 12820 df-fz 13482 df-fzo 13625 df-seq 13964 df-hash 14288 df-struct 17077 df-sets 17094 df-slot 17112 df-ndx 17124 df-base 17142 df-ress 17171 df-plusg 17207 df-mulr 17208 df-starv 17209 df-sca 17210 df-vsca 17211 df-ip 17212 df-tset 17213 df-ple 17214 df-ds 17216 df-unif 17217 df-hom 17218 df-cco 17219 df-0g 17384 df-gsum 17385 df-prds 17390 df-pws 17392 df-mre 17527 df-mrc 17528 df-acs 17530 df-mgm 18558 df-sgrp 18607 df-mnd 18623 df-mhm 18668 df-submnd 18669 df-grp 18819 df-minusg 18820 df-sbg 18821 df-mulg 18946 df-subg 18998 df-ghm 19085 df-cntz 19176 df-cmn 19645 df-abl 19646 df-mgp 19983 df-ur 20000 df-ring 20052 df-cring 20053 df-oppr 20143 df-dvdsr 20164 df-unit 20165 df-invr 20195 df-subrg 20354 df-lmod 20466 df-lss 20536 df-rlreg 20892 df-cnfld 20938 df-psr 21454 df-mvr 21455 df-mpl 21456 df-opsr 21458 df-psr1 21696 df-vr1 21697 df-ply1 21698 df-coe1 21699 df-mdeg 25562 df-deg1 25563 df-uc1p 25641 df-q1p 25642

This theorem is referenced by: q1pcl 25665 r1pdeglt 25668 dvdsq1p 25670

W3C validator