| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnbrfvb | Structured version Visualization version GIF version | ||
| Description: Equivalence of function value and binary relation. (Contributed by NM, 19-Apr-2004.) (Revised by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| fnbrfvb | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2731 | . . . 4 ⊢ (𝐹‘𝐵) = (𝐹‘𝐵) | |
| 2 | fvex 6835 | . . . . 5 ⊢ (𝐹‘𝐵) ∈ V | |
| 3 | eqeq2 2743 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → ((𝐹‘𝐵) = 𝑥 ↔ (𝐹‘𝐵) = (𝐹‘𝐵))) | |
| 4 | breq2 5093 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → (𝐵𝐹𝑥 ↔ 𝐵𝐹(𝐹‘𝐵))) | |
| 5 | 3, 4 | bibi12d 345 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝐵) → (((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥) ↔ ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵)))) |
| 6 | 5 | imbi2d 340 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝐵) → (((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) ↔ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵))))) |
| 7 | fneu 6591 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑥 𝐵𝐹𝑥) | |
| 8 | tz6.12c 6844 | . . . . . 6 ⊢ (∃!𝑥 𝐵𝐹𝑥 → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) | |
| 9 | 7, 8 | syl 17 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) |
| 10 | 2, 6, 9 | vtocl 3511 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵))) |
| 11 | 1, 10 | mpbii 233 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵𝐹(𝐹‘𝐵)) |
| 12 | breq2 5093 | . . 3 ⊢ ((𝐹‘𝐵) = 𝐶 → (𝐵𝐹(𝐹‘𝐵) ↔ 𝐵𝐹𝐶)) | |
| 13 | 11, 12 | syl5ibcom 245 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 → 𝐵𝐹𝐶)) |
| 14 | fnfun 6581 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
| 15 | funbrfv 6870 | . . . 4 ⊢ (Fun 𝐹 → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) | |
| 16 | 14, 15 | syl 17 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) |
| 17 | 16 | adantr 480 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) |
| 18 | 13, 17 | impbid 212 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∃!weu 2563 class class class wbr 5089 Fun wfun 6475 Fn wfn 6476 ‘cfv 6481 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-ss 3914 df-nul 4281 df-if 4473 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-br 5090 df-opab 5152 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-iota 6437 df-fun 6483 df-fn 6484 df-fv 6489 |
| This theorem is referenced by: fnopfvb 6873 funbrfvb 6875 fnbrfvb2 6877 dffn5 6880 feqmptdf 6892 fnsnfv 6901 fndmdif 6975 dffo4 7036 dff13 7188 isomin 7271 isoini 7272 br1steqg 7943 br2ndeqg 7944 1stconst 8030 2ndconst 8031 fsplit 8047 seqomlem3 8371 seqomlem4 8372 nqerrel 10823 imasleval 17445 znleval 21491 scutun12 27751 madeval2 27794 axcontlem5 28946 elnlfn 31908 adjbd1o 32065 fcoinvbr 32585 fv1stcnv 35821 fv2ndcnv 35822 fvbigcup 35944 fvsingle 35962 imageval 35972 brfullfun 35992 bj-mptval 37161 unccur 37642 poimirlem2 37661 poimirlem23 37682 pw2f1ocnv 43129 tfsconcat0i 43437 tfsconcatrev 43440 brcoffn 44122 funressnfv 47142 fnbrafvb 47253 |
| Copyright terms: Public domain | W3C validator |