Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > funbrfvb | Structured version Visualization version GIF version |
Description: Equivalence of function value and binary relation. (Contributed by NM, 26-Mar-2006.) |
Ref | Expression |
---|---|
funbrfvb | ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) = 𝐵 ↔ 𝐴𝐹𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funfn 6448 | . 2 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
2 | fnbrfvb 6804 | . 2 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) = 𝐵 ↔ 𝐴𝐹𝐵)) | |
3 | 1, 2 | sylanb 580 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) = 𝐵 ↔ 𝐴𝐹𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 dom cdm 5580 Fun wfun 6412 Fn wfn 6413 ‘cfv 6418 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-iota 6376 df-fun 6420 df-fn 6421 df-fv 6426 |
This theorem is referenced by: funbrfv2b 6809 dfimafn 6814 funimass4 6816 dcomex 10134 dvidlem 24984 taylthlem1 25437 dfimafnf 30872 funcnvmpt 30906 eqfunresadj 33641 frege124d 41258 frege129d 41260 ntrclsfv1 41554 ntrneifv1 41578 ntrneifv2 41579 |
Copyright terms: Public domain | W3C validator |