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 5988 | . 2 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
2 | fndm 5990 | . . . 4 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
3 | 2 | eleq2d 2687 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ dom 𝐹 ↔ 𝐵 ∈ 𝐴)) |
4 | 3 | biimpar 502 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ dom 𝐹) |
5 | funfni.1 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → 𝜑) | |
6 | 1, 4, 5 | syl2an2r 876 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∈ wcel 1990 dom cdm 5114 Fun wfun 5882 Fn wfn 5883 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 df-cleq 2615 df-clel 2618 df-fn 5891 |
This theorem is referenced by: fneu 5995 elpreima 6337 fnopfv 6351 fnfvelrn 6356 funressnfv 41208 fnafvelrn 41249 afvco2 41256 |
Copyright terms: Public domain | W3C validator |