| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fneq1 | GIF version | ||
| Description: Equality theorem for function predicate with domain. (Contributed by NM, 1-Aug-1994.) |
| Ref | Expression |
|---|---|
| fneq1 | ⊢ (𝐹 = 𝐺 → (𝐹 Fn 𝐴 ↔ 𝐺 Fn 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funeq 5288 | . . 3 ⊢ (𝐹 = 𝐺 → (Fun 𝐹 ↔ Fun 𝐺)) | |
| 2 | dmeq 4876 | . . . 4 ⊢ (𝐹 = 𝐺 → dom 𝐹 = dom 𝐺) | |
| 3 | 2 | eqeq1d 2213 | . . 3 ⊢ (𝐹 = 𝐺 → (dom 𝐹 = 𝐴 ↔ dom 𝐺 = 𝐴)) |
| 4 | 1, 3 | anbi12d 473 | . 2 ⊢ (𝐹 = 𝐺 → ((Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ (Fun 𝐺 ∧ dom 𝐺 = 𝐴))) |
| 5 | df-fn 5271 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
| 6 | df-fn 5271 | . 2 ⊢ (𝐺 Fn 𝐴 ↔ (Fun 𝐺 ∧ dom 𝐺 = 𝐴)) | |
| 7 | 4, 5, 6 | 3bitr4g 223 | 1 ⊢ (𝐹 = 𝐺 → (𝐹 Fn 𝐴 ↔ 𝐺 Fn 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1372 dom cdm 4673 Fun wfun 5262 Fn wfn 5263 |
| 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-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-v 2773 df-un 3169 df-in 3171 df-ss 3178 df-sn 3638 df-pr 3639 df-op 3641 df-br 4044 df-opab 4105 df-rel 4680 df-cnv 4681 df-co 4682 df-dm 4683 df-fun 5270 df-fn 5271 |
| This theorem is referenced by: fneq1d 5358 fneq1i 5362 fn0 5389 feq1 5402 foeq1 5488 f1ocnv 5529 mpteqb 5664 eufnfv 5805 uchoice 6213 tfr0dm 6398 tfrlemiex 6407 tfr1onlemsucfn 6416 tfr1onlemsucaccv 6417 tfr1onlembxssdm 6419 tfr1onlembfn 6420 tfr1onlemex 6423 tfr1onlemaccex 6424 tfr1onlemres 6425 mapval2 6755 elixp2 6779 ixpfn 6781 elixpsn 6812 cc2lem 7360 cc3 7362 lmodfopnelem1 14004 |
| Copyright terms: Public domain | W3C validator |