![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > foeq1 | GIF version |
Description: Equality theorem for onto functions. (Contributed by NM, 1-Aug-1994.) |
Ref | Expression |
---|---|
foeq1 | ⊢ (𝐹 = 𝐺 → (𝐹:𝐴–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fneq1 5299 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹 Fn 𝐴 ↔ 𝐺 Fn 𝐴)) | |
2 | rneq 4849 | . . . 4 ⊢ (𝐹 = 𝐺 → ran 𝐹 = ran 𝐺) | |
3 | 2 | eqeq1d 2186 | . . 3 ⊢ (𝐹 = 𝐺 → (ran 𝐹 = 𝐵 ↔ ran 𝐺 = 𝐵)) |
4 | 1, 3 | anbi12d 473 | . 2 ⊢ (𝐹 = 𝐺 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) ↔ (𝐺 Fn 𝐴 ∧ ran 𝐺 = 𝐵))) |
5 | df-fo 5217 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)) | |
6 | df-fo 5217 | . 2 ⊢ (𝐺:𝐴–onto→𝐵 ↔ (𝐺 Fn 𝐴 ∧ ran 𝐺 = 𝐵)) | |
7 | 4, 5, 6 | 3bitr4g 223 | 1 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ran crn 4623 Fn wfn 5206 –onto→wfo 5209 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-v 2739 df-un 3133 df-in 3135 df-ss 3142 df-sn 3597 df-pr 3598 df-op 3600 df-br 4001 df-opab 4062 df-rel 4629 df-cnv 4630 df-co 4631 df-dm 4632 df-rn 4633 df-fun 5213 df-fn 5214 df-fo 5217 |
This theorem is referenced by: f1oeq1 5444 foeq123d 5449 resdif 5478 dif1en 6872 0ct 7099 ctmlemr 7100 ctm 7101 ctssdclemn0 7102 ctssdclemr 7104 ctssdc 7105 enumct 7107 omct 7109 ctssexmid 7141 exmidfodomrlemim 7193 ennnfonelemim 12395 ctinfomlemom 12398 ctinfom 12399 ctinf 12401 qnnen 12402 enctlem 12403 ctiunct 12411 omctfn 12414 ssomct 12416 mndfo 12719 subctctexmid 14373 |
Copyright terms: Public domain | W3C validator |