| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f1eq123d | GIF version | ||
| Description: Equality deduction for one-to-one functions. (Contributed by Mario Carneiro, 27-Jan-2017.) |
| Ref | Expression |
|---|---|
| f1eq123d.1 | ⊢ (𝜑 → 𝐹 = 𝐺) |
| f1eq123d.2 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| f1eq123d.3 | ⊢ (𝜑 → 𝐶 = 𝐷) |
| Ref | Expression |
|---|---|
| f1eq123d | ⊢ (𝜑 → (𝐹:𝐴–1-1→𝐶 ↔ 𝐺:𝐵–1-1→𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1eq123d.1 | . . 3 ⊢ (𝜑 → 𝐹 = 𝐺) | |
| 2 | f1eq1 5522 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴–1-1→𝐶 ↔ 𝐺:𝐴–1-1→𝐶)) | |
| 3 | 1, 2 | syl 14 | . 2 ⊢ (𝜑 → (𝐹:𝐴–1-1→𝐶 ↔ 𝐺:𝐴–1-1→𝐶)) |
| 4 | f1eq123d.2 | . . 3 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 5 | f1eq2 5523 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐺:𝐴–1-1→𝐶 ↔ 𝐺:𝐵–1-1→𝐶)) | |
| 6 | 4, 5 | syl 14 | . 2 ⊢ (𝜑 → (𝐺:𝐴–1-1→𝐶 ↔ 𝐺:𝐵–1-1→𝐶)) |
| 7 | f1eq123d.3 | . . 3 ⊢ (𝜑 → 𝐶 = 𝐷) | |
| 8 | f1eq3 5524 | . . 3 ⊢ (𝐶 = 𝐷 → (𝐺:𝐵–1-1→𝐶 ↔ 𝐺:𝐵–1-1→𝐷)) | |
| 9 | 7, 8 | syl 14 | . 2 ⊢ (𝜑 → (𝐺:𝐵–1-1→𝐶 ↔ 𝐺:𝐵–1-1→𝐷)) |
| 10 | 3, 6, 9 | 3bitrd 214 | 1 ⊢ (𝜑 → (𝐹:𝐴–1-1→𝐶 ↔ 𝐺:𝐵–1-1→𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1395 –1-1→wf1 5311 |
| 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 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-rn 4727 df-fun 5316 df-fn 5317 df-f 5318 df-f1 5319 |
| This theorem is referenced by: f10d 5603 isushgrm 15857 isuspgren 15940 isusgren 15941 isuspgropen 15947 isusgropen 15948 ausgrusgrben 15951 ausgrusgrien 15954 usgrstrrepeen 16014 |
| Copyright terms: Public domain | W3C validator |