ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nprm Unicode version
Theorem nprm 12845
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.
StepHypRef Expression
1 eluzelz 9881 . . . . 5 |- ( A e. ( ZZ>= ` 2 ) -> A e. ZZ )
21adantr 276 . . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A e. ZZ )
32zred 9718 . . 3 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A e. RR )
4 eluz2b2 9953 . . . . . 6 |- ( B e. ( ZZ>= ` 2 ) <-> ( B e. NN /\ 1 < B ) )
54simprbi 275 . . . . 5 |- ( B e. ( ZZ>= ` 2 ) -> 1 < B )
65adantl 277 . . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> 1 < B )
7 eluzelz 9881 . . . . . . 7 |- ( B e. ( ZZ>= ` 2 ) -> B e. ZZ )
87adantl 277 . . . . . 6 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> B e. ZZ )
98zred 9718 . . . . 5 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> B e. RR )
10 eluz2nn 9916 . . . . . . 7 |- ( A e. ( ZZ>= ` 2 ) -> A e. NN )
1110adantr 276 . . . . . 6 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A e. NN )
1211nngt0d 9298 . . . . 5 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> 0 < A )
13 ltmulgt11 9155 . . . . 5 |- ( ( A e. RR /\ B e. RR /\ 0 < A ) -> ( 1 < B <-> A < ( A x. B ) ) )
143, 9, 12, 13syl3anc 1274 . . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> ( 1 < B <-> A < ( A x. B ) ) )
156, 14mpbid 147 . . 3 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A < ( A x. B ) )
163, 15ltned 8403 . 2 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A =/= ( A x. B ) )
17 dvdsmul1 12524 . . . . 5 |- ( ( A e. ZZ /\ B e. ZZ ) -> A || ( A x. B ) )
181, 7, 17syl2an 289 . . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> A || ( A x. B ) )
19 isprm4 12841 . . . . . . 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 ) ) ) )
2019simprbi 275 . . . . . 6 |- ( ( A x. B ) e. Prime -> A. x e. ( ZZ>= ` 2 ) ( x || ( A x. B ) -> x = ( A x. B ) ) )
21 breq1 4117 . . . . . . . 8 |- ( x = A -> ( x || ( A x. B ) <-> A || ( A x. B ) ) )
22 eqeq1 2241 . . . . . . . 8 |- ( x = A -> ( x = ( A x. B ) <-> A = ( A x. B ) ) )
2321, 22imbi12d 234 . . . . . . 7 |- ( x = A -> ( ( x || ( A x. B ) -> x = ( A x. B ) ) <-> ( A || ( A x. B ) -> A = ( A x. B ) ) ) )
2423rspcv 2919 . . . . . 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 ) ) ) )
2520, 24syl5 32 . . . . 5 |- ( A e. ( ZZ>= ` 2 ) -> ( ( A x. B ) e. Prime -> ( A || ( A x. B ) -> A = ( A x. B ) ) ) )
2625adantr 276 . . . 4 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> ( ( A x. B ) e. Prime -> ( A || ( A x. B ) -> A = ( A x. B ) ) ) )
2718, 26mpid 42 . . 3 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> ( ( A x. B ) e. Prime -> A = ( A x. B ) ) )
2827necon3ad 2456 . 2 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> ( A =/= ( A x. B ) -> -. ( A x. B ) e. Prime ) )
2916, 28mpd 13 1 |- ( ( A e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) -> -. ( A x. B ) e. Prime )
Colors of variables: wff set class
Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2205   =/= wne 2414   A.wral 2522   class class class wbr 4114   ` cfv 5357  (class class class)co 6058   RRcr 8142   0cc0 8143   1c1 8144   x. cmul 8148   < clt 8324   NNcn 9254   2c2 9305   ZZcz 9594   ZZ>=cuz 9871   || cdvds 12498   Primecprime 12829
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262  ax-caucvg 8263
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-2o 6661  df-er 6780  df-en 6989  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-n0 9514  df-z 9595  df-uz 9872  df-q 9970  df-rp 10005  df-seqfrec 10834  df-exp 10925  df-cj 11552  df-re 11553  df-im 11554  df-rsqrt 11708  df-abs 11709  df-dvds 12499  df-prm 12830
This theorem is referenced by:  nprmi  12846  dvdsnprmd  12847  sqnprm  12858  mersenne  15991
  Copyright terms: Public domain W3C validator