Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fneq12 | GIF version |
Description: Equality theorem for function predicate with domain. (Contributed by Thierry Arnoux, 31-Jan-2017.) |
Ref | Expression |
---|---|
fneq12 | ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → (𝐹 Fn 𝐴 ↔ 𝐺 Fn 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 108 | . 2 ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → 𝐹 = 𝐺) | |
2 | simpr 109 | . 2 ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
3 | 1, 2 | fneq12d 5215 | 1 ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → (𝐹 Fn 𝐴 ↔ 𝐺 Fn 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 Fn wfn 5118 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-v 2688 df-un 3075 df-in 3077 df-ss 3084 df-sn 3533 df-pr 3534 df-op 3536 df-br 3930 df-opab 3990 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-fun 5125 df-fn 5126 |
This theorem is referenced by: tfrlem3ag 6206 tfrlem3a 6207 tfr1onlem3ag 6234 frecfnom 6298 |
Copyright terms: Public domain | W3C validator |