Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > funfni | Structured version Visualization version GIF version |
Description: Inference to convert a function and domain antecedent. (Contributed by NM, 22-Apr-2004.) |
Ref | Expression |
---|---|
funfni.1 | ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → 𝜑) |
Ref | Expression |
---|---|
funfni | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnfun 6452 | . 2 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
2 | fndm 6454 | . . . 4 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
3 | 2 | eleq2d 2898 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ dom 𝐹 ↔ 𝐵 ∈ 𝐴)) |
4 | 3 | biimpar 480 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ dom 𝐹) |
5 | funfni.1 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → 𝜑) | |
6 | 1, 4, 5 | syl2an2r 683 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2110 dom cdm 5554 Fun wfun 6348 Fn wfn 6349 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 df-cleq 2814 df-clel 2893 df-fn 6357 |
This theorem is referenced by: fneu 6460 elpreima 6827 fnopfv 6842 fnfvelrn 6847 funressnfv 43277 fnafvelrn 43367 afvco2 43374 fnafv2elrn 43431 fnbrafv2b 43446 |
Copyright terms: Public domain | W3C validator |