| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1eq3 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for one-to-one functions. (Contributed by NM, 10-Feb-1997.) |
| Ref | Expression |
|---|---|
| f1eq3 | ⊢ (𝐴 = 𝐵 → (𝐹:𝐶–1-1→𝐴 ↔ 𝐹:𝐶–1-1→𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | feq3 6635 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐹:𝐶⟶𝐴 ↔ 𝐹:𝐶⟶𝐵)) | |
| 2 | 1 | anbi1d 637 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐹:𝐶⟶𝐴 ∧ Fun ◡𝐹) ↔ (𝐹:𝐶⟶𝐵 ∧ Fun ◡𝐹))) |
| 3 | df-f1 6490 | . 2 ⊢ (𝐹:𝐶–1-1→𝐴 ↔ (𝐹:𝐶⟶𝐴 ∧ Fun ◡𝐹)) | |
| 4 | df-f1 6490 | . 2 ⊢ (𝐹:𝐶–1-1→𝐵 ↔ (𝐹:𝐶⟶𝐵 ∧ Fun ◡𝐹)) | |
| 5 | 2, 3, 4 | 3bitr4g 315 | 1 ⊢ (𝐴 = 𝐵 → (𝐹:𝐶–1-1→𝐴 ↔ 𝐹:𝐶–1-1→𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ◡ccnv 5617 Fun wfun 6479 ⟶wf 6481 –1-1→wf1 6482 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 df-cleq 2731 df-ss 3900 df-f 6489 df-f1 6490 |
| This theorem is referenced by: f1oeq3 6757 f1eq123d 6759 tposf12 8191 brdom2g 8894 1sdom2dom 9154 pwfseq 10578 f1linds 21800 isusgrs 29243 usgrstrrepe 29322 usgrexilem 29527 tocycval 33189 diaf1oN 41622 f1cof1b 47540 |
| Copyright terms: Public domain | W3C validator |