| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnopfvb | Structured version Visualization version GIF version | ||
| Description: Equivalence of function value and ordered pair membership. (Contributed by NM, 7-Nov-1995.) |
| Ref | Expression |
|---|---|
| fnopfvb | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 〈𝐵, 𝐶〉 ∈ 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnbrfvb 6884 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) | |
| 2 | df-br 5087 | . 2 ⊢ (𝐵𝐹𝐶 ↔ 〈𝐵, 𝐶〉 ∈ 𝐹) | |
| 3 | 1, 2 | bitrdi 287 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 〈𝐵, 𝐶〉 ∈ 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 〈cop 4574 class class class wbr 5086 Fn wfn 6487 ‘cfv 6492 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-iota 6448 df-fun 6494 df-fn 6495 df-fv 6500 |
| This theorem is referenced by: funopfvb 6888 fdmeu 6890 fvopab3g 6936 f1ofveu 7354 ovid 7501 ov 7504 ovg 7525 funelss 7993 tfrlem11 8320 rdglim2 8364 tz7.48-1 8375 mdetunilem9 22595 tfsconcatfv2 43786 |
| Copyright terms: Public domain | W3C validator |