| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fneq12 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for function predicate with domain. (Contributed by Thierry Arnoux, 31-Jan-2017.) |
| Ref | Expression |
|---|---|
| fneq12 | ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → (𝐹 Fn 𝐴 ↔ 𝐺 Fn 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . 2 ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → 𝐹 = 𝐺) | |
| 2 | simpr 490 | . 2 ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 3 | 1, 2 | fneq12d 6639 | 1 ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → (𝐹 Fn 𝐴 ↔ 𝐺 Fn 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 Fn wfn 6538 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-fun 6545 df-fn 6546 |
| This theorem is used by: fprlem1 8326 tfrlem3a 8392 frrlem15 9768 hashresfn 14491 |
| Copyright terms: Public domain | W3C validator |