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 5314 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴⟶𝐵 ↔ 𝐺:𝐴⟶𝐵)) | |
2 | cnveq 4772 | . . . 4 ⊢ (𝐹 = 𝐺 → ◡𝐹 = ◡𝐺) | |
3 | 2 | funeqd 5204 | . . 3 ⊢ (𝐹 = 𝐺 → (Fun ◡𝐹 ↔ Fun ◡𝐺)) |
4 | 1, 3 | anbi12d 465 | . 2 ⊢ (𝐹 = 𝐺 → ((𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹) ↔ (𝐺:𝐴⟶𝐵 ∧ Fun ◡𝐺))) |
5 | df-f1 5187 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
6 | df-f1 5187 | . 2 ⊢ (𝐺:𝐴–1-1→𝐵 ↔ (𝐺:𝐴⟶𝐵 ∧ Fun ◡𝐺)) | |
7 | 4, 5, 6 | 3bitr4g 222 | 1 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴–1-1→𝐵 ↔ 𝐺:𝐴–1-1→𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1342 ◡ccnv 4597 Fun wfun 5176 ⟶wf 5178 –1-1→wf1 5179 |
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 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-v 2723 df-un 3115 df-in 3117 df-ss 3124 df-sn 3576 df-pr 3577 df-op 3579 df-br 3977 df-opab 4038 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-fun 5184 df-fn 5185 df-f 5186 df-f1 5187 |
This theorem is referenced by: f1oeq1 5415 f1eq123d 5419 fun11iun 5447 fo00 5462 tposf12 6228 f1dom2g 6713 f1domg 6715 dom3d 6731 domtr 6742 djudom 7049 difinfsn 7056 djudoml 7166 djudomr 7167 nninfdc 12325 |
Copyright terms: Public domain | W3C validator |