| 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 2761 | . . . 4 ⊢ (𝐹‘𝐵) = (𝐹‘𝐵) | |
| 2 | fvex 6890 | . . . . 5 ⊢ (𝐹‘𝐵) ∈ V | |
| 3 | eqeq2 2773 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → ((𝐹‘𝐵) = 𝑥 ↔ (𝐹‘𝐵) = (𝐹‘𝐵))) | |
| 4 | breq2 5107 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → (𝐵𝐹𝑥 ↔ 𝐵𝐹(𝐹‘𝐵))) | |
| 5 | 3, 4 | bibi12d 348 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝐵) → (((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥) ↔ ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵)))) |
| 6 | 5 | imbi2d 343 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝐵) → (((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) ↔ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵))))) |
| 7 | fneu 6641 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑥 𝐵𝐹𝑥) | |
| 8 | tz6.12c 6899 | . . . . . 6 ⊢ (∃!𝑥 𝐵𝐹𝑥 → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) | |
| 9 | 7, 8 | syl 18 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) |
| 10 | 2, 6, 9 | vtocl 3521 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵))) |
| 11 | 1, 10 | mpbii 236 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵𝐹(𝐹‘𝐵)) |
| 12 | breq2 5107 | . . 3 ⊢ ((𝐹‘𝐵) = 𝐶 → (𝐵𝐹(𝐹‘𝐵) ↔ 𝐵𝐹𝐶)) | |
| 13 | 11, 12 | syl5ibcom 248 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 → 𝐵𝐹𝐶)) |
| 14 | fnfun 6631 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
| 15 | funbrfv 6925 | . . . 4 ⊢ (Fun 𝐹 → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) | |
| 16 | 14, 15 | syl 18 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) |
| 17 | 16 | adantr 486 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) |
| 18 | 13, 17 | impbid 215 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃!weu 2594 class class class wbr 5103 Fun wfun 6525 Fn wfn 6526 ‘cfv 6531 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6487 df-fun 6533 df-fn 6534 df-fv 6539 |
| This theorem is used by: fnopfvb 6928 funbrfvb 6930 fnbrfvb2 6932 dffn5 6935 feqmptdf 6947 fnsnfv 6956 fndmdif 7033 dffo4 7095 dff13 7250 isomin 7337 isoini 7338 br1steqg 8012 br2ndeqg 8013 1stconst 8100 2ndconst 8101 fsplit 8117 seqomlem3 8446 seqomlem4 8447 nqerrel 10998 imasleval 17693 znleval 21840 cutsun12 28158 madeval2 28201 axcontlem5 29528 elnlfn 32512 adjbd1o 32669 fcoinvbr 33181 fv1stcnv 36511 fv2ndcnv 36512 fvbigcup 36634 fvsingle 36652 imageval 36662 brfullfun 36682 bj-mptval 38006 unccur 38494 poimirlem2 38508 poimirlem23 38529 pw2f1ocnv 43997 tfsconcat0i 44305 tfsconcatrev 44308 brcoffn 44989 funressnfv 48057 fnbrafvb 48168 |
| Copyright terms: Public domain | W3C validator |