| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > feq23 | Structured version Visualization version 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 6692 | . 2 ⊢ (𝐴 = 𝐶 → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐵)) | |
| 2 | feq3 6693 | . 2 ⊢ (𝐵 = 𝐷 → (𝐹:𝐶⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)) | |
| 3 | 1, 2 | sylan9bb 509 | 1 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ⟶wf 6532 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-9 2119 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 df-cleq 2728 df-ss 3948 df-fn 6539 df-f 6540 |
| This theorem is referenced by: feq23i 6705 ismgmOLD 37879 ismndo2 37903 rngomndo 37964 seff 44300 |
| Copyright terms: Public domain | W3C validator |