![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > resunimafz0 | Structured version Visualization version GIF version |
Description: TODO-AV: Revise using 𝐹 ∈ Word dom 𝐼? Formerly part of proof of eupth2lem3 30020: The union of a restriction by an image over an open range of nonnegative integers and a singleton of an ordered pair is a restriction by an image over an interval of nonnegative integers. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 20-Feb-2021.) |
Ref | Expression |
---|---|
resunimafz0.i | ⊢ (𝜑 → Fun 𝐼) |
resunimafz0.f | ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) |
resunimafz0.n | ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) |
Ref | Expression |
---|---|
resunimafz0 | ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0...𝑁))) = ((𝐼 ↾ (𝐹 “ (0..^𝑁))) ∪ {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | imaundi 6148 | . . . . 5 ⊢ (𝐹 “ ((0..^𝑁) ∪ {𝑁})) = ((𝐹 “ (0..^𝑁)) ∪ (𝐹 “ {𝑁})) | |
2 | resunimafz0.n | . . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
3 | elfzonn0 13695 | . . . . . . . . 9 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ ℕ0) | |
4 | 2, 3 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
5 | elnn0uz 12883 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (ℤ≥‘0)) | |
6 | 4, 5 | sylib 217 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0)) |
7 | fzisfzounsn 13762 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘0) → (0...𝑁) = ((0..^𝑁) ∪ {𝑁})) | |
8 | 6, 7 | syl 17 | . . . . . 6 ⊢ (𝜑 → (0...𝑁) = ((0..^𝑁) ∪ {𝑁})) |
9 | 8 | imaeq2d 6057 | . . . . 5 ⊢ (𝜑 → (𝐹 “ (0...𝑁)) = (𝐹 “ ((0..^𝑁) ∪ {𝑁}))) |
10 | resunimafz0.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
11 | 10 | ffnd 6717 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn (0..^(♯‘𝐹))) |
12 | fnsnfv 6971 | . . . . . . 7 ⊢ ((𝐹 Fn (0..^(♯‘𝐹)) ∧ 𝑁 ∈ (0..^(♯‘𝐹))) → {(𝐹‘𝑁)} = (𝐹 “ {𝑁})) | |
13 | 11, 2, 12 | syl2anc 583 | . . . . . 6 ⊢ (𝜑 → {(𝐹‘𝑁)} = (𝐹 “ {𝑁})) |
14 | 13 | uneq2d 4159 | . . . . 5 ⊢ (𝜑 → ((𝐹 “ (0..^𝑁)) ∪ {(𝐹‘𝑁)}) = ((𝐹 “ (0..^𝑁)) ∪ (𝐹 “ {𝑁}))) |
15 | 1, 9, 14 | 3eqtr4a 2793 | . . . 4 ⊢ (𝜑 → (𝐹 “ (0...𝑁)) = ((𝐹 “ (0..^𝑁)) ∪ {(𝐹‘𝑁)})) |
16 | 15 | reseq2d 5979 | . . 3 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0...𝑁))) = (𝐼 ↾ ((𝐹 “ (0..^𝑁)) ∪ {(𝐹‘𝑁)}))) |
17 | resundi 5993 | . . 3 ⊢ (𝐼 ↾ ((𝐹 “ (0..^𝑁)) ∪ {(𝐹‘𝑁)})) = ((𝐼 ↾ (𝐹 “ (0..^𝑁))) ∪ (𝐼 ↾ {(𝐹‘𝑁)})) | |
18 | 16, 17 | eqtrdi 2783 | . 2 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0...𝑁))) = ((𝐼 ↾ (𝐹 “ (0..^𝑁))) ∪ (𝐼 ↾ {(𝐹‘𝑁)}))) |
19 | resunimafz0.i | . . . . 5 ⊢ (𝜑 → Fun 𝐼) | |
20 | 19 | funfnd 6578 | . . . 4 ⊢ (𝜑 → 𝐼 Fn dom 𝐼) |
21 | 10, 2 | ffvelcdmd 7089 | . . . 4 ⊢ (𝜑 → (𝐹‘𝑁) ∈ dom 𝐼) |
22 | fnressn 7161 | . . . 4 ⊢ ((𝐼 Fn dom 𝐼 ∧ (𝐹‘𝑁) ∈ dom 𝐼) → (𝐼 ↾ {(𝐹‘𝑁)}) = {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩}) | |
23 | 20, 21, 22 | syl2anc 583 | . . 3 ⊢ (𝜑 → (𝐼 ↾ {(𝐹‘𝑁)}) = {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩}) |
24 | 23 | uneq2d 4159 | . 2 ⊢ (𝜑 → ((𝐼 ↾ (𝐹 “ (0..^𝑁))) ∪ (𝐼 ↾ {(𝐹‘𝑁)})) = ((𝐼 ↾ (𝐹 “ (0..^𝑁))) ∪ {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩})) |
25 | 18, 24 | eqtrd 2767 | 1 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0...𝑁))) = ((𝐼 ↾ (𝐹 “ (0..^𝑁))) ∪ {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1534 ∈ wcel 2099 ∪ cun 3942 {csn 4624 ⟨cop 4630 dom cdm 5672 ↾ cres 5674 “ cima 5675 Fun wfun 6536 Fn wfn 6537 ⟶wf 6538 ‘cfv 6542 (class class class)co 7414 0cc0 11124 ℕ0cn0 12488 ℤ≥cuz 12838 ...cfz 13502 ..^cfzo 13645 ♯chash 14307 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7732 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7863 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8383 df-rdg 8422 df-er 8716 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11266 df-mnf 11267 df-xr 11268 df-ltxr 11269 df-le 11270 df-sub 11462 df-neg 11463 df-nn 12229 df-n0 12489 df-z 12575 df-uz 12839 df-fz 13503 df-fzo 13646 |
This theorem is referenced by: trlsegvdeg 30011 |
Copyright terms: Public domain | W3C validator |