| 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 2737 | . . . 4 ⊢ (𝐹‘𝐵) = (𝐹‘𝐵) | |
| 2 | fvex 6855 | . . . . 5 ⊢ (𝐹‘𝐵) ∈ V | |
| 3 | eqeq2 2749 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → ((𝐹‘𝐵) = 𝑥 ↔ (𝐹‘𝐵) = (𝐹‘𝐵))) | |
| 4 | breq2 5104 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → (𝐵𝐹𝑥 ↔ 𝐵𝐹(𝐹‘𝐵))) | |
| 5 | 3, 4 | bibi12d 345 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝐵) → (((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥) ↔ ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵)))) |
| 6 | 5 | imbi2d 340 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝐵) → (((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) ↔ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵))))) |
| 7 | fneu 6610 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑥 𝐵𝐹𝑥) | |
| 8 | tz6.12c 6864 | . . . . . 6 ⊢ (∃!𝑥 𝐵𝐹𝑥 → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) | |
| 9 | 7, 8 | syl 17 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) |
| 10 | 2, 6, 9 | vtocl 3517 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵))) |
| 11 | 1, 10 | mpbii 233 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵𝐹(𝐹‘𝐵)) |
| 12 | breq2 5104 | . . 3 ⊢ ((𝐹‘𝐵) = 𝐶 → (𝐵𝐹(𝐹‘𝐵) ↔ 𝐵𝐹𝐶)) | |
| 13 | 11, 12 | syl5ibcom 245 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 → 𝐵𝐹𝐶)) |
| 14 | fnfun 6600 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
| 15 | funbrfv 6890 | . . . 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 1542 ∈ wcel 2114 ∃!weu 2569 class class class wbr 5100 Fun wfun 6494 Fn wfn 6495 ‘cfv 6500 |
| 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 5243 ax-nul 5253 ax-pr 5379 |
| 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 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-iota 6456 df-fun 6502 df-fn 6503 df-fv 6508 |
| This theorem is referenced by: fnopfvb 6893 funbrfvb 6895 fnbrfvb2 6897 dffn5 6900 feqmptdf 6912 fnsnfv 6921 fndmdif 6996 dffo4 7057 dff13 7210 isomin 7293 isoini 7294 br1steqg 7965 br2ndeqg 7966 1stconst 8052 2ndconst 8053 fsplit 8069 seqomlem3 8393 seqomlem4 8394 nqerrel 10855 imasleval 17474 znleval 21521 cutsun12 27798 madeval2 27841 axcontlem5 29053 elnlfn 32015 adjbd1o 32172 fcoinvbr 32691 fv1stcnv 35990 fv2ndcnv 35991 fvbigcup 36113 fvsingle 36131 imageval 36141 brfullfun 36161 bj-mptval 37364 unccur 37848 poimirlem2 37867 poimirlem23 37888 pw2f1ocnv 43388 tfsconcat0i 43696 tfsconcatrev 43699 brcoffn 44380 funressnfv 47397 fnbrafvb 47508 |
| Copyright terms: Public domain | W3C validator |