Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > iseqid3 | GIF version |
Description: A sequence that consists entirely of zeroes (or whatever the identity 𝑍 is for operation +) sums to zero. (Contributed by Jim Kingdon, 18-Aug-2021.) |
Ref | Expression |
---|---|
iseqid3.1 | ⊢ (𝜑 → (𝑍 + 𝑍) = 𝑍) |
iseqid3.2 | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
iseqid3.3 | ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) = 𝑍) |
iseqid3.z | ⊢ (𝜑 → 𝑍 ∈ 𝑉) |
Ref | Expression |
---|---|
iseqid3 | ⊢ (𝜑 → (seq𝑀( + , 𝐹, {𝑍})‘𝑁) = 𝑍) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iseqid3.2 | . . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
2 | iseqid3.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝑉) | |
3 | snexg 3956 | . . . 4 ⊢ (𝑍 ∈ 𝑉 → {𝑍} ∈ V) | |
4 | 2, 3 | syl 14 | . . 3 ⊢ (𝜑 → {𝑍} ∈ V) |
5 | iseqid3.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) = 𝑍) | |
6 | elsn2g 3427 | . . . . . 6 ⊢ (𝑍 ∈ 𝑉 → ((𝐹‘𝑥) ∈ {𝑍} ↔ (𝐹‘𝑥) = 𝑍)) | |
7 | 2, 6 | syl 14 | . . . . 5 ⊢ (𝜑 → ((𝐹‘𝑥) ∈ {𝑍} ↔ (𝐹‘𝑥) = 𝑍)) |
8 | 7 | adantr 270 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → ((𝐹‘𝑥) ∈ {𝑍} ↔ (𝐹‘𝑥) = 𝑍)) |
9 | 5, 8 | mpbird 165 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ {𝑍}) |
10 | iseqid3.1 | . . . . . 6 ⊢ (𝜑 → (𝑍 + 𝑍) = 𝑍) | |
11 | elsn2g 3427 | . . . . . . 7 ⊢ (𝑍 ∈ 𝑉 → ((𝑍 + 𝑍) ∈ {𝑍} ↔ (𝑍 + 𝑍) = 𝑍)) | |
12 | 2, 11 | syl 14 | . . . . . 6 ⊢ (𝜑 → ((𝑍 + 𝑍) ∈ {𝑍} ↔ (𝑍 + 𝑍) = 𝑍)) |
13 | 10, 12 | mpbird 165 | . . . . 5 ⊢ (𝜑 → (𝑍 + 𝑍) ∈ {𝑍}) |
14 | elsni 3416 | . . . . . . 7 ⊢ (𝑥 ∈ {𝑍} → 𝑥 = 𝑍) | |
15 | elsni 3416 | . . . . . . 7 ⊢ (𝑦 ∈ {𝑍} → 𝑦 = 𝑍) | |
16 | 14, 15 | oveqan12d 5551 | . . . . . 6 ⊢ ((𝑥 ∈ {𝑍} ∧ 𝑦 ∈ {𝑍}) → (𝑥 + 𝑦) = (𝑍 + 𝑍)) |
17 | 16 | eleq1d 2147 | . . . . 5 ⊢ ((𝑥 ∈ {𝑍} ∧ 𝑦 ∈ {𝑍}) → ((𝑥 + 𝑦) ∈ {𝑍} ↔ (𝑍 + 𝑍) ∈ {𝑍})) |
18 | 13, 17 | syl5ibrcom 155 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ {𝑍} ∧ 𝑦 ∈ {𝑍}) → (𝑥 + 𝑦) ∈ {𝑍})) |
19 | 18 | imp 122 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ {𝑍} ∧ 𝑦 ∈ {𝑍})) → (𝑥 + 𝑦) ∈ {𝑍}) |
20 | 1, 4, 9, 19 | iseqcl 9443 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹, {𝑍})‘𝑁) ∈ {𝑍}) |
21 | elsni 3416 | . 2 ⊢ ((seq𝑀( + , 𝐹, {𝑍})‘𝑁) ∈ {𝑍} → (seq𝑀( + , 𝐹, {𝑍})‘𝑁) = 𝑍) | |
22 | 20, 21 | syl 14 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹, {𝑍})‘𝑁) = 𝑍) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 = wceq 1284 ∈ wcel 1433 Vcvv 2601 {csn 3398 ‘cfv 4922 (class class class)co 5532 ℤ≥cuz 8619 seqcseq 9431 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 ax-cnex 7067 ax-resscn 7068 ax-1cn 7069 ax-1re 7070 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-addcom 7076 ax-addass 7078 ax-distr 7080 ax-i2m1 7081 ax-0lt1 7082 ax-0id 7084 ax-rnegex 7085 ax-cnre 7087 ax-pre-ltirr 7088 ax-pre-ltwlin 7089 ax-pre-lttrn 7090 ax-pre-ltadd 7092 |
This theorem depends on definitions: df-bi 115 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-nel 2340 df-ral 2353 df-rex 2354 df-reu 2355 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-tr 3876 df-id 4048 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-recs 5943 df-frec 6001 df-pnf 7155 df-mnf 7156 df-xr 7157 df-ltxr 7158 df-le 7159 df-sub 7281 df-neg 7282 df-inn 8040 df-n0 8289 df-z 8352 df-uz 8620 df-iseq 9432 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |