![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > funfv | Structured version Visualization version GIF version |
Description: A simplified expression for the value of a function when we know it is a function. (Contributed by NM, 22-May-1998.) |
Ref | Expression |
---|---|
funfv | ⊢ (Fun 𝐹 → (𝐹‘𝐴) = ∪ (𝐹 “ {𝐴})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvex 6905 | . . . . 5 ⊢ (𝐹‘𝐴) ∈ V | |
2 | 1 | unisn 4931 | . . . 4 ⊢ ∪ {(𝐹‘𝐴)} = (𝐹‘𝐴) |
3 | eqid 2730 | . . . . . . 7 ⊢ dom 𝐹 = dom 𝐹 | |
4 | df-fn 6547 | . . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹)) | |
5 | 3, 4 | mpbiran2 706 | . . . . . 6 ⊢ (𝐹 Fn dom 𝐹 ↔ Fun 𝐹) |
6 | fnsnfv 6971 | . . . . . 6 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) | |
7 | 5, 6 | sylanbr 580 | . . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) |
8 | 7 | unieqd 4923 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ∪ {(𝐹‘𝐴)} = ∪ (𝐹 “ {𝐴})) |
9 | 2, 8 | eqtr3id 2784 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐹‘𝐴) = ∪ (𝐹 “ {𝐴})) |
10 | 9 | ex 411 | . 2 ⊢ (Fun 𝐹 → (𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∪ (𝐹 “ {𝐴}))) |
11 | ndmfv 6927 | . . 3 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∅) | |
12 | ndmima 6103 | . . . . 5 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹 “ {𝐴}) = ∅) | |
13 | 12 | unieqd 4923 | . . . 4 ⊢ (¬ 𝐴 ∈ dom 𝐹 → ∪ (𝐹 “ {𝐴}) = ∪ ∅) |
14 | uni0 4940 | . . . 4 ⊢ ∪ ∅ = ∅ | |
15 | 13, 14 | eqtrdi 2786 | . . 3 ⊢ (¬ 𝐴 ∈ dom 𝐹 → ∪ (𝐹 “ {𝐴}) = ∅) |
16 | 11, 15 | eqtr4d 2773 | . 2 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∪ (𝐹 “ {𝐴})) |
17 | 10, 16 | pm2.61d1 180 | 1 ⊢ (Fun 𝐹 → (𝐹‘𝐴) = ∪ (𝐹 “ {𝐴})) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 = wceq 1539 ∈ wcel 2104 ∅c0 4323 {csn 4629 ∪ cuni 4909 dom cdm 5677 “ cima 5680 Fun wfun 6538 Fn wfn 6539 ‘cfv 6544 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5300 ax-nul 5307 ax-pr 5428 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-br 5150 df-opab 5212 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-fv 6552 |
This theorem is referenced by: funfv2 6980 fvun 6982 dffv2 6987 setrecsss 47835 |
Copyright terms: Public domain | W3C validator |