| 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 6958. (Contributed by AV, 6-Sep-2022.) |
| Ref | Expression |
|---|---|
| fnbrafv2b | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . 4 ⊢ (𝐹''''𝐵) = (𝐹''''𝐵) | |
| 2 | fundmdfat 48404 | . . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → 𝐹 defAt 𝐵) | |
| 3 | 2 | funfni 6667 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐹 defAt 𝐵) |
| 4 | dfatafv2ex 48488 | . . . . . 6 ⊢ (𝐹 defAt 𝐵 → (𝐹''''𝐵) ∈ V) | |
| 5 | 3, 4 | syl 18 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐹''''𝐵) ∈ V) |
| 6 | eqeq2 2775 | . . . . . . 7 ⊢ (𝑥 = (𝐹''''𝐵) → ((𝐹''''𝐵) = 𝑥 ↔ (𝐹''''𝐵) = (𝐹''''𝐵))) | |
| 7 | breq2 5110 | . . . . . . 7 ⊢ (𝑥 = (𝐹''''𝐵) → (𝐵𝐹𝑥 ↔ 𝐵𝐹(𝐹''''𝐵))) | |
| 8 | 6, 7 | bibi12d 348 | . . . . . 6 ⊢ (𝑥 = (𝐹''''𝐵) → (((𝐹''''𝐵) = 𝑥 ↔ 𝐵𝐹𝑥) ↔ ((𝐹''''𝐵) = (𝐹''''𝐵) ↔ 𝐵𝐹(𝐹''''𝐵)))) |
| 9 | 8 | adantl 487 | . . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 = (𝐹''''𝐵)) → (((𝐹''''𝐵) = 𝑥 ↔ 𝐵𝐹𝑥) ↔ ((𝐹''''𝐵) = (𝐹''''𝐵) ↔ 𝐵𝐹(𝐹''''𝐵)))) |
| 10 | fneu 6671 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑥 𝐵𝐹𝑥) | |
| 11 | tz6.12c-afv2 48517 | . . . . . 6 ⊢ (∃!𝑥 𝐵𝐹𝑥 → ((𝐹''''𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) | |
| 12 | 10, 11 | syl 18 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝑥 ↔ 𝐵𝐹𝑥)) |
| 13 | 5, 9, 12 | vtocld 3526 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = (𝐹''''𝐵) ↔ 𝐵𝐹(𝐹''''𝐵))) |
| 14 | 1, 13 | mpbii 236 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵𝐹(𝐹''''𝐵)) |
| 15 | breq2 5110 | . . 3 ⊢ ((𝐹''''𝐵) = 𝐶 → (𝐵𝐹(𝐹''''𝐵) ↔ 𝐵𝐹𝐶)) | |
| 16 | 14, 15 | syl5ibcom 248 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝐶 → 𝐵𝐹𝐶)) |
| 17 | fnfun 6661 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
| 18 | funbrafv2 48522 | . . . 4 ⊢ (Fun 𝐹 → (𝐵𝐹𝐶 → (𝐹''''𝐵) = 𝐶)) | |
| 19 | 17, 18 | syl 18 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵𝐹𝐶 → (𝐹''''𝐵) = 𝐶)) |
| 20 | 19 | adantr 486 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵𝐹𝐶 → (𝐹''''𝐵) = 𝐶)) |
| 21 | 16, 20 | 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 2147 ∃!weu 2596 Vcvv 3454 class class class wbr 5106 Fun wfun 6552 Fn wfn 6553 defAt wdfat 48392 ''''cafv2 48483 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-res 5667 df-iota 6512 df-fun 6560 df-fn 6561 df-dfat 48395 df-afv2 48484 |
| This theorem is used by: fnopafv2b 48524 funbrafv22b 48525 |
| Copyright terms: Public domain | W3C validator |