| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > zfz1isolemsplit | GIF version | ||
| Description: Lemma for zfz1iso 11058. Removing one element from an integer range. (Contributed by Jim Kingdon, 8-Sep-2022.) |
| Ref | Expression |
|---|---|
| zfz1isolemsplit.xf | ⊢ (𝜑 → 𝑋 ∈ Fin) |
| zfz1isolemsplit.mx | ⊢ (𝜑 → 𝑀 ∈ 𝑋) |
| Ref | Expression |
|---|---|
| zfz1isolemsplit | ⊢ (𝜑 → (1...(♯‘𝑋)) = ((1...(♯‘(𝑋 ∖ {𝑀}))) ∪ {(♯‘𝑋)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1zzd 9469 | . . 3 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 2 | zfz1isolemsplit.xf | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ Fin) | |
| 3 | zfz1isolemsplit.mx | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝑋) | |
| 4 | diffisn 7051 | . . . . . 6 ⊢ ((𝑋 ∈ Fin ∧ 𝑀 ∈ 𝑋) → (𝑋 ∖ {𝑀}) ∈ Fin) | |
| 5 | 2, 3, 4 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑋 ∖ {𝑀}) ∈ Fin) |
| 6 | hashcl 10998 | . . . . 5 ⊢ ((𝑋 ∖ {𝑀}) ∈ Fin → (♯‘(𝑋 ∖ {𝑀})) ∈ ℕ0) | |
| 7 | 5, 6 | syl 14 | . . . 4 ⊢ (𝜑 → (♯‘(𝑋 ∖ {𝑀})) ∈ ℕ0) |
| 8 | nn0uz 9753 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
| 9 | 1m1e0 9175 | . . . . . 6 ⊢ (1 − 1) = 0 | |
| 10 | 9 | fveq2i 5629 | . . . . 5 ⊢ (ℤ≥‘(1 − 1)) = (ℤ≥‘0) |
| 11 | 8, 10 | eqtr4i 2253 | . . . 4 ⊢ ℕ0 = (ℤ≥‘(1 − 1)) |
| 12 | 7, 11 | eleqtrdi 2322 | . . 3 ⊢ (𝜑 → (♯‘(𝑋 ∖ {𝑀})) ∈ (ℤ≥‘(1 − 1))) |
| 13 | fzsuc2 10271 | . . 3 ⊢ ((1 ∈ ℤ ∧ (♯‘(𝑋 ∖ {𝑀})) ∈ (ℤ≥‘(1 − 1))) → (1...((♯‘(𝑋 ∖ {𝑀})) + 1)) = ((1...(♯‘(𝑋 ∖ {𝑀}))) ∪ {((♯‘(𝑋 ∖ {𝑀})) + 1)})) | |
| 14 | 1, 12, 13 | syl2anc 411 | . 2 ⊢ (𝜑 → (1...((♯‘(𝑋 ∖ {𝑀})) + 1)) = ((1...(♯‘(𝑋 ∖ {𝑀}))) ∪ {((♯‘(𝑋 ∖ {𝑀})) + 1)})) |
| 15 | hashdifsn 11036 | . . . . . 6 ⊢ ((𝑋 ∈ Fin ∧ 𝑀 ∈ 𝑋) → (♯‘(𝑋 ∖ {𝑀})) = ((♯‘𝑋) − 1)) | |
| 16 | 2, 3, 15 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (♯‘(𝑋 ∖ {𝑀})) = ((♯‘𝑋) − 1)) |
| 17 | 16 | oveq1d 6015 | . . . 4 ⊢ (𝜑 → ((♯‘(𝑋 ∖ {𝑀})) + 1) = (((♯‘𝑋) − 1) + 1)) |
| 18 | hashcl 10998 | . . . . . . 7 ⊢ (𝑋 ∈ Fin → (♯‘𝑋) ∈ ℕ0) | |
| 19 | 2, 18 | syl 14 | . . . . . 6 ⊢ (𝜑 → (♯‘𝑋) ∈ ℕ0) |
| 20 | 19 | nn0cnd 9420 | . . . . 5 ⊢ (𝜑 → (♯‘𝑋) ∈ ℂ) |
| 21 | 1cnd 8158 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℂ) | |
| 22 | 20, 21 | npcand 8457 | . . . 4 ⊢ (𝜑 → (((♯‘𝑋) − 1) + 1) = (♯‘𝑋)) |
| 23 | 17, 22 | eqtrd 2262 | . . 3 ⊢ (𝜑 → ((♯‘(𝑋 ∖ {𝑀})) + 1) = (♯‘𝑋)) |
| 24 | 23 | oveq2d 6016 | . 2 ⊢ (𝜑 → (1...((♯‘(𝑋 ∖ {𝑀})) + 1)) = (1...(♯‘𝑋))) |
| 25 | 23 | sneqd 3679 | . . 3 ⊢ (𝜑 → {((♯‘(𝑋 ∖ {𝑀})) + 1)} = {(♯‘𝑋)}) |
| 26 | 25 | uneq2d 3358 | . 2 ⊢ (𝜑 → ((1...(♯‘(𝑋 ∖ {𝑀}))) ∪ {((♯‘(𝑋 ∖ {𝑀})) + 1)}) = ((1...(♯‘(𝑋 ∖ {𝑀}))) ∪ {(♯‘𝑋)})) |
| 27 | 14, 24, 26 | 3eqtr3d 2270 | 1 ⊢ (𝜑 → (1...(♯‘𝑋)) = ((1...(♯‘(𝑋 ∖ {𝑀}))) ∪ {(♯‘𝑋)})) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 ∖ cdif 3194 ∪ cun 3195 {csn 3666 ‘cfv 5317 (class class class)co 6000 Fincfn 6885 0cc0 7995 1c1 7996 + caddc 7998 − cmin 8313 ℕ0cn0 9365 ℤcz 9442 ℤ≥cuz 9718 ...cfz 10200 ♯chash 10992 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-nul 4209 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-iinf 4679 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-1re 8089 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-addcom 8095 ax-addass 8097 ax-distr 8099 ax-i2m1 8100 ax-0lt1 8101 ax-0id 8103 ax-rnegex 8104 ax-cnre 8106 ax-pre-ltirr 8107 ax-pre-ltwlin 8108 ax-pre-lttrn 8109 ax-pre-apti 8110 ax-pre-ltadd 8111 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-tr 4182 df-id 4383 df-iord 4456 df-on 4458 df-ilim 4459 df-suc 4461 df-iom 4682 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 df-fo 5323 df-f1o 5324 df-fv 5325 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-1st 6284 df-2nd 6285 df-recs 6449 df-irdg 6514 df-frec 6535 df-1o 6560 df-oadd 6564 df-er 6678 df-en 6886 df-dom 6887 df-fin 6888 df-pnf 8179 df-mnf 8180 df-xr 8181 df-ltxr 8182 df-le 8183 df-sub 8315 df-neg 8316 df-inn 9107 df-n0 9366 df-z 9443 df-uz 9719 df-fz 10201 df-ihash 10993 |
| This theorem is referenced by: zfz1isolemiso 11056 zfz1isolem1 11057 |
| Copyright terms: Public domain | W3C validator |