Theorem coprm 12900

Description: A prime number either divides an integer or is coprime to it, but not both. Theorem 1.8 in [ApostolNT] p. 17. (Contributed by Paul Chapman, 22-Jun-2011.)

Assertion

Ref	Expression
coprm	|- ( ( P e. Prime /\ N e. ZZ ) -> ( -. P || N <-> ( P gcd N ) = 1 ) )

Proof of Theorem coprm

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prmz 12867	. . . . . . 7 |- ( P e. Prime -> P e. ZZ )
2		gcddvds 12718	. . . . . . 7 |- ( ( P e. ZZ /\ N e. ZZ ) -> ( ( P gcd N ) || P /\ ( P gcd N ) || N ) )
3	1, 2	sylan 283	. . . . . 6 |- ( ( P e. Prime /\ N e. ZZ ) -> ( ( P gcd N ) || P /\ ( P gcd N ) || N ) )
4	3	simprd 114	. . . . 5 |- ( ( P e. Prime /\ N e. ZZ ) -> ( P gcd N ) || N )
5		breq1 4128	. . . . 5 |- ( ( P gcd N ) = P -> ( ( P gcd N ) || N <-> P || N ) )
6	4, 5	syl5ibcom 155	. . . 4 |- ( ( P e. Prime /\ N e. ZZ ) -> ( ( P gcd N ) = P -> P || N ) )
7	6	con3d 640	. . 3 |- ( ( P e. Prime /\ N e. ZZ ) -> ( -. P || N -> -. ( P gcd N ) = P ) )
8		0nnn 9310	. . . . . . . . 9 |- -. 0 e. NN
9		prmnn 12866	. . . . . . . . . 10 |- ( P e. Prime -> P e. NN )
10		eleq1 2301	. . . . . . . . . 10 |- ( P = 0 -> ( P e. NN <-> 0 e. NN ) )
11	9, 10	syl5ibcom 155	. . . . . . . . 9 |- ( P e. Prime -> ( P = 0 -> 0 e. NN ) )
12	8, 11	mtoi 674	. . . . . . . 8 |- ( P e. Prime -> -. P = 0 )
13	12	intnanrd 944	. . . . . . 7 |- ( P e. Prime -> -. ( P = 0 /\ N = 0 ) )
14	13	adantr 276	. . . . . 6 |- ( ( P e. Prime /\ N e. ZZ ) -> -. ( P = 0 /\ N = 0 ) )
15		gcdn0cl 12717	. . . . . . . 8 |- ( ( ( P e. ZZ /\ N e. ZZ ) /\ -. ( P = 0 /\ N = 0 ) ) -> ( P gcd N ) e. NN )
16	15	ex 115	. . . . . . 7 |- ( ( P e. ZZ /\ N e. ZZ ) -> ( -. ( P = 0 /\ N = 0 ) -> ( P gcd N ) e. NN ) )
17	1, 16	sylan 283	. . . . . 6 |- ( ( P e. Prime /\ N e. ZZ ) -> ( -. ( P = 0 /\ N = 0 ) -> ( P gcd N ) e. NN ) )
18	14, 17	mpd 13	. . . . 5 |- ( ( P e. Prime /\ N e. ZZ ) -> ( P gcd N ) e. NN )
19	3	simpld 112	. . . . 5 |- ( ( P e. Prime /\ N e. ZZ ) -> ( P gcd N ) || P )
20		isprm2 12873	. . . . . . . 8 |- ( P e. Prime <-> ( P e. ( ZZ>= ` 2 ) /\ A. z e. NN ( z || P -> ( z = 1 \/ z = P ) ) ) )
21	20	simprbi 275	. . . . . . 7 |- ( P e. Prime -> A. z e. NN ( z || P -> ( z = 1 \/ z = P ) ) )
22		breq1 4128	. . . . . . . . 9 |- ( z = ( P gcd N ) -> ( z || P <-> ( P gcd N ) || P ) )
23		eqeq1 2245	. . . . . . . . . 10 |- ( z = ( P gcd N ) -> ( z = 1 <-> ( P gcd N ) = 1 ) )
24		eqeq1 2245	. . . . . . . . . 10 |- ( z = ( P gcd N ) -> ( z = P <-> ( P gcd N ) = P ) )
25	23, 24	orbi12d 805	. . . . . . . . 9 |- ( z = ( P gcd N ) -> ( ( z = 1 \/ z = P ) <-> ( ( P gcd N ) = 1 \/ ( P gcd N ) = P ) ) )
26	22, 25	imbi12d 234	. . . . . . . 8 |- ( z = ( P gcd N ) -> ( ( z || P -> ( z = 1 \/ z = P ) ) <-> ( ( P gcd N ) || P -> ( ( P gcd N ) = 1 \/ ( P gcd N ) = P ) ) ) )
27	26	rspcv 2925	. . . . . . 7 |- ( ( P gcd N ) e. NN -> ( A. z e. NN ( z || P -> ( z = 1 \/ z = P ) ) -> ( ( P gcd N ) || P -> ( ( P gcd N ) = 1 \/ ( P gcd N ) = P ) ) ) )
28	21, 27	syl5com 29	. . . . . 6 |- ( P e. Prime -> ( ( P gcd N ) e. NN -> ( ( P gcd N ) || P -> ( ( P gcd N ) = 1 \/ ( P gcd N ) = P ) ) ) )
29	28	adantr 276	. . . . 5 |- ( ( P e. Prime /\ N e. ZZ ) -> ( ( P gcd N ) e. NN -> ( ( P gcd N ) || P -> ( ( P gcd N ) = 1 \/ ( P gcd N ) = P ) ) ) )
30	18, 19, 29	mp2d 47	. . . 4 |- ( ( P e. Prime /\ N e. ZZ ) -> ( ( P gcd N ) = 1 \/ ( P gcd N ) = P ) )
31		biorf 756	. . . . 5 |- ( -. ( P gcd N ) = P -> ( ( P gcd N ) = 1 <-> ( ( P gcd N ) = P \/ ( P gcd N ) = 1 ) ) )
32		orcom 740	. . . . 5 |- ( ( ( P gcd N ) = P \/ ( P gcd N ) = 1 ) <-> ( ( P gcd N ) = 1 \/ ( P gcd N ) = P ) )
33	31, 32	bitrdi 196	. . . 4 |- ( -. ( P gcd N ) = P -> ( ( P gcd N ) = 1 <-> ( ( P gcd N ) = 1 \/ ( P gcd N ) = P ) ) )
34	30, 33	syl5ibrcom 157	. . 3 |- ( ( P e. Prime /\ N e. ZZ ) -> ( -. ( P gcd N ) = P -> ( P gcd N ) = 1 ) )
35	7, 34	syld 45	. 2 |- ( ( P e. Prime /\ N e. ZZ ) -> ( -. P || N -> ( P gcd N ) = 1 ) )
36		iddvds 12549	. . . . . . 7 |- ( P e. ZZ -> P || P )
37	1, 36	syl 14	. . . . . 6 |- ( P e. Prime -> P || P )
38	37	adantr 276	. . . . 5 |- ( ( P e. Prime /\ N e. ZZ ) -> P || P )
39		dvdslegcd 12719	. . . . . . . . 9 |- ( ( ( P e. ZZ /\ P e. ZZ /\ N e. ZZ ) /\ -. ( P = 0 /\ N = 0 ) ) -> ( ( P || P /\ P || N ) -> P <_ ( P gcd N ) ) )
40	39	ex 115	. . . . . . . 8 |- ( ( P e. ZZ /\ P e. ZZ /\ N e. ZZ ) -> ( -. ( P = 0 /\ N = 0 ) -> ( ( P || P /\ P || N ) -> P <_ ( P gcd N ) ) ) )
41	40	3anidm12 1336	. . . . . . 7 |- ( ( P e. ZZ /\ N e. ZZ ) -> ( -. ( P = 0 /\ N = 0 ) -> ( ( P || P /\ P || N ) -> P <_ ( P gcd N ) ) ) )
42	1, 41	sylan 283	. . . . . 6 |- ( ( P e. Prime /\ N e. ZZ ) -> ( -. ( P = 0 /\ N = 0 ) -> ( ( P || P /\ P || N ) -> P <_ ( P gcd N ) ) ) )
43	14, 42	mpd 13	. . . . 5 |- ( ( P e. Prime /\ N e. ZZ ) -> ( ( P || P /\ P || N ) -> P <_ ( P gcd N ) ) )
44	38, 43	mpand 433	. . . 4 |- ( ( P e. Prime /\ N e. ZZ ) -> ( P || N -> P <_ ( P gcd N ) ) )
45		prmgt1 12888	. . . . . 6 |- ( P e. Prime -> 1 < P )
46	45	adantr 276	. . . . 5 |- ( ( P e. Prime /\ N e. ZZ ) -> 1 < P )
47	1	zred 9747	. . . . . . 7 |- ( P e. Prime -> P e. RR )
48	47	adantr 276	. . . . . 6 |- ( ( P e. Prime /\ N e. ZZ ) -> P e. RR )
49	18	nnred 9296	. . . . . 6 |- ( ( P e. Prime /\ N e. ZZ ) -> ( P gcd N ) e. RR )
50		1re 8315	. . . . . . 7 |- 1 e. RR
51		ltletr 8405	. . . . . . 7 |- ( ( 1 e. RR /\ P e. RR /\ ( P gcd N ) e. RR ) -> ( ( 1 < P /\ P <_ ( P gcd N ) ) -> 1 < ( P gcd N ) ) )
52	50, 51	mp3an1 1365	. . . . . 6 |- ( ( P e. RR /\ ( P gcd N ) e. RR ) -> ( ( 1 < P /\ P <_ ( P gcd N ) ) -> 1 < ( P gcd N ) ) )
53	48, 49, 52	syl2anc 415	. . . . 5 |- ( ( P e. Prime /\ N e. ZZ ) -> ( ( 1 < P /\ P <_ ( P gcd N ) ) -> 1 < ( P gcd N ) ) )
54	46, 53	mpand 433	. . . 4 |- ( ( P e. Prime /\ N e. ZZ ) -> ( P <_ ( P gcd N ) -> 1 < ( P gcd N ) ) )
55		ltne 8400	. . . . . 6 |- ( ( 1 e. RR /\ 1 < ( P gcd N ) ) -> ( P gcd N ) =/= 1 )
56	50, 55	mpan 428	. . . . 5 |- ( 1 < ( P gcd N ) -> ( P gcd N ) =/= 1 )
57	56	a1i 9	. . . 4 |- ( ( P e. Prime /\ N e. ZZ ) -> ( 1 < ( P gcd N ) -> ( P gcd N ) =/= 1 ) )
58	44, 54, 57	3syld 57	. . 3 |- ( ( P e. Prime /\ N e. ZZ ) -> ( P || N -> ( P gcd N ) =/= 1 ) )
59	58	necon2bd 2478	. 2 |- ( ( P e. Prime /\ N e. ZZ ) -> ( ( P gcd N ) = 1 -> -. P || N ) )
60	35, 59	impbid 129	1 |- ( ( P e. Prime /\ N e. ZZ ) -> ( -. P || N <-> ( P gcd N ) = 1 ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   /\ w3a 1009   = wceq 1402   e. wcel 2209   =/= wne 2420   A.wral 2528   class class class wbr 4125   ` cfv 5372  (class class class)co 6075   RRcr 8168   0cc0 8169   1c1 8170   < clt 8350   <_ cle 8351   NNcn 9283   2c2 9334   ZZcz 9623   ZZ>=cuz 9900   || cdvds 12532   gcd cgcd 12708   Primecprime 12863

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287  ax-arch 8288  ax-caucvg 8289

This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-2o 6678  df-er 6797  df-en 7013  df-sup 7314  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-n0 9543  df-z 9624  df-uz 9901  df-q 9999  df-rp 10034  df-fz 10391  df-fzo 10528  df-fl 10683  df-mod 10738  df-seqfrec 10863  df-exp 10954  df-cj 11585  df-re 11586  df-im 11587  df-rsqrt 11742  df-abs 11743  df-dvds 12533  df-gcd 12709  df-prm 12864

This theorem is referenced by:  prmrp  12901  euclemma  12902  cncongrprm  12913  isoddgcd1  12915  phiprmpw  12978  fermltl  12990  prmdiv  12991  prmdiveq  12992  vfermltl  13008  prmpwdvds  13112  perfect1  16026  perfectlem1  16027  perfectlem2  16028  lgslem1  16033  lgsprme0  16075  gausslemma2dlem0c  16084  lgseisenlem3  16105  lgsquad2lem2  16115