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 25519

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 3463	. . . 4 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ V)
2	1	adantr 481	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) → 𝑋 ∈ V)
3	2	a1i 11	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) → 𝑋 ∈ V))
4		ovex 7390	. . . 4 ⊢ (𝐹𝑄𝐺) ∈ V
5		eleq1 2825	. . . 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 2736	. . . . . . . 8 ⊢ (0_g‘𝑃) = (0_g‘𝑃)
14		q1pval.t	. . . . . . . 8 ⊢ · = (._r‘𝑃)
15		simp1 1136	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝑅 ∈ Ring)
16		simp2 1137	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐹 ∈ 𝐵)
17		q1peqb.c	. . . . . . . . . 10 ⊢ 𝐶 = (Unic_1p‘𝑅)
18	9, 11, 17	uc1pcl 25508	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → 𝐺 ∈ 𝐵)
19	18	3ad2ant3 1135	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐺 ∈ 𝐵)
20	9, 13, 17	uc1pn0 25510	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → 𝐺 ≠ (0_g‘𝑃))
21	20	3ad2ant3 1135	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → 𝐺 ≠ (0_g‘𝑃))
22		eqid 2736	. . . . . . . . . 10 ⊢ (Unit‘𝑅) = (Unit‘𝑅)
23	10, 22, 17	uc1pldg 25513	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝐶 → ((coe₁‘𝐺)‘(𝐷‘𝐺)) ∈ (Unit‘𝑅))
24	23	3ad2ant3 1135	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((coe₁‘𝐺)‘(𝐷‘𝐺)) ∈ (Unit‘𝑅))
25	9, 10, 11, 12, 13, 14, 15, 16, 19, 21, 24, 22	ply1divalg2 25503	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ∃!𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))
26		df-reu 3354	. . . . . . 7 ⊢ (∃!𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺) ↔ ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
27	25, 26	sylib 217	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
28	27	adantr 481	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ∃!𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
29		eleq1 2825	. . . . . . 7 ⊢ (𝑞 = 𝑋 → (𝑞 ∈ 𝐵 ↔ 𝑋 ∈ 𝐵))
30		oveq1 7364	. . . . . . . . . 10 ⊢ (𝑞 = 𝑋 → (𝑞 · 𝐺) = (𝑋 · 𝐺))
31	30	oveq2d 7373	. . . . . . . . 9 ⊢ (𝑞 = 𝑋 → (𝐹 − (𝑞 · 𝐺)) = (𝐹 − (𝑋 · 𝐺)))
32	31	fveq2d 6846	. . . . . . . 8 ⊢ (𝑞 = 𝑋 → (𝐷‘(𝐹 − (𝑞 · 𝐺))) = (𝐷‘(𝐹 − (𝑋 · 𝐺))))
33	32	breq1d 5115	. . . . . . 7 ⊢ (𝑞 = 𝑋 → ((𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺) ↔ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)))
34	29, 33	anbi12d 631	. . . . . 6 ⊢ (𝑞 = 𝑋 → ((𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺))))
35	34	adantl 482	. . . . 5 ⊢ ((((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) ∧ 𝑞 = 𝑋) → ((𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺))))
36	8, 28, 35	iota2d 6484	. . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))) = 𝑋))
37		q1pval.q	. . . . . . . . 9 ⊢ 𝑄 = (quot_1p‘𝑅)
38	37, 9, 11, 10, 12, 14	q1pval 25518	. . . . . . . 8 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹𝑄𝐺) = (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
39	16, 19, 38	syl2anc 584	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → (𝐹𝑄𝐺) = (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
40		df-riota 7313	. . . . . . 7 ⊢ (℩𝑞 ∈ 𝐵 (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺)))
41	39, 40	eqtrdi 2792	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → (𝐹𝑄𝐺) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))))
42	41	adantr 481	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → (𝐹𝑄𝐺) = (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))))
43	42	eqeq1d 2738	. . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝐹𝑄𝐺) = 𝑋 ↔ (℩𝑞(𝑞 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑞 · 𝐺))) < (𝐷‘𝐺))) = 𝑋))
44	36, 43	bitr4d 281	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) ∧ 𝑋 ∈ V) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝐹𝑄𝐺) = 𝑋))
45	44	ex 413	. 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → (𝑋 ∈ V → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝐹𝑄𝐺) = 𝑋)))
46	3, 7, 45	pm5.21ndd 380	1 ⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐶) → ((𝑋 ∈ 𝐵 ∧ (𝐷‘(𝐹 − (𝑋 · 𝐺))) < (𝐷‘𝐺)) ↔ (𝐹𝑄𝐺) = 𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∃!weu 2566 ≠ wne 2943 ∃!wreu 3351 Vcvv 3445 class class class wbr 5105 ℩cio 6446 ‘cfv 6496 ℩crio 7312 (class class class)co 7357 < clt 11189 Basecbs 17083 ._rcmulr 17134 0_gc0g 17321 -_gcsg 18750 Ringcrg 19964 Unitcui 20068 Poly₁cpl1 21548 coe₁cco1 21549 deg₁ cdg1 25416 Unic_1pcuc1p 25491 quot_1pcq1p 25492

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 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 ax-pre-sup 11129 ax-addf 11130 ax-mulf 11131

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 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-tp 4591 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-iin 4957 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-se 5589 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-of 7617 df-ofr 7618 df-om 7803 df-1st 7921 df-2nd 7922 df-supp 8093 df-tpos 8157 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-1o 8412 df-er 8648 df-map 8767 df-pm 8768 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9306 df-sup 9378 df-oi 9446 df-card 9875 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-nn 12154 df-2 12216 df-3 12217 df-4 12218 df-5 12219 df-6 12220 df-7 12221 df-8 12222 df-9 12223 df-n0 12414 df-z 12500 df-dec 12619 df-uz 12764 df-fz 13425 df-fzo 13568 df-seq 13907 df-hash 14231 df-struct 17019 df-sets 17036 df-slot 17054 df-ndx 17066 df-base 17084 df-ress 17113 df-plusg 17146 df-mulr 17147 df-starv 17148 df-sca 17149 df-vsca 17150 df-ip 17151 df-tset 17152 df-ple 17153 df-ds 17155 df-unif 17156 df-hom 17157 df-cco 17158 df-0g 17323 df-gsum 17324 df-prds 17329 df-pws 17331 df-mre 17466 df-mrc 17467 df-acs 17469 df-mgm 18497 df-sgrp 18546 df-mnd 18557 df-mhm 18601 df-submnd 18602 df-grp 18751 df-minusg 18752 df-sbg 18753 df-mulg 18873 df-subg 18925 df-ghm 19006 df-cntz 19097 df-cmn 19564 df-abl 19565 df-mgp 19897 df-ur 19914 df-ring 19966 df-cring 19967 df-oppr 20049 df-dvdsr 20070 df-unit 20071 df-invr 20101 df-subrg 20220 df-lmod 20324 df-lss 20393 df-rlreg 20753 df-cnfld 20797 df-psr 21311 df-mvr 21312 df-mpl 21313 df-opsr 21315 df-psr1 21551 df-vr1 21552 df-ply1 21553 df-coe1 21554 df-mdeg 25417 df-deg1 25418 df-uc1p 25496 df-q1p 25497

This theorem is referenced by: q1pcl 25520 r1pdeglt 25523 dvdsq1p 25525

W3C validator