| 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 5472 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴⟶𝐵 ↔ 𝐺:𝐴⟶𝐵)) | |
| 2 | cnveq 4910 | . . . 4 ⊢ (𝐹 = 𝐺 → ◡𝐹 = ◡𝐺) | |
| 3 | 2 | funeqd 5355 | . . 3 ⊢ (𝐹 = 𝐺 → (Fun ◡𝐹 ↔ Fun ◡𝐺)) |
| 4 | 1, 3 | anbi12d 473 | . 2 ⊢ (𝐹 = 𝐺 → ((𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹) ↔ (𝐺:𝐴⟶𝐵 ∧ Fun ◡𝐺))) |
| 5 | df-f1 5338 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
| 6 | df-f1 5338 | . 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 1398 ◡ccnv 4730 Fun wfun 5327 ⟶wf 5329 –1-1→wf1 5330 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-sn 3679 df-pr 3680 df-op 3682 df-br 4094 df-opab 4156 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 |
| This theorem is referenced by: f1oeq1 5580 f1eq123d 5584 fun11iun 5613 fo00 5630 tposf12 6478 f1dom4g 6969 f1dom2g 6972 f1domg 6974 dom3d 6990 domtr 7002 dom1o 7045 djudom 7335 difinfsn 7342 djudoml 7477 djudomr 7478 4sqlem11 13037 nninfdc 13137 conjsubgen 13928 |
| Copyright terms: Public domain | W3C validator |