| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fneq2d | GIF version | ||
| Description: Equality deduction for function predicate with domain. (Contributed by Paul Chapman, 22-Jun-2011.) |
| Ref | Expression |
|---|---|
| fneq2d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| fneq2d | ⊢ (𝜑 → (𝐹 Fn 𝐴 ↔ 𝐹 Fn 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fneq2d.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | fneq2 5371 | . 2 ⊢ (𝐴 = 𝐵 → (𝐹 Fn 𝐴 ↔ 𝐹 Fn 𝐵)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (𝐹 Fn 𝐴 ↔ 𝐹 Fn 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1373 Fn wfn 5274 |
| 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 |
| This theorem is referenced by: fneq12d 5374 acfun 7334 ccfunen 7391 ccatlid 11080 ccatrid 11081 ccatass 11082 ccatswrd 11141 swrdccat2 11142 ccatpfx 11172 swrdswrd 11176 seq3shft 11219 ptex 13166 srg1zr 13819 |
| Copyright terms: Public domain | W3C validator |