| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > feq3d | GIF version | ||
| Description: Equality deduction for functions. (Contributed by AV, 1-Jan-2020.) |
| Ref | Expression |
|---|---|
| feq2d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| feq3d | ⊢ (𝜑 → (𝐹:𝑋⟶𝐴 ↔ 𝐹:𝑋⟶𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | feq2d.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | feq3 5474 | . 2 ⊢ (𝐴 = 𝐵 → (𝐹:𝑋⟶𝐴 ↔ 𝐹:𝑋⟶𝐵)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (𝐹:𝑋⟶𝐴 ↔ 𝐹:𝑋⟶𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ⟶wf 5329 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-11 1555 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-in 3207 df-ss 3214 df-f 5337 |
| This theorem is referenced by: gsumress 13539 resmhm2b 13633 isghm 13891 uptx 15065 txcn 15066 dvply2g 15557 lgseisenlem3 15871 lgseisenlem4 15872 uhgr0vb 16005 uhgrun 16007 upgrun 16047 umgrun 16049 wksfval 16243 wlkres 16300 gfsumval 16789 |
| Copyright terms: Public domain | W3C validator |