| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 4sqlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for 4sq 17171. The set 𝑆 is the set of all numbers that are expressible as a sum of four squares. Our goal is to show that 𝑆 = ℕ0; here we show one subset direction. (Contributed by Mario Carneiro, 14-Jul-2014.) |
| Ref | Expression |
|---|---|
| 4sq.1 | ⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))} |
| Ref | Expression |
|---|---|
| 4sqlem1 | ⊢ 𝑆 ⊆ ℕ0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 4sq.1 | . 2 ⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))} | |
| 2 | zsqcl2 14308 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → (𝑥↑2) ∈ ℕ0) | |
| 3 | zsqcl2 14308 | . . . . . . . 8 ⊢ (𝑦 ∈ ℤ → (𝑦↑2) ∈ ℕ0) | |
| 4 | nn0addcl 12668 | . . . . . . . 8 ⊢ (((𝑥↑2) ∈ ℕ0 ∧ (𝑦↑2) ∈ ℕ0) → ((𝑥↑2) + (𝑦↑2)) ∈ ℕ0) | |
| 5 | 2, 3, 4 | syl2an 608 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑥↑2) + (𝑦↑2)) ∈ ℕ0) |
| 6 | zsqcl2 14308 | . . . . . . . 8 ⊢ (𝑧 ∈ ℤ → (𝑧↑2) ∈ ℕ0) | |
| 7 | zsqcl2 14308 | . . . . . . . 8 ⊢ (𝑤 ∈ ℤ → (𝑤↑2) ∈ ℕ0) | |
| 8 | nn0addcl 12668 | . . . . . . . 8 ⊢ (((𝑧↑2) ∈ ℕ0 ∧ (𝑤↑2) ∈ ℕ0) → ((𝑧↑2) + (𝑤↑2)) ∈ ℕ0) | |
| 9 | 6, 7, 8 | syl2an 608 | . . . . . . 7 ⊢ ((𝑧 ∈ ℤ ∧ 𝑤 ∈ ℤ) → ((𝑧↑2) + (𝑤↑2)) ∈ ℕ0) |
| 10 | nn0addcl 12668 | . . . . . . 7 ⊢ ((((𝑥↑2) + (𝑦↑2)) ∈ ℕ0 ∧ ((𝑧↑2) + (𝑤↑2)) ∈ ℕ0) → (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2))) ∈ ℕ0) | |
| 11 | 5, 9, 10 | syl2an 608 | . . . . . 6 ⊢ (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑧 ∈ ℤ ∧ 𝑤 ∈ ℤ)) → (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2))) ∈ ℕ0) |
| 12 | eleq1a 2859 | . . . . . 6 ⊢ ((((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2))) ∈ ℕ0 → (𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2))) → 𝑛 ∈ ℕ0)) | |
| 13 | 11, 12 | syl 18 | . . . . 5 ⊢ (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑧 ∈ ℤ ∧ 𝑤 ∈ ℤ)) → (𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2))) → 𝑛 ∈ ℕ0)) |
| 14 | 13 | rexlimdvva 3223 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2))) → 𝑛 ∈ ℕ0)) |
| 15 | 14 | rexlimivv 3208 | . . 3 ⊢ (∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2))) → 𝑛 ∈ ℕ0) |
| 16 | 15 | abssi 3996 | . 2 ⊢ {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))} ⊆ ℕ0 |
| 17 | 1, 16 | eqsstri 3959 | 1 ⊢ 𝑆 ⊆ ℕ0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {cab 2741 ∃wrex 3090 ⊆ wss 3900 (class class class)co 7443 + caddc 11230 2c2 12424 ℕ0cn0 12633 ℤcz 12720 ↑cexp 14231 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-n0 12634 df-z 12721 df-uz 12993 df-seq 14172 df-exp 14232 |
| This theorem is used by: 4sqlem19 17170 |
| Copyright terms: Public domain | W3C validator |