Theorem exprmfct 12942

Description: Every integer greater than or equal to 2 has a prime factor. (Contributed by Paul Chapman, 26-Oct-2012.) (Proof shortened by Mario Carneiro, 20-Jun-2015.)

Assertion

Ref	Expression
exprmfct	|- ( N e. ( ZZ>= ` 2 ) -> E. p e. Prime p || N )

Distinct variable group:   N, p

Proof of Theorem exprmfct

Dummy variables x y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eluz2nn 9982	. 2 |- ( N e. ( ZZ>= ` 2 ) -> N e. NN )
2		eleq1 2301	. . . 4 |- ( x = 1 -> ( x e. ( ZZ>= ` 2 ) <-> 1 e. ( ZZ>= ` 2 ) ) )
3	2	imbi1d 231	. . 3 |- ( x = 1 -> ( ( x e. ( ZZ>= ` 2 ) -> E. p e. Prime p || x ) <-> ( 1 e. ( ZZ>= ` 2 ) -> E. p e. Prime p || x ) ) )
4		eleq1 2301	. . . 4 |- ( x = y -> ( x e. ( ZZ>= ` 2 ) <-> y e. ( ZZ>= ` 2 ) ) )
5		breq2 4135	. . . . 5 |- ( x = y -> ( p || x <-> p || y ) )
6	5	rexbidv 2551	. . . 4 |- ( x = y -> ( E. p e. Prime p || x <-> E. p e. Prime p || y ) )
7	4, 6	imbi12d 234	. . 3 |- ( x = y -> ( ( x e. ( ZZ>= ` 2 ) -> E. p e. Prime p || x ) <-> ( y e. ( ZZ>= ` 2 ) -> E. p e. Prime p || y ) ) )
8		eleq1 2301	. . . 4 |- ( x = z -> ( x e. ( ZZ>= ` 2 ) <-> z e. ( ZZ>= ` 2 ) ) )
9		breq2 4135	. . . . 5 |- ( x = z -> ( p || x <-> p || z ) )
10	9	rexbidv 2551	. . . 4 |- ( x = z -> ( E. p e. Prime p || x <-> E. p e. Prime p || z ) )
11	8, 10	imbi12d 234	. . 3 |- ( x = z -> ( ( x e. ( ZZ>= ` 2 ) -> E. p e. Prime p || x ) <-> ( z e. ( ZZ>= ` 2 ) -> E. p e. Prime p || z ) ) )
12		eleq1 2301	. . . 4 |- ( x = ( y x. z ) -> ( x e. ( ZZ>= ` 2 ) <-> ( y x. z ) e. ( ZZ>= ` 2 ) ) )
13		breq2 4135	. . . . 5 |- ( x = ( y x. z ) -> ( p || x <-> p || ( y x. z ) ) )
14	13	rexbidv 2551	. . . 4 |- ( x = ( y x. z ) -> ( E. p e. Prime p || x <-> E. p e. Prime p || ( y x. z ) ) )
15	12, 14	imbi12d 234	. . 3 |- ( x = ( y x. z ) -> ( ( x e. ( ZZ>= ` 2 ) -> E. p e. Prime p || x ) <-> ( ( y x. z ) e. ( ZZ>= ` 2 ) -> E. p e. Prime p || ( y x. z ) ) ) )
16		eleq1 2301	. . . 4 |- ( x = N -> ( x e. ( ZZ>= ` 2 ) <-> N e. ( ZZ>= ` 2 ) ) )
17		breq2 4135	. . . . 5 |- ( x = N -> ( p || x <-> p || N ) )
18	17	rexbidv 2551	. . . 4 |- ( x = N -> ( E. p e. Prime p || x <-> E. p e. Prime p || N ) )
19	16, 18	imbi12d 234	. . 3 |- ( x = N -> ( ( x e. ( ZZ>= ` 2 ) -> E. p e. Prime p || x ) <-> ( N e. ( ZZ>= ` 2 ) -> E. p e. Prime p || N ) ) )
20		1m1e0 9382	. . . . 5 |- ( 1 - 1 ) = 0
21		uz2m1nn 10021	. . . . 5 |- ( 1 e. ( ZZ>= ` 2 ) -> ( 1 - 1 ) e. NN )
22	20, 21	eqeltrrid 2326	. . . 4 |- ( 1 e. ( ZZ>= ` 2 ) -> 0 e. NN )
23		0nnn 9340	. . . . 5 |- -. 0 e. NN
24	23	pm2.21i 655	. . . 4 |- ( 0 e. NN -> E. p e. Prime p || x )
25	22, 24	syl 14	. . 3 |- ( 1 e. ( ZZ>= ` 2 ) -> E. p e. Prime p || x )
26		prmz 12914	. . . . . 6 |- ( x e. Prime -> x e. ZZ )
27		iddvds 12596	. . . . . 6 |- ( x e. ZZ -> x || x )
28	26, 27	syl 14	. . . . 5 |- ( x e. Prime -> x || x )
29		breq1 4134	. . . . . 6 |- ( p = x -> ( p || x <-> x || x ) )
30	29	rspcev 2929	. . . . 5 |- ( ( x e. Prime /\ x || x ) -> E. p e. Prime p || x )
31	28, 30	mpdan 425	. . . 4 |- ( x e. Prime -> E. p e. Prime p || x )
32	31	a1d 22	. . 3 |- ( x e. Prime -> ( x e. ( ZZ>= ` 2 ) -> E. p e. Prime p || x ) )
33		simpl 109	. . . . . 6 |- ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) -> y e. ( ZZ>= ` 2 ) )
34		eluzelz 9947	. . . . . . . . . 10 |- ( y e. ( ZZ>= ` 2 ) -> y e. ZZ )
35	34	ad2antrr 492	. . . . . . . . 9 |- ( ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) /\ p e. Prime ) -> y e. ZZ )
36		eluzelz 9947	. . . . . . . . . 10 |- ( z e. ( ZZ>= ` 2 ) -> z e. ZZ )
37	36	ad2antlr 493	. . . . . . . . 9 |- ( ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) /\ p e. Prime ) -> z e. ZZ )
38		dvdsmul1 12605	. . . . . . . . 9 |- ( ( y e. ZZ /\ z e. ZZ ) -> y || ( y x. z ) )
39	35, 37, 38	syl2anc 415	. . . . . . . 8 |- ( ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) /\ p e. Prime ) -> y || ( y x. z ) )
40		prmz 12914	. . . . . . . . . 10 |- ( p e. Prime -> p e. ZZ )
41	40	adantl 277	. . . . . . . . 9 |- ( ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) /\ p e. Prime ) -> p e. ZZ )
42	35, 37	zmulcld 9785	. . . . . . . . 9 |- ( ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) /\ p e. Prime ) -> ( y x. z ) e. ZZ )
43		dvdstr 12620	. . . . . . . . 9 |- ( ( p e. ZZ /\ y e. ZZ /\ ( y x. z ) e. ZZ ) -> ( ( p || y /\ y || ( y x. z ) ) -> p || ( y x. z ) ) )
44	41, 35, 42, 43	syl3anc 1278	. . . . . . . 8 |- ( ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) /\ p e. Prime ) -> ( ( p || y /\ y || ( y x. z ) ) -> p || ( y x. z ) ) )
45	39, 44	mpan2d 432	. . . . . . 7 |- ( ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) /\ p e. Prime ) -> ( p || y -> p || ( y x. z ) ) )
46	45	reximdva 2652	. . . . . 6 |- ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) -> ( E. p e. Prime p || y -> E. p e. Prime p || ( y x. z ) ) )
47	33, 46	embantd 56	. . . . 5 |- ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) -> ( ( y e. ( ZZ>= ` 2 ) -> E. p e. Prime p || y ) -> E. p e. Prime p || ( y x. z ) ) )
48	47	a1dd 48	. . . 4 |- ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) -> ( ( y e. ( ZZ>= ` 2 ) -> E. p e. Prime p || y ) -> ( ( y x. z ) e. ( ZZ>= ` 2 ) -> E. p e. Prime p || ( y x. z ) ) ) )
49	48	adantrd 279	. . 3 |- ( ( y e. ( ZZ>= ` 2 ) /\ z e. ( ZZ>= ` 2 ) ) -> ( ( ( y e. ( ZZ>= ` 2 ) -> E. p e. Prime p || y ) /\ ( z e. ( ZZ>= ` 2 ) -> E. p e. Prime p || z ) ) -> ( ( y x. z ) e. ( ZZ>= ` 2 ) -> E. p e. Prime p || ( y x. z ) ) ) )
50	3, 7, 11, 15, 19, 25, 32, 49	prmind 12924	. 2 |- ( N e. NN -> ( N e. ( ZZ>= ` 2 ) -> E. p e. Prime p || N ) )
51	1, 50	mpcom 36	1 |- ( N e. ( ZZ>= ` 2 ) -> E. p e. Prime p || N )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   E.wrex 2529   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   0cc0 8185   1c1 8186   x. cmul 8190   - cmin 8504   NNcn 9313   2c2 9364   ZZcz 9655   ZZ>=cuz 9937   || cdvds 12579   Primecprime 12910

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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305

This proof depends on definitions:  df-bi 117  df-stab 843  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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-1o 6691  df-2o 6692  df-er 6811  df-en 7027  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-fz 10429  df-fzo 10567  df-fl 10722  df-mod 10781  df-seqfrec 10906  df-exp 10997  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-dvds 12580  df-prm 12911

This theorem is used by:  prmdvdsfz  12943  isprm5lem  12945  rpexp  12957  pc2dvds  13138  oddprmdvds  13162  prmunb  13170  lgsne0  16362