| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > feq23 | GIF version | ||
| Description: Equality theorem for functions. (Contributed by FL, 14-Jul-2007.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
| Ref | Expression |
|---|---|
| feq23 | ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | feq2 5512 | . 2 ⊢ (𝐴 = 𝐶 → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐵)) | |
| 2 | feq3 5513 | . 2 ⊢ (𝐵 = 𝐷 → (𝐹:𝐶⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)) | |
| 3 | 1, 2 | sylan9bb 466 | 1 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ⟶wf 5368 |
| 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-fn 5375 df-f 5376 |
| This theorem is referenced by: feq23i 5523 |
| Copyright terms: Public domain | W3C validator |