| 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 5516 | . 2 ⊢ (𝐴 = 𝐵 → (𝐹:𝑋⟶𝐴 ↔ 𝐹:𝑋⟶𝐵)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (𝐹:𝑋⟶𝐴 ↔ 𝐹:𝑋⟶𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1402 ⟶wf 5371 |
| 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 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-11 1559 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-in 3226 df-ss 3233 df-f 5379 |
| This theorem is referenced by: gzsumress 13695 resmhm2b 13779 isghm 14029 gsumvalfi 14135 gsumressfi 14150 uptx 15358 txcn 15359 dvply2g 15850 lgseisenlem3 16174 lgseisenlem4 16175 uhgr0vb 16308 uhgrun 16310 upgrun 16350 umgrun 16352 wksfval 16546 wlkres 16603 |
| Copyright terms: Public domain | W3C validator |