| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > feq2 | GIF version | ||
| Description: Equality theorem for functions. (Contributed by NM, 1-Aug-1994.) |
| Ref | Expression |
|---|---|
| feq2 | ⊢ (𝐴 = 𝐵 → (𝐹:𝐴⟶𝐶 ↔ 𝐹:𝐵⟶𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fneq2 5410 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐹 Fn 𝐴 ↔ 𝐹 Fn 𝐵)) | |
| 2 | 1 | anbi1d 465 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶) ↔ (𝐹 Fn 𝐵 ∧ ran 𝐹 ⊆ 𝐶))) |
| 3 | df-f 5322 | . 2 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶)) | |
| 4 | df-f 5322 | . 2 ⊢ (𝐹:𝐵⟶𝐶 ↔ (𝐹 Fn 𝐵 ∧ ran 𝐹 ⊆ 𝐶)) | |
| 5 | 2, 3, 4 | 3bitr4g 223 | 1 ⊢ (𝐴 = 𝐵 → (𝐹:𝐴⟶𝐶 ↔ 𝐹:𝐵⟶𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ⊆ wss 3197 ran crn 4720 Fn wfn 5313 ⟶wf 5314 |
| 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 1493 ax-gen 1495 ax-4 1556 ax-17 1572 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-cleq 2222 df-fn 5321 df-f 5322 |
| This theorem is referenced by: feq23 5459 feq2d 5461 feq2i 5467 f00 5519 f0dom0 5521 f1eq2 5529 fressnfv 5830 tfrcllemsucfn 6505 tfrcllemsucaccv 6506 tfrcllembxssdm 6508 tfrcllembfn 6509 tfrcllemaccex 6513 tfrcllemres 6514 tfrcldm 6515 tfrcl 6516 mapvalg 6813 map0g 6843 ac6sfi 7068 isomni 7311 ismkv 7328 iswomni 7340 isghm 13788 |
| Copyright terms: Public domain | W3C validator |