Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 2ffzeq | GIF version |
Description: Two functions over 0 based finite set of sequential integers are equal if and only if their domains have the same length and the function values are the same at each position. (Contributed by Alexander van der Vekens, 30-Jun-2018.) |
Ref | Expression |
---|---|
2ffzeq | ⊢ ((𝑀 ∈ ℕ0 ∧ 𝐹:(0...𝑀)⟶𝑋 ∧ 𝑃:(0...𝑁)⟶𝑌) → (𝐹 = 𝑃 ↔ (𝑀 = 𝑁 ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ffn 5331 | . . . . 5 ⊢ (𝐹:(0...𝑀)⟶𝑋 → 𝐹 Fn (0...𝑀)) | |
2 | ffn 5331 | . . . . 5 ⊢ (𝑃:(0...𝑁)⟶𝑌 → 𝑃 Fn (0...𝑁)) | |
3 | 1, 2 | anim12i 336 | . . . 4 ⊢ ((𝐹:(0...𝑀)⟶𝑋 ∧ 𝑃:(0...𝑁)⟶𝑌) → (𝐹 Fn (0...𝑀) ∧ 𝑃 Fn (0...𝑁))) |
4 | 3 | 3adant1 1004 | . . 3 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝐹:(0...𝑀)⟶𝑋 ∧ 𝑃:(0...𝑁)⟶𝑌) → (𝐹 Fn (0...𝑀) ∧ 𝑃 Fn (0...𝑁))) |
5 | eqfnfv2 5578 | . . 3 ⊢ ((𝐹 Fn (0...𝑀) ∧ 𝑃 Fn (0...𝑁)) → (𝐹 = 𝑃 ↔ ((0...𝑀) = (0...𝑁) ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)))) | |
6 | 4, 5 | syl 14 | . 2 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝐹:(0...𝑀)⟶𝑋 ∧ 𝑃:(0...𝑁)⟶𝑌) → (𝐹 = 𝑃 ↔ ((0...𝑀) = (0...𝑁) ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)))) |
7 | elnn0uz 9494 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ0 ↔ 𝑀 ∈ (ℤ≥‘0)) | |
8 | fzopth 9986 | . . . . . . 7 ⊢ (𝑀 ∈ (ℤ≥‘0) → ((0...𝑀) = (0...𝑁) ↔ (0 = 0 ∧ 𝑀 = 𝑁))) | |
9 | 7, 8 | sylbi 120 | . . . . . 6 ⊢ (𝑀 ∈ ℕ0 → ((0...𝑀) = (0...𝑁) ↔ (0 = 0 ∧ 𝑀 = 𝑁))) |
10 | simpr 109 | . . . . . 6 ⊢ ((0 = 0 ∧ 𝑀 = 𝑁) → 𝑀 = 𝑁) | |
11 | 9, 10 | syl6bi 162 | . . . . 5 ⊢ (𝑀 ∈ ℕ0 → ((0...𝑀) = (0...𝑁) → 𝑀 = 𝑁)) |
12 | 11 | anim1d 334 | . . . 4 ⊢ (𝑀 ∈ ℕ0 → (((0...𝑀) = (0...𝑁) ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)) → (𝑀 = 𝑁 ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)))) |
13 | oveq2 5844 | . . . . 5 ⊢ (𝑀 = 𝑁 → (0...𝑀) = (0...𝑁)) | |
14 | 13 | anim1i 338 | . . . 4 ⊢ ((𝑀 = 𝑁 ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)) → ((0...𝑀) = (0...𝑁) ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖))) |
15 | 12, 14 | impbid1 141 | . . 3 ⊢ (𝑀 ∈ ℕ0 → (((0...𝑀) = (0...𝑁) ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)) ↔ (𝑀 = 𝑁 ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)))) |
16 | 15 | 3ad2ant1 1007 | . 2 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝐹:(0...𝑀)⟶𝑋 ∧ 𝑃:(0...𝑁)⟶𝑌) → (((0...𝑀) = (0...𝑁) ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)) ↔ (𝑀 = 𝑁 ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)))) |
17 | 6, 16 | bitrd 187 | 1 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝐹:(0...𝑀)⟶𝑋 ∧ 𝑃:(0...𝑁)⟶𝑌) → (𝐹 = 𝑃 ↔ (𝑀 = 𝑁 ∧ ∀𝑖 ∈ (0...𝑀)(𝐹‘𝑖) = (𝑃‘𝑖)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 967 = wceq 1342 ∈ wcel 2135 ∀wral 2442 Fn wfn 5177 ⟶wf 5178 ‘cfv 5182 (class class class)co 5836 0cc0 7744 ℕ0cn0 9105 ℤ≥cuz 9457 ...cfz 9935 |
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 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 ax-cnex 7835 ax-resscn 7836 ax-1cn 7837 ax-1re 7838 ax-icn 7839 ax-addcl 7840 ax-addrcl 7841 ax-mulcl 7842 ax-addcom 7844 ax-addass 7846 ax-distr 7848 ax-i2m1 7849 ax-0lt1 7850 ax-0id 7852 ax-rnegex 7853 ax-cnre 7855 ax-pre-ltirr 7856 ax-pre-ltwlin 7857 ax-pre-lttrn 7858 ax-pre-apti 7859 ax-pre-ltadd 7860 |
This theorem depends on definitions: df-bi 116 df-3or 968 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-nel 2430 df-ral 2447 df-rex 2448 df-reu 2449 df-rab 2451 df-v 2723 df-sbc 2947 df-csb 3041 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-int 3819 df-br 3977 df-opab 4038 df-mpt 4039 df-id 4265 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-fv 5190 df-riota 5792 df-ov 5839 df-oprab 5840 df-mpo 5841 df-pnf 7926 df-mnf 7927 df-xr 7928 df-ltxr 7929 df-le 7930 df-sub 8062 df-neg 8063 df-inn 8849 df-n0 9106 df-z 9183 df-uz 9458 df-fz 9936 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |