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 2738 | . . . 4 ⊢ (𝐹‘𝐵) = (𝐹‘𝐵) | |
2 | fvex 6789 | . . . . 5 ⊢ (𝐹‘𝐵) ∈ V | |
3 | eqeq2 2750 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → ((𝐹‘𝐵) = 𝑥 ↔ (𝐹‘𝐵) = (𝐹‘𝐵))) | |
4 | breq2 5080 | . . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → (𝐵𝐹𝑥 ↔ 𝐵𝐹(𝐹‘𝐵))) | |
5 | 3, 4 | bibi12d 346 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝐵) → (((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥) ↔ ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵)))) |
6 | 5 | imbi2d 341 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝐵) → (((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) ↔ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵))))) |
7 | fneu 6545 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑥 𝐵𝐹𝑥) | |
8 | tz6.12c 6801 | . . . . . 6 ⊢ (∃!𝑥 𝐵𝐹𝑥 → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) | |
9 | 7, 8 | syl 17 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) |
10 | 2, 6, 9 | vtocl 3497 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = (𝐹‘𝐵) ↔ 𝐵𝐹(𝐹‘𝐵))) |
11 | 1, 10 | mpbii 232 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵𝐹(𝐹‘𝐵)) |
12 | breq2 5080 | . . 3 ⊢ ((𝐹‘𝐵) = 𝐶 → (𝐵𝐹(𝐹‘𝐵) ↔ 𝐵𝐹𝐶)) | |
13 | 11, 12 | syl5ibcom 244 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 → 𝐵𝐹𝐶)) |
14 | fnfun 6535 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
15 | funbrfv 6822 | . . . 4 ⊢ (Fun 𝐹 → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) | |
16 | 14, 15 | syl 17 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) |
17 | 16 | adantr 481 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵𝐹𝐶 → (𝐹‘𝐵) = 𝐶)) |
18 | 13, 17 | impbid 211 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∃!weu 2568 class class class wbr 5076 Fun wfun 6429 Fn wfn 6430 ‘cfv 6435 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5225 ax-nul 5232 ax-pr 5354 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3433 df-dif 3891 df-un 3893 df-in 3895 df-ss 3905 df-nul 4259 df-if 4462 df-sn 4564 df-pr 4566 df-op 4570 df-uni 4842 df-br 5077 df-opab 5139 df-id 5491 df-xp 5597 df-rel 5598 df-cnv 5599 df-co 5600 df-dm 5601 df-iota 6393 df-fun 6437 df-fn 6438 df-fv 6443 |
This theorem is referenced by: fnopfvb 6825 funbrfvb 6826 fnbrfvb2 6828 dffn5 6830 feqmptdf 6841 fnsnfv 6849 fnsnfvOLD 6850 fndmdif 6921 dffo4 6981 dff13 7130 isomin 7210 isoini 7211 br1steqg 7853 br2ndeqg 7854 1stconst 7938 2ndconst 7939 fsplit 7955 fsplitOLD 7956 seqomlem3 8281 seqomlem4 8282 nqerrel 10686 imasleval 17250 znleval 20760 axcontlem5 27334 elnlfn 30287 adjbd1o 30444 fcoinvbr 30944 fv1stcnv 33748 fv2ndcnv 33749 scutun12 34001 madeval2 34034 fvbigcup 34201 fvsingle 34219 imageval 34229 brfullfun 34247 bj-mptval 35285 unccur 35757 poimirlem2 35776 poimirlem23 35797 pw2f1ocnv 40856 brcoffn 41610 funressnfv 44504 fnbrafvb 44613 |
Copyright terms: Public domain | W3C validator |