Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > foeq123d | GIF version |
Description: Equality deduction for onto functions. (Contributed by Mario Carneiro, 27-Jan-2017.) |
Ref | Expression |
---|---|
f1eq123d.1 | ⊢ (𝜑 → 𝐹 = 𝐺) |
f1eq123d.2 | ⊢ (𝜑 → 𝐴 = 𝐵) |
f1eq123d.3 | ⊢ (𝜑 → 𝐶 = 𝐷) |
Ref | Expression |
---|---|
foeq123d | ⊢ (𝜑 → (𝐹:𝐴–onto→𝐶 ↔ 𝐺:𝐵–onto→𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1eq123d.1 | . . 3 ⊢ (𝜑 → 𝐹 = 𝐺) | |
2 | foeq1 5400 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴–onto→𝐶 ↔ 𝐺:𝐴–onto→𝐶)) | |
3 | 1, 2 | syl 14 | . 2 ⊢ (𝜑 → (𝐹:𝐴–onto→𝐶 ↔ 𝐺:𝐴–onto→𝐶)) |
4 | f1eq123d.2 | . . 3 ⊢ (𝜑 → 𝐴 = 𝐵) | |
5 | foeq2 5401 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐺:𝐴–onto→𝐶 ↔ 𝐺:𝐵–onto→𝐶)) | |
6 | 4, 5 | syl 14 | . 2 ⊢ (𝜑 → (𝐺:𝐴–onto→𝐶 ↔ 𝐺:𝐵–onto→𝐶)) |
7 | f1eq123d.3 | . . 3 ⊢ (𝜑 → 𝐶 = 𝐷) | |
8 | foeq3 5402 | . . 3 ⊢ (𝐶 = 𝐷 → (𝐺:𝐵–onto→𝐶 ↔ 𝐺:𝐵–onto→𝐷)) | |
9 | 7, 8 | syl 14 | . 2 ⊢ (𝜑 → (𝐺:𝐵–onto→𝐶 ↔ 𝐺:𝐵–onto→𝐷)) |
10 | 3, 6, 9 | 3bitrd 213 | 1 ⊢ (𝜑 → (𝐹:𝐴–onto→𝐶 ↔ 𝐺:𝐵–onto→𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1342 –onto→wfo 5180 |
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-fo 5188 |
This theorem is referenced by: ctssexmid 7105 ctiunctal 12317 unct 12318 |
Copyright terms: Public domain | W3C validator |