Theorem isprm4 12915

Description: The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only divisor greater than or equal to 2 is itself. (Contributed by Paul Chapman, 26-Oct-2012.)

Assertion

Ref	Expression
isprm4	|- ( P e. Prime <-> ( P e. ( ZZ>= ` 2 ) /\ A. z e. ( ZZ>= ` 2 ) ( z || P -> z = P ) ) )

Distinct variable group:   z, P

Proof of Theorem isprm4

Step	Hyp	Ref	Expression
1		isprm2 12913	. 2 |- ( P e. Prime <-> ( P e. ( ZZ>= ` 2 ) /\ A. z e. NN ( z || P -> ( z = 1 \/ z = P ) ) ) )
2		eluz2nn 9976	. . . . . . . 8 |- ( z e. ( ZZ>= ` 2 ) -> z e. NN )
3	2	pm4.71ri 396	. . . . . . 7 |- ( z e. ( ZZ>= ` 2 ) <-> ( z e. NN /\ z e. ( ZZ>= ` 2 ) ) )
4	3	imbi1i 238	. . . . . 6 |- ( ( z e. ( ZZ>= ` 2 ) -> ( z || P -> z = P ) ) <-> ( ( z e. NN /\ z e. ( ZZ>= ` 2 ) ) -> ( z || P -> z = P ) ) )
5		impexp 263	. . . . . 6 |- ( ( ( z e. NN /\ z e. ( ZZ>= ` 2 ) ) -> ( z || P -> z = P ) ) <-> ( z e. NN -> ( z e. ( ZZ>= ` 2 ) -> ( z || P -> z = P ) ) ) )
6	4, 5	bitri 184	. . . . 5 |- ( ( z e. ( ZZ>= ` 2 ) -> ( z || P -> z = P ) ) <-> ( z e. NN -> ( z e. ( ZZ>= ` 2 ) -> ( z || P -> z = P ) ) ) )
7		eluz2b3 10014	. . . . . . . 8 |- ( z e. ( ZZ>= ` 2 ) <-> ( z e. NN /\ z =/= 1 ) )
8	7	imbi1i 238	. . . . . . 7 |- ( ( z e. ( ZZ>= ` 2 ) -> ( z || P -> z = P ) ) <-> ( ( z e. NN /\ z =/= 1 ) -> ( z || P -> z = P ) ) )
9		impexp 263	. . . . . . . 8 |- ( ( ( z e. NN /\ z =/= 1 ) -> ( z || P -> z = P ) ) <-> ( z e. NN -> ( z =/= 1 -> ( z || P -> z = P ) ) ) )
10		bi2.04 248	. . . . . . . . . 10 |- ( ( z =/= 1 -> ( z || P -> z = P ) ) <-> ( z || P -> ( z =/= 1 -> z = P ) ) )
11		df-ne 2421	. . . . . . . . . . . . 13 |- ( z =/= 1 <-> -. z = 1 )
12	11	imbi1i 238	. . . . . . . . . . . 12 |- ( ( z =/= 1 -> z = P ) <-> ( -. z = 1 -> z = P ) )
13		nnz 9668	. . . . . . . . . . . . . 14 |- ( z e. NN -> z e. ZZ )
14		1zzd 9676	. . . . . . . . . . . . . 14 |- ( z e. NN -> 1 e. ZZ )
15		zdceq 9725	. . . . . . . . . . . . . 14 |- ( ( z e. ZZ /\ 1 e. ZZ ) -> DECID z = 1 )
16	13, 14, 15	syl2anc 415	. . . . . . . . . . . . 13 |- ( z e. NN -> DECID z = 1 )
17		dfordc 904	. . . . . . . . . . . . 13 |- (DECID z = 1 -> ( ( z = 1 \/ z = P ) <-> ( -. z = 1 -> z = P ) ) )
18	16, 17	syl 14	. . . . . . . . . . . 12 |- ( z e. NN -> ( ( z = 1 \/ z = P ) <-> ( -. z = 1 -> z = P ) ) )
19	12, 18	bitr4id 199	. . . . . . . . . . 11 |- ( z e. NN -> ( ( z =/= 1 -> z = P ) <-> ( z = 1 \/ z = P ) ) )
20	19	imbi2d 230	. . . . . . . . . 10 |- ( z e. NN -> ( ( z || P -> ( z =/= 1 -> z = P ) ) <-> ( z || P -> ( z = 1 \/ z = P ) ) ) )
21	10, 20	bitrid 192	. . . . . . . . 9 |- ( z e. NN -> ( ( z =/= 1 -> ( z || P -> z = P ) ) <-> ( z || P -> ( z = 1 \/ z = P ) ) ) )
22	21	imbi2d 230	. . . . . . . 8 |- ( z e. NN -> ( ( z e. NN -> ( z =/= 1 -> ( z || P -> z = P ) ) ) <-> ( z e. NN -> ( z || P -> ( z = 1 \/ z = P ) ) ) ) )
23	9, 22	bitrid 192	. . . . . . 7 |- ( z e. NN -> ( ( ( z e. NN /\ z =/= 1 ) -> ( z || P -> z = P ) ) <-> ( z e. NN -> ( z || P -> ( z = 1 \/ z = P ) ) ) ) )
24	8, 23	bitrid 192	. . . . . 6 |- ( z e. NN -> ( ( z e. ( ZZ>= ` 2 ) -> ( z || P -> z = P ) ) <-> ( z e. NN -> ( z || P -> ( z = 1 \/ z = P ) ) ) ) )
25	24	pm5.74i 180	. . . . 5 |- ( ( z e. NN -> ( z e. ( ZZ>= ` 2 ) -> ( z || P -> z = P ) ) ) <-> ( z e. NN -> ( z e. NN -> ( z || P -> ( z = 1 \/ z = P ) ) ) ) )
26		pm5.4 249	. . . . 5 |- ( ( z e. NN -> ( z e. NN -> ( z || P -> ( z = 1 \/ z = P ) ) ) ) <-> ( z e. NN -> ( z || P -> ( z = 1 \/ z = P ) ) ) )
27	6, 25, 26	3bitri 206	. . . 4 |- ( ( z e. ( ZZ>= ` 2 ) -> ( z || P -> z = P ) ) <-> ( z e. NN -> ( z || P -> ( z = 1 \/ z = P ) ) ) )
28	27	ralbii2 2560	. . 3 |- ( A. z e. ( ZZ>= ` 2 ) ( z || P -> z = P ) <-> A. z e. NN ( z || P -> ( z = 1 \/ z = P ) ) )
29	28	anbi2i 461	. 2 |- ( ( P e. ( ZZ>= ` 2 ) /\ A. z e. ( ZZ>= ` 2 ) ( z || P -> z = P ) ) <-> ( P e. ( ZZ>= ` 2 ) /\ A. z e. NN ( z || P -> ( z = 1 \/ z = P ) ) ) )
30	1, 29	bitr4i 187	1 |- ( P e. Prime <-> ( P e. ( ZZ>= ` 2 ) /\ A. z e. ( ZZ>= ` 2 ) ( z || P -> z = P ) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720  DECID wdc 846   = wceq 1402   e. wcel 2209   =/= wne 2420   A.wral 2528   class class class wbr 4130   ` cfv 5377   1c1 8181   NNcn 9307   2c2 9358   ZZcz 9649   ZZ>=cuz 9931   || cdvds 12572   Primecprime 12903

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 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-mulrcl 8279  ax-addcom 8280  ax-mulcom 8281  ax-addass 8282  ax-mulass 8283  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-1rid 8287  ax-0id 8288  ax-rnegex 8289  ax-precex 8290  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-apti 8295  ax-pre-ltadd 8296  ax-pre-mulgt0 8297  ax-pre-mulext 8298  ax-arch 8299  ax-caucvg 8300

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 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-reap 8906  df-ap 8913  df-div 9006  df-inn 9308  df-2 9366  df-3 9367  df-4 9368  df-n0 9569  df-z 9650  df-uz 9932  df-q 10030  df-rp 10066  df-seqfrec 10899  df-exp 10990  df-cj 11622  df-re 11623  df-im 11624  df-rsqrt 11779  df-abs 11780  df-dvds 12573  df-prm 12904

This theorem is used by:  nprm  12919  prmuz2  12928  dvdsprm  12934