| 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 5371 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐹 Fn 𝐴 ↔ 𝐹 Fn 𝐵)) | |
| 2 | 1 | anbi1d 465 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶) ↔ (𝐹 Fn 𝐵 ∧ ran 𝐹 ⊆ 𝐶))) |
| 3 | df-f 5283 | . 2 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶)) | |
| 4 | df-f 5283 | . 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 1373 ⊆ wss 3170 ran crn 4683 Fn wfn 5274 ⟶wf 5275 |
| 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 1471 ax-gen 1473 ax-4 1534 ax-17 1550 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-cleq 2199 df-fn 5282 df-f 5283 |
| This theorem is referenced by: feq23 5420 feq2d 5422 feq2i 5428 f00 5478 f0dom0 5480 f1eq2 5488 fressnfv 5783 tfrcllemsucfn 6451 tfrcllemsucaccv 6452 tfrcllembxssdm 6454 tfrcllembfn 6455 tfrcllemaccex 6459 tfrcllemres 6460 tfrcldm 6461 tfrcl 6462 mapvalg 6757 map0g 6787 ac6sfi 7009 isomni 7252 ismkv 7269 iswomni 7281 isghm 13649 |
| Copyright terms: Public domain | W3C validator |