| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fneq2d | GIF version | ||
| Description: Equality deduction for function predicate with domain. (Contributed by Paul Chapman, 22-Jun-2011.) |
| Ref | Expression |
|---|---|
| fneq2d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| fneq2d | ⊢ (𝜑 → (𝐹 Fn 𝐴 ↔ 𝐹 Fn 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fneq2d.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | fneq2 5008 | . 2 ⊢ (𝐴 = 𝐵 → (𝐹 Fn 𝐴 ↔ 𝐹 Fn 𝐵)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (𝐹 Fn 𝐴 ↔ 𝐹 Fn 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 103 = wceq 1284 Fn wfn 4917 |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-gen 1378 ax-4 1440 ax-17 1459 ax-ext 2063 |
| This theorem depends on definitions: df-bi 115 df-cleq 2074 df-fn 4925 |
| This theorem is referenced by: fneq12d 5011 |
| Copyright terms: Public domain | W3C validator |