![]() |
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 5147 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹 Fn 𝐴 ↔ 𝐺 Fn 𝐴)) | |
2 | rneq 4704 | . . . 4 ⊢ (𝐹 = 𝐺 → ran 𝐹 = ran 𝐺) | |
3 | 2 | eqeq1d 2108 | . . 3 ⊢ (𝐹 = 𝐺 → (ran 𝐹 = 𝐵 ↔ ran 𝐺 = 𝐵)) |
4 | 1, 3 | anbi12d 460 | . 2 ⊢ (𝐹 = 𝐺 → ((𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵) ↔ (𝐺 Fn 𝐴 ∧ ran 𝐺 = 𝐵))) |
5 | df-fo 5065 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = 𝐵)) | |
6 | df-fo 5065 | . 2 ⊢ (𝐺:𝐴–onto→𝐵 ↔ (𝐺 Fn 𝐴 ∧ ran 𝐺 = 𝐵)) | |
7 | 4, 5, 6 | 3bitr4g 222 | 1 ⊢ (𝐹 = 𝐺 → (𝐹:𝐴–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1299 ran crn 4478 Fn wfn 5054 –onto→wfo 5057 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 671 ax-5 1391 ax-7 1392 ax-gen 1393 ax-ie1 1437 ax-ie2 1438 ax-8 1450 ax-10 1451 ax-11 1452 ax-i12 1453 ax-bndl 1454 ax-4 1455 ax-17 1474 ax-i9 1478 ax-ial 1482 ax-i5r 1483 ax-ext 2082 |
This theorem depends on definitions: df-bi 116 df-3an 932 df-tru 1302 df-nf 1405 df-sb 1704 df-clab 2087 df-cleq 2093 df-clel 2096 df-nfc 2229 df-v 2643 df-un 3025 df-in 3027 df-ss 3034 df-sn 3480 df-pr 3481 df-op 3483 df-br 3876 df-opab 3930 df-rel 4484 df-cnv 4485 df-co 4486 df-dm 4487 df-rn 4488 df-fun 5061 df-fn 5062 df-fo 5065 |
This theorem is referenced by: f1oeq1 5292 foeq123d 5297 resdif 5323 dif1en 6702 0ct 6907 ctmlemr 6908 ctm 6909 ctssdclemn0 6910 ctssdclemr 6911 ctssdc 6912 enumct 6914 ctssexmid 6936 exmidfodomrlemim 6966 ennnfonelemim 11729 ctinfomlemom 11732 ctinfom 11733 ctinf 11735 qnnen 11736 |
Copyright terms: Public domain | W3C validator |