| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fnbrafvb | Structured version Visualization version GIF version | ||
| Description: Equivalence of function value and binary relation, analogous to fnbrfvb 6936. (Contributed by Alexander van der Vekens, 25-May-2017.) |
| Ref | Expression |
|---|---|
| fnbrafvb | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹'''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fndm 6643 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 2 | eleq2 2849 | . . . . . . . 8 ⊢ (𝐴 = dom 𝐹 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ dom 𝐹)) | |
| 3 | 2 | eqcoms 2768 | . . . . . . 7 ⊢ (dom 𝐹 = 𝐴 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ dom 𝐹)) |
| 4 | 3 | biimpd 232 | . . . . . 6 ⊢ (dom 𝐹 = 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ∈ dom 𝐹)) |
| 5 | 1, 4 | syl 18 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ∈ dom 𝐹)) |
| 6 | 5 | imp 412 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ dom 𝐹) |
| 7 | snssi 4742 | . . . . . . 7 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴) | |
| 8 | 7 | adantl 487 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴) |
| 9 | fnssresb 6662 | . . . . . . 7 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ {𝐵}) Fn {𝐵} ↔ {𝐵} ⊆ 𝐴)) | |
| 10 | 9 | adantr 486 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹 ↾ {𝐵}) Fn {𝐵} ↔ {𝐵} ⊆ 𝐴)) |
| 11 | 8, 10 | mpbird 260 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹 ↾ {𝐵}) Fn {𝐵}) |
| 12 | fnfun 6640 | . . . . 5 ⊢ ((𝐹 ↾ {𝐵}) Fn {𝐵} → Fun (𝐹 ↾ {𝐵})) | |
| 13 | 11, 12 | syl 18 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → Fun (𝐹 ↾ {𝐵})) |
| 14 | df-dfat 48283 | . . . . 5 ⊢ (𝐹 defAt 𝐵 ↔ (𝐵 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐵}))) | |
| 15 | afvfundmfveq 48302 | . . . . 5 ⊢ (𝐹 defAt 𝐵 → (𝐹'''𝐵) = (𝐹‘𝐵)) | |
| 16 | 14, 15 | sylbir 238 | . . . 4 ⊢ ((𝐵 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐵})) → (𝐹'''𝐵) = (𝐹‘𝐵)) |
| 17 | 6, 13, 16 | syl2anc 596 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹'''𝐵) = (𝐹‘𝐵)) |
| 18 | 17 | eqeq1d 2762 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹'''𝐵) = 𝐶 ↔ (𝐹‘𝐵) = 𝐶)) |
| 19 | fnbrfvb 6936 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹‘𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) | |
| 20 | 18, 19 | bitrd 282 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹'''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 {csn 4584 class class class wbr 5102 dom cdm 5650 ↾ cres 5652 Fun wfun 6533 Fn wfn 6534 ‘cfv 6539 defAt wdfat 48280 '''cafv 48281 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-res 5662 df-iota 6494 df-fun 6541 df-fn 6542 df-fv 6547 df-aiota 48249 df-dfat 48283 df-afv 48284 |
| This theorem is used by: fnopafvb 48319 funbrafvb 48320 dfafn5a 48324 |
| Copyright terms: Public domain | W3C validator |