Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eqfnfv2f | Structured version Visualization version 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 6909 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 6909 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧))) | |
2 | eqfnfv2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐹 | |
3 | nfcv 2907 | . . . . 5 ⊢ Ⅎ𝑥𝑧 | |
4 | 2, 3 | nffv 6784 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑧) |
5 | eqfnfv2f.2 | . . . . 5 ⊢ Ⅎ𝑥𝐺 | |
6 | 5, 3 | nffv 6784 | . . . 4 ⊢ Ⅎ𝑥(𝐺‘𝑧) |
7 | 4, 6 | nfeq 2920 | . . 3 ⊢ Ⅎ𝑥(𝐹‘𝑧) = (𝐺‘𝑧) |
8 | nfv 1917 | . . 3 ⊢ Ⅎ𝑧(𝐹‘𝑥) = (𝐺‘𝑥) | |
9 | fveq2 6774 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥)) | |
10 | fveq2 6774 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝐺‘𝑧) = (𝐺‘𝑥)) | |
11 | 9, 10 | eqeq12d 2754 | . . 3 ⊢ (𝑧 = 𝑥 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑥) = (𝐺‘𝑥))) |
12 | 7, 8, 11 | cbvralw 3373 | . 2 ⊢ (∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)) |
13 | 1, 12 | bitrdi 287 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 Ⅎwnfc 2887 ∀wral 3064 Fn wfn 6428 ‘cfv 6433 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-fv 6441 |
This theorem is referenced by: aacllem 46505 |
Copyright terms: Public domain | W3C validator |