Theorem nprm 12901

Description: A product of two integers greater than one is composite. (Contributed by Mario Carneiro, 20-Jun-2015.)

Assertion

Ref	Expression
nprm	|- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> -. ( A x. B ) e. Prime )

Proof of Theorem nprm

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eluzelz 9931	. . . . 5 |- ( A e. ( ZZ>= ` 2 ) -> A e. ZZ )
2	1	adantr 276	. . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A e. ZZ )
3	2	zred 9768	. . 3 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A e. RR )
4		eluz2b2 10003	. . . . . 6 |- ( B e. ( ZZ>= ` 2 ) <-> ( B e. NN /\ 1 < B ) )
5	4	simprbi 275	. . . . 5 |- ( B e. ( ZZ>= ` 2 ) -> 1 < B )
6	5	adantl 277	. . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> 1 < B )
7		eluzelz 9931	. . . . . . 7 |- ( B e. ( ZZ>= ` 2 ) -> B e. ZZ )
8	7	adantl 277	. . . . . 6 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> B e. ZZ )
9	8	zred 9768	. . . . 5 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> B e. RR )
10		eluz2nn 9966	. . . . . . 7 |- ( A e. ( ZZ>= ` 2 ) -> A e. NN )
11	10	adantr 276	. . . . . 6 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A e. NN )
12	11	nngt0d 9348	. . . . 5 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> 0 < A )
13		ltmulgt11 9194	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ 0 < A ) -> ( 1 < B <-> A < ( A x. B ) ) )
14	3, 9, 12, 13	syl3anc 1278	. . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> ( 1 < B <-> A < ( A x. B ) ) )
15	6, 14	mpbid 147	. . 3 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A < ( A x. B ) )
16	3, 15	ltned 8439	. 2 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A =/= ( A x. B ) )
17		dvdsmul1 12580	. . . . 5 |- ( ( A e. ZZ /\ B e. ZZ ) -> A || ( A x. B ) )
18	1, 7, 17	syl2an 289	. . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A || ( A x. B ) )
19		isprm4 12897	. . . . . . 7 |- ( ( A x. B ) e. Prime <-> ( ( A x. B ) e. ( ZZ>= ` 2 ) /\ A. x e. ( ZZ>= ` 2 ) ( x || ( A x. B ) -> x = ( A x. B ) ) ) )
20	19	simprbi 275	. . . . . 6 |- ( ( A x. B ) e. Prime -> A. x e. ( ZZ>= ` 2 ) ( x || ( A x. B ) -> x = ( A x. B ) ) )
21		breq1 4133	. . . . . . . 8 |- ( x = A -> ( x || ( A x. B ) <-> A || ( A x. B ) ) )
22		eqeq1 2245	. . . . . . . 8 |- ( x = A -> ( x = ( A x. B ) <-> A = ( A x. B ) ) )
23	21, 22	imbi12d 234	. . . . . . 7 |- ( x = A -> ( ( x || ( A x. B ) -> x = ( A x. B ) ) <-> ( A || ( A x. B ) -> A = ( A x. B ) ) ) )
24	23	rspcv 2925	. . . . . 6 |- ( A e. ( ZZ>= ` 2 ) -> ( A. x e. ( ZZ>= ` 2 ) ( x || ( A x. B ) -> x = ( A x. B ) ) -> ( A || ( A x. B ) -> A = ( A x. B ) ) ) )
25	20, 24	syl5 32	. . . . 5 |- ( A e. ( ZZ>= ` 2 ) -> ( ( A x. B ) e. Prime -> ( A || ( A x. B ) -> A = ( A x. B ) ) ) )
26	25	adantr 276	. . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> ( ( A x. B ) e. Prime -> ( A || ( A x. B ) -> A = ( A x. B ) ) ) )
27	18, 26	mpid 42	. . 3 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> ( ( A x. B ) e. Prime -> A = ( A x. B ) ) )
28	27	necon3ad 2462	. 2 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> ( A =/= ( A x. B ) -> -. ( A x. B ) e. Prime ) )
29	16, 28	mpd 13	1 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> -. ( A x. B ) e. Prime )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   =/= wne 2420   A.wral 2528   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   RRcr 8178   0cc0 8179   1c1 8180   x. cmul 8184   < clt 8360   NNcn 9304   2c2 9355   ZZcz 9644   ZZ>=cuz 9921   || cdvds 12554   Primecprime 12885

This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299

This proof 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 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-2o 6688  df-er 6807  df-en 7023  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-seqfrec 10885  df-exp 10976  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-dvds 12555  df-prm 12886

This theorem is used by:  nprmi  12902  dvdsnprmd  12903  sqnprm  12914  mersenne  16111