| 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 5455 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴⟶𝐵 ↔ 𝐺:𝐴⟶𝐵)) | |
| 2 | cnveq 4895 | . . . 4 ⊢ (𝐹 = 𝐺 → ◡𝐹 = ◡𝐺) | |
| 3 | 2 | funeqd 5339 | . . 3 ⊢ (𝐹 = 𝐺 → (Fun ◡𝐹 ↔ Fun ◡𝐺)) |
| 4 | 1, 3 | anbi12d 473 | . 2 ⊢ (𝐹 = 𝐺 → ((𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹) ↔ (𝐺:𝐴⟶𝐵 ∧ Fun ◡𝐺))) |
| 5 | df-f1 5322 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
| 6 | df-f1 5322 | . 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 1395 ◡ccnv 4717 Fun wfun 5311 ⟶wf 5313 –1-1→wf1 5314 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-sn 3672 df-pr 3673 df-op 3675 df-br 4083 df-opab 4145 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 |
| This theorem is referenced by: f1oeq1 5559 f1eq123d 5563 fun11iun 5592 fo00 5608 tposf12 6413 f1dom4g 6902 f1dom2g 6905 f1domg 6907 dom3d 6923 domtr 6935 djudom 7256 difinfsn 7263 djudoml 7397 djudomr 7398 4sqlem11 12919 nninfdc 13019 conjsubgen 13810 dom1o 16314 |
| Copyright terms: Public domain | W3C validator |