Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > isummolemnm | GIF version |
Description: Lemma for summodc 11120. (Contributed by Jim Kingdon, 15-Aug-2022.) |
Ref | Expression |
---|---|
isummo.1 | ⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 0)) |
isummo.2 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
isummolem3.5 | ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ)) |
isummolem3.6 | ⊢ (𝜑 → 𝑓:(1...𝑀)–1-1-onto→𝐴) |
isummolem3.7 | ⊢ (𝜑 → 𝐾:(1...𝑁)–1-1-onto→𝐴) |
Ref | Expression |
---|---|
isummolemnm | ⊢ (𝜑 → 𝑁 = 𝑀) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1zzd 9049 | . . . 4 ⊢ (𝜑 → 1 ∈ ℤ) | |
2 | isummolem3.5 | . . . . . 6 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ)) | |
3 | 2 | simprd 113 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
4 | 3 | nnzd 9140 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
5 | 1, 4 | fzfigd 10172 | . . 3 ⊢ (𝜑 → (1...𝑁) ∈ Fin) |
6 | isummolem3.6 | . . . . 5 ⊢ (𝜑 → 𝑓:(1...𝑀)–1-1-onto→𝐴) | |
7 | f1ocnv 5348 | . . . . 5 ⊢ (𝑓:(1...𝑀)–1-1-onto→𝐴 → ◡𝑓:𝐴–1-1-onto→(1...𝑀)) | |
8 | 6, 7 | syl 14 | . . . 4 ⊢ (𝜑 → ◡𝑓:𝐴–1-1-onto→(1...𝑀)) |
9 | isummolem3.7 | . . . 4 ⊢ (𝜑 → 𝐾:(1...𝑁)–1-1-onto→𝐴) | |
10 | f1oco 5358 | . . . 4 ⊢ ((◡𝑓:𝐴–1-1-onto→(1...𝑀) ∧ 𝐾:(1...𝑁)–1-1-onto→𝐴) → (◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀)) | |
11 | 8, 9, 10 | syl2anc 408 | . . 3 ⊢ (𝜑 → (◡𝑓 ∘ 𝐾):(1...𝑁)–1-1-onto→(1...𝑀)) |
12 | 5, 11 | fihasheqf1od 10504 | . 2 ⊢ (𝜑 → (♯‘(1...𝑁)) = (♯‘(1...𝑀))) |
13 | nnnn0 8952 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
14 | hashfz1 10497 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (♯‘(1...𝑁)) = 𝑁) | |
15 | 3, 13, 14 | 3syl 17 | . 2 ⊢ (𝜑 → (♯‘(1...𝑁)) = 𝑁) |
16 | 2 | simpld 111 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
17 | nnnn0 8952 | . . 3 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ0) | |
18 | hashfz1 10497 | . . 3 ⊢ (𝑀 ∈ ℕ0 → (♯‘(1...𝑀)) = 𝑀) | |
19 | 16, 17, 18 | 3syl 17 | . 2 ⊢ (𝜑 → (♯‘(1...𝑀)) = 𝑀) |
20 | 12, 15, 19 | 3eqtr3d 2158 | 1 ⊢ (𝜑 → 𝑁 = 𝑀) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1316 ∈ wcel 1465 ifcif 3444 ↦ cmpt 3959 ◡ccnv 4508 ∘ ccom 4513 –1-1-onto→wf1o 5092 ‘cfv 5093 (class class class)co 5742 ℂcc 7586 0cc0 7588 1c1 7589 ℕcn 8688 ℕ0cn0 8945 ℤcz 9022 ...cfz 9758 ♯chash 10489 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-coll 4013 ax-sep 4016 ax-nul 4024 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 ax-iinf 4472 ax-cnex 7679 ax-resscn 7680 ax-1cn 7681 ax-1re 7682 ax-icn 7683 ax-addcl 7684 ax-addrcl 7685 ax-mulcl 7686 ax-addcom 7688 ax-addass 7690 ax-distr 7692 ax-i2m1 7693 ax-0lt1 7694 ax-0id 7696 ax-rnegex 7697 ax-cnre 7699 ax-pre-ltirr 7700 ax-pre-ltwlin 7701 ax-pre-lttrn 7702 ax-pre-apti 7703 ax-pre-ltadd 7704 |
This theorem depends on definitions: df-bi 116 df-dc 805 df-3or 948 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-nel 2381 df-ral 2398 df-rex 2399 df-reu 2400 df-rab 2402 df-v 2662 df-sbc 2883 df-csb 2976 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-nul 3334 df-if 3445 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-int 3742 df-iun 3785 df-br 3900 df-opab 3960 df-mpt 3961 df-tr 3997 df-id 4185 df-iord 4258 df-on 4260 df-ilim 4261 df-suc 4263 df-iom 4475 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-res 4521 df-ima 4522 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-f1 5098 df-fo 5099 df-f1o 5100 df-fv 5101 df-riota 5698 df-ov 5745 df-oprab 5746 df-mpo 5747 df-1st 6006 df-2nd 6007 df-recs 6170 df-frec 6256 df-1o 6281 df-er 6397 df-en 6603 df-dom 6604 df-fin 6605 df-pnf 7770 df-mnf 7771 df-xr 7772 df-ltxr 7773 df-le 7774 df-sub 7903 df-neg 7904 df-inn 8689 df-n0 8946 df-z 9023 df-uz 9295 df-fz 9759 df-ihash 10490 |
This theorem is referenced by: summodclem3 11117 |
Copyright terms: Public domain | W3C validator |