Theorem dvdsprime 12317

Description: If M divides a prime, then M is either the prime or one. (Contributed by Scott Fenton, 8-Apr-2014.)

Assertion

Ref	Expression
dvdsprime	|- ( ( P e. Prime /\ M e. NN ) -> ( M || P <-> ( M = P \/ M = 1 ) ) )

Proof of Theorem dvdsprime

Dummy variable m is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isprm2 12312	. . 3 |- ( P e. Prime <-> ( P e. ( ZZ>= ` 2 ) /\ A. m e. NN ( m || P -> ( m = 1 \/ m = P ) ) ) )
2		breq1 4037	. . . . . 6 |- ( m = M -> ( m || P <-> M || P ) )
3		eqeq1 2203	. . . . . . . 8 |- ( m = M -> ( m = 1 <-> M = 1 ) )
4		eqeq1 2203	. . . . . . . 8 |- ( m = M -> ( m = P <-> M = P ) )
5	3, 4	orbi12d 794	. . . . . . 7 |- ( m = M -> ( ( m = 1 \/ m = P ) <-> ( M = 1 \/ M = P ) ) )
6		orcom 729	. . . . . . 7 |- ( ( M = 1 \/ M = P ) <-> ( M = P \/ M = 1 ) )
7	5, 6	bitrdi 196	. . . . . 6 |- ( m = M -> ( ( m = 1 \/ m = P ) <-> ( M = P \/ M = 1 ) ) )
8	2, 7	imbi12d 234	. . . . 5 |- ( m = M -> ( ( m || P -> ( m = 1 \/ m = P ) ) <-> ( M || P -> ( M = P \/ M = 1 ) ) ) )
9	8	rspccva 2867	. . . 4 |- ( ( A. m e. NN ( m || P -> ( m = 1 \/ m = P ) ) /\ M e. NN ) -> ( M || P -> ( M = P \/ M = 1 ) ) )
10	9	adantll 476	. . 3 |- ( ( ( P e. ( ZZ>= ` 2 ) /\ A. m e. NN ( m || P -> ( m = 1 \/ m = P ) ) ) /\ M e. NN ) -> ( M || P -> ( M = P \/ M = 1 ) ) )
11	1, 10	sylanb 284	. 2 |- ( ( P e. Prime /\ M e. NN ) -> ( M || P -> ( M = P \/ M = 1 ) ) )
12		prmz 12306	. . . . . 6 |- ( P e. Prime -> P e. ZZ )
13		iddvds 11988	. . . . . 6 |- ( P e. ZZ -> P || P )
14	12, 13	syl 14	. . . . 5 |- ( P e. Prime -> P || P )
15	14	adantr 276	. . . 4 |- ( ( P e. Prime /\ M e. NN ) -> P || P )
16		breq1 4037	. . . 4 |- ( M = P -> ( M || P <-> P || P ) )
17	15, 16	syl5ibrcom 157	. . 3 |- ( ( P e. Prime /\ M e. NN ) -> ( M = P -> M || P ) )
18		1dvds 11989	. . . . . 6 |- ( P e. ZZ -> 1 || P )
19	12, 18	syl 14	. . . . 5 |- ( P e. Prime -> 1 || P )
20	19	adantr 276	. . . 4 |- ( ( P e. Prime /\ M e. NN ) -> 1 || P )
21		breq1 4037	. . . 4 |- ( M = 1 -> ( M || P <-> 1 || P ) )
22	20, 21	syl5ibrcom 157	. . 3 |- ( ( P e. Prime /\ M e. NN ) -> ( M = 1 -> M || P ) )
23	17, 22	jaod 718	. 2 |- ( ( P e. Prime /\ M e. NN ) -> ( ( M = P \/ M = 1 ) -> M || P ) )
24	11, 23	impbid 129	1 |- ( ( P e. Prime /\ M e. NN ) -> ( M || P <-> ( M = P \/ M = 1 ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 709   = wceq 1364   e. wcel 2167   A.wral 2475   class class class wbr 4034   ` cfv 5259   1c1 7899   NNcn 9009   2c2 9060   ZZcz 9345   ZZ>=cuz 9620   || cdvds 11971   Primecprime 12302

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7989  ax-resscn 7990  ax-1cn 7991  ax-1re 7992  ax-icn 7993  ax-addcl 7994  ax-addrcl 7995  ax-mulcl 7996  ax-mulrcl 7997  ax-addcom 7998  ax-mulcom 7999  ax-addass 8000  ax-mulass 8001  ax-distr 8002  ax-i2m1 8003  ax-0lt1 8004  ax-1rid 8005  ax-0id 8006  ax-rnegex 8007  ax-precex 8008  ax-cnre 8009  ax-pre-ltirr 8010  ax-pre-ltwlin 8011  ax-pre-lttrn 8012  ax-pre-apti 8013  ax-pre-ltadd 8014  ax-pre-mulgt0 8015  ax-pre-mulext 8016  ax-arch 8017  ax-caucvg 8018

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-1o 6483  df-2o 6484  df-er 6601  df-en 6809  df-pnf 8082  df-mnf 8083  df-xr 8084  df-ltxr 8085  df-le 8086  df-sub 8218  df-neg 8219  df-reap 8621  df-ap 8628  df-div 8719  df-inn 9010  df-2 9068  df-3 9069  df-4 9070  df-n0 9269  df-z 9346  df-uz 9621  df-q 9713  df-rp 9748  df-seqfrec 10559  df-exp 10650  df-cj 11026  df-re 11027  df-im 11028  df-rsqrt 11182  df-abs 11183  df-dvds 11972  df-prm 12303

This theorem is referenced by:  prm2orodd  12321  pythagtriplem4  12464  2lgs  15453