| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eqfnfv2f | GIF version | ||
| Description: Equality of functions is determined by their values. Special case of Exercise 4 of [TakeutiZaring] p. 28 (with domain equality omitted). This version of eqfnfv 5744 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 29-Jan-2004.) |
| Ref | Expression |
|---|---|
| eqfnfv2f.1 | ⊢ Ⅎ𝑥𝐹 |
| eqfnfv2f.2 | ⊢ Ⅎ𝑥𝐺 |
| Ref | Expression |
|---|---|
| eqfnfv2f | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqfnfv 5744 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))) | |
| 2 | eqfnfv2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐹 | |
| 3 | nfcv 2374 | . . . . 5 ⊢ Ⅎ𝑥𝑧 | |
| 4 | 2, 3 | nffv 5649 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑧) |
| 5 | eqfnfv2f.2 | . . . . 5 ⊢ Ⅎ𝑥𝐺 | |
| 6 | 5, 3 | nffv 5649 | . . . 4 ⊢ Ⅎ𝑥(𝐺‘𝑧) |
| 7 | 4, 6 | nfeq 2382 | . . 3 ⊢ Ⅎ𝑥(𝐹‘𝑧) = (𝐺‘𝑧) |
| 8 | nfv 1576 | . . 3 ⊢ Ⅎ𝑧(𝐹‘𝑥) = (𝐺‘𝑥) | |
| 9 | fveq2 5639 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥)) | |
| 10 | fveq2 5639 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝐺‘𝑧) = (𝐺‘𝑥)) | |
| 11 | 9, 10 | eqeq12d 2246 | . . 3 ⊢ (𝑧 = 𝑥 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑥) = (𝐺‘𝑥))) |
| 12 | 7, 8, 11 | cbvral 2763 | . 2 ⊢ (∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)) |
| 13 | 1, 12 | bitrdi 196 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 Ⅎwnfc 2361 ∀wral 2510 Fn wfn 5321 ‘cfv 5326 |
| 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-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fn 5329 df-fv 5334 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |