| 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 6911 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) | |
| 2 | df-br 5108 | . 2 ⊢ (𝐵𝐹𝐶 ↔ 〈𝐵, 𝐶〉 ∈ 𝐹) | |
| 3 | 1, 2 | bitrdi 287 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 〈𝐵, 𝐶〉 ∈ 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 〈cop 4595 class class class wbr 5107 Fn wfn 6506 ‘cfv 6511 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-iota 6464 df-fun 6513 df-fn 6514 df-fv 6519 |
| This theorem is referenced by: funopfvb 6915 fdmeu 6917 fvopab3g 6963 f1ofveu 7381 ovid 7530 ov 7533 ovg 7554 funelss 8026 tfrlem11 8356 rdglim2 8400 tz7.48-1 8411 mdetunilem9 22507 tfsconcatfv2 43329 |
| Copyright terms: Public domain | W3C validator |