| 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 5300 | . . 3 ⊢ (𝐹 = 𝐺 → (Fun 𝐹 ↔ Fun 𝐺)) | |
| 2 | dmeq 4887 | . . . 4 ⊢ (𝐹 = 𝐺 → dom 𝐹 = dom 𝐺) | |
| 3 | 2 | eqeq1d 2215 | . . 3 ⊢ (𝐹 = 𝐺 → (dom 𝐹 = 𝐴 ↔ dom 𝐺 = 𝐴)) |
| 4 | 1, 3 | anbi12d 473 | . 2 ⊢ (𝐹 = 𝐺 → ((Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ (Fun 𝐺 ∧ dom 𝐺 = 𝐴))) |
| 5 | df-fn 5283 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
| 6 | df-fn 5283 | . 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 1373 dom cdm 4683 Fun wfun 5274 Fn wfn 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-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-v 2775 df-un 3174 df-in 3176 df-ss 3183 df-sn 3644 df-pr 3645 df-op 3647 df-br 4052 df-opab 4114 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-fun 5282 df-fn 5283 |
| This theorem is referenced by: fneq1d 5373 fneq1i 5377 fn0 5405 feq1 5418 foeq1 5506 f1ocnv 5547 mpteqb 5683 eufnfv 5828 uchoice 6236 tfr0dm 6421 tfrlemiex 6430 tfr1onlemsucfn 6439 tfr1onlemsucaccv 6440 tfr1onlembxssdm 6442 tfr1onlembfn 6443 tfr1onlemex 6446 tfr1onlemaccex 6447 tfr1onlemres 6448 mapval2 6778 elixp2 6802 ixpfn 6804 elixpsn 6835 cc2lem 7398 cc3 7400 lmodfopnelem1 14161 |
| Copyright terms: Public domain | W3C validator |