| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fnbrafv2b | Structured version Visualization version GIF version | ||
| Description: Equivalence of function value and binary relation, analogous to fnbrfvb 6933. (Contributed by AV, 6-Sep-2022.) |
| Ref | Expression |
|---|---|
| fnbrafv2b | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . 4 ⊢ (𝐹''''𝐵) = (𝐹''''𝐵) | |
| 2 | fundmdfat 47849 | . . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → 𝐹 defAt 𝐵) | |
| 3 | 2 | funfni 6643 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐹 defAt 𝐵) |
| 4 | dfatafv2ex 47933 | . . . . . 6 ⊢ (𝐹 defAt 𝐵 → (𝐹''''𝐵) ∈ V) | |
| 5 | 3, 4 | syl 18 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹''''𝐵) ∈ V) |
| 6 | eqeq2 2775 | . . . . . . 7 ⊢ (𝑥 = (𝐹''''𝐵) → ((𝐹''''𝐵) = 𝑥 ↔ (𝐹''''𝐵) = (𝐹''''𝐵))) | |
| 7 | breq2 5114 | . . . . . . 7 ⊢ (𝑥 = (𝐹''''𝐵) → (𝐵𝐹𝑥 ↔ 𝐵𝐹(𝐹''''𝐵))) | |
| 8 | 6, 7 | bibi12d 348 | . . . . . 6 ⊢ (𝑥 = (𝐹''''𝐵) → (((𝐹''''𝐵) = 𝑥 ↔ 𝐵𝐹𝑥) ↔ ((𝐹''''𝐵) = (𝐹''''𝐵) ↔ 𝐵𝐹(𝐹''''𝐵)))) |
| 9 | 8 | adantl 486 | . . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 = (𝐹''''𝐵)) → (((𝐹''''𝐵) = 𝑥 ↔ 𝐵𝐹𝑥) ↔ ((𝐹''''𝐵) = (𝐹''''𝐵) ↔ 𝐵𝐹(𝐹''''𝐵)))) |
| 10 | fneu 6647 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑥 𝐵𝐹𝑥) | |
| 11 | tz6.12c-afv2 47962 | . . . . . 6 ⊢ (∃!𝑥 𝐵𝐹𝑥 → ((𝐹''''𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) | |
| 12 | 10, 11 | syl 18 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) |
| 13 | 5, 9, 12 | vtocld 3528 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = (𝐹''''𝐵) ↔ 𝐵𝐹(𝐹''''𝐵))) |
| 14 | 1, 13 | mpbii 236 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵𝐹(𝐹''''𝐵)) |
| 15 | breq2 5114 | . . 3 ⊢ ((𝐹''''𝐵) = 𝐶 → (𝐵𝐹(𝐹''''𝐵) ↔ 𝐵𝐹𝐶)) | |
| 16 | 14, 15 | syl5ibcom 248 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝐶 → 𝐵𝐹𝐶)) |
| 17 | fnfun 6637 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
| 18 | funbrafv2 47967 | . . . 4 ⊢ (Fun 𝐹 → (𝐵𝐹𝐶 → (𝐹''''𝐵) = 𝐶)) | |
| 19 | 17, 18 | syl 18 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵𝐹𝐶 → (𝐹''''𝐵) = 𝐶)) |
| 20 | 19 | adantr 485 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵𝐹𝐶 → (𝐹''''𝐵) = 𝐶)) |
| 21 | 16, 20 | impbid 215 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃!weu 2596 Vcvv 3455 class class class wbr 5110 Fun wfun 6532 Fn wfn 6533 defAt wdfat 47836 ''''cafv2 47928 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-res 5675 df-iota 6494 df-fun 6540 df-fn 6541 df-dfat 47839 df-afv2 47929 |
| This theorem is referenced by: fnopafv2b 47969 funbrafv22b 47970 |
| Copyright terms: Public domain | W3C validator |