| 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 5346 | . . 3 ⊢ (𝐹 = 𝐺 → (Fun 𝐹 ↔ Fun 𝐺)) | |
| 2 | dmeq 4931 | . . . 4 ⊢ (𝐹 = 𝐺 → dom 𝐹 = dom 𝐺) | |
| 3 | 2 | eqeq1d 2240 | . . 3 ⊢ (𝐹 = 𝐺 → (dom 𝐹 = 𝐴 ↔ dom 𝐺 = 𝐴)) |
| 4 | 1, 3 | anbi12d 473 | . 2 ⊢ (𝐹 = 𝐺 → ((Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ (Fun 𝐺 ∧ dom 𝐺 = 𝐴))) |
| 5 | df-fn 5329 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)) | |
| 6 | df-fn 5329 | . 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 1397 dom cdm 4725 Fun wfun 5320 Fn wfn 5321 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-sn 3675 df-pr 3676 df-op 3678 df-br 4089 df-opab 4151 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-fun 5328 df-fn 5329 |
| This theorem is referenced by: fneq1d 5420 fneq1i 5424 fn0 5452 feq1 5465 foeq1 5555 f1ocnv 5596 mpteqb 5737 eufnfv 5885 uchoice 6300 tfr0dm 6488 tfrlemiex 6497 tfr1onlemsucfn 6506 tfr1onlemsucaccv 6507 tfr1onlembxssdm 6509 tfr1onlembfn 6510 tfr1onlemex 6513 tfr1onlemaccex 6514 tfr1onlemres 6515 mapval2 6847 elixp2 6871 ixpfn 6873 elixpsn 6904 cc2lem 7485 cc3 7487 lmodfopnelem1 14344 |
| Copyright terms: Public domain | W3C validator |