| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f1eq1 | GIF version | ||
| Description: Equality theorem for one-to-one functions. (Contributed by NM, 10-Feb-1997.) |
| Ref | Expression |
|---|---|
| f1eq1 | ⊢ (𝐹 = 𝐺 → (𝐹:𝐴–1-1→𝐵 ↔ 𝐺:𝐴–1-1→𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | feq1 5407 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴⟶𝐵 ↔ 𝐺:𝐴⟶𝐵)) | |
| 2 | cnveq 4851 | . . . 4 ⊢ (𝐹 = 𝐺 → ◡𝐹 = ◡𝐺) | |
| 3 | 2 | funeqd 5292 | . . 3 ⊢ (𝐹 = 𝐺 → (Fun ◡𝐹 ↔ Fun ◡𝐺)) |
| 4 | 1, 3 | anbi12d 473 | . 2 ⊢ (𝐹 = 𝐺 → ((𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹) ↔ (𝐺:𝐴⟶𝐵 ∧ Fun ◡𝐺))) |
| 5 | df-f1 5275 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
| 6 | df-f1 5275 | . 2 ⊢ (𝐺:𝐴–1-1→𝐵 ↔ (𝐺:𝐴⟶𝐵 ∧ Fun ◡𝐺)) | |
| 7 | 4, 5, 6 | 3bitr4g 223 | 1 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴–1-1→𝐵 ↔ 𝐺:𝐴–1-1→𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1372 ◡ccnv 4673 Fun wfun 5264 ⟶wf 5266 –1-1→wf1 5267 |
| 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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-v 2773 df-un 3169 df-in 3171 df-ss 3178 df-sn 3638 df-pr 3639 df-op 3641 df-br 4044 df-opab 4105 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-rn 4685 df-fun 5272 df-fn 5273 df-f 5274 df-f1 5275 |
| This theorem is referenced by: f1oeq1 5509 f1eq123d 5513 fun11iun 5542 fo00 5557 tposf12 6354 f1dom4g 6843 f1dom2g 6846 f1domg 6848 dom3d 6864 domtr 6876 djudom 7194 difinfsn 7201 djudoml 7330 djudomr 7331 4sqlem11 12666 nninfdc 12766 conjsubgen 13556 |
| Copyright terms: Public domain | W3C validator |