Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prmind | Structured version Visualization version GIF version |
Description: Perform induction over the multiplicative structure of ℕ. If a property 𝜑(𝑥) holds for the primes and 1 and is preserved under multiplication, then it holds for every positive integer. (Contributed by Mario Carneiro, 20-Jun-2015.) |
Ref | Expression |
---|---|
prmind.1 | ⊢ (𝑥 = 1 → (𝜑 ↔ 𝜓)) |
prmind.2 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) |
prmind.3 | ⊢ (𝑥 = 𝑧 → (𝜑 ↔ 𝜃)) |
prmind.4 | ⊢ (𝑥 = (𝑦 · 𝑧) → (𝜑 ↔ 𝜏)) |
prmind.5 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜂)) |
prmind.6 | ⊢ 𝜓 |
prmind.7 | ⊢ (𝑥 ∈ ℙ → 𝜑) |
prmind.8 | ⊢ ((𝑦 ∈ (ℤ≥‘2) ∧ 𝑧 ∈ (ℤ≥‘2)) → ((𝜒 ∧ 𝜃) → 𝜏)) |
Ref | Expression |
---|---|
prmind | ⊢ (𝐴 ∈ ℕ → 𝜂) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prmind.1 | . 2 ⊢ (𝑥 = 1 → (𝜑 ↔ 𝜓)) | |
2 | prmind.2 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) | |
3 | prmind.3 | . 2 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ 𝜃)) | |
4 | prmind.4 | . 2 ⊢ (𝑥 = (𝑦 · 𝑧) → (𝜑 ↔ 𝜏)) | |
5 | prmind.5 | . 2 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜂)) | |
6 | prmind.6 | . 2 ⊢ 𝜓 | |
7 | prmind.7 | . . 3 ⊢ (𝑥 ∈ ℙ → 𝜑) | |
8 | 7 | adantr 483 | . 2 ⊢ ((𝑥 ∈ ℙ ∧ ∀𝑦 ∈ (1...(𝑥 − 1))𝜒) → 𝜑) |
9 | prmind.8 | . 2 ⊢ ((𝑦 ∈ (ℤ≥‘2) ∧ 𝑧 ∈ (ℤ≥‘2)) → ((𝜒 ∧ 𝜃) → 𝜏)) | |
10 | 1, 2, 3, 4, 5, 6, 8, 9 | prmind2 16023 | 1 ⊢ (𝐴 ∈ ℕ → 𝜂) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ‘cfv 6349 (class class class)co 7150 1c1 10532 · cmul 10536 − cmin 10864 ℕcn 11632 2c2 11686 ℤ≥cuz 12237 ...cfz 12886 ℙcprime 16009 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-2o 8097 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-sup 8900 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-3 11695 df-n0 11892 df-z 11976 df-uz 12238 df-rp 12384 df-fz 12887 df-seq 13364 df-exp 13424 df-cj 14452 df-re 14453 df-im 14454 df-sqrt 14588 df-abs 14589 df-dvds 15602 df-prm 16010 |
This theorem is referenced by: exprmfct 16042 lgsquad2lem2 25955 2sqlem6 25993 ostthlem2 26198 fmtnofac2 43725 |
Copyright terms: Public domain | W3C validator |