| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > usgrf1oedg | GIF version | ||
| Description: The edge function of a simple graph is a 1-1 function onto the set of edges. (Contributed by AV, 18-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgrf1oedg.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| usgrf1oedg.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| usgrf1oedg | ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgrf1oedg.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 2 | 1 | usgrf1o 15929 | . 2 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→ran 𝐼) |
| 3 | usgrf1oedg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 4 | edgvalg 15817 | . . . . 5 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran (iEdg‘𝐺)) | |
| 5 | 1 | eqcomi 2211 | . . . . . 6 ⊢ (iEdg‘𝐺) = 𝐼 |
| 6 | 5 | rneqi 4926 | . . . . 5 ⊢ ran (iEdg‘𝐺) = ran 𝐼 |
| 7 | 4, 6 | eqtrdi 2256 | . . . 4 ⊢ (𝐺 ∈ USGraph → (Edg‘𝐺) = ran 𝐼) |
| 8 | 3, 7 | eqtrid 2252 | . . 3 ⊢ (𝐺 ∈ USGraph → 𝐸 = ran 𝐼) |
| 9 | 8 | f1oeq3d 5542 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐼:dom 𝐼–1-1-onto→𝐸 ↔ 𝐼:dom 𝐼–1-1-onto→ran 𝐼)) |
| 10 | 2, 9 | mpbird 167 | 1 ⊢ (𝐺 ∈ USGraph → 𝐼:dom 𝐼–1-1-onto→𝐸) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 ∈ wcel 2178 dom cdm 4694 ran crn 4695 –1-1-onto→wf1o 5290 ‘cfv 5291 iEdgciedg 15773 Edgcedg 15815 USGraphcusgr 15909 |
| 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-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4179 ax-pow 4235 ax-pr 4270 ax-un 4499 ax-setind 4604 ax-cnex 8053 ax-resscn 8054 ax-1cn 8055 ax-1re 8056 ax-icn 8057 ax-addcl 8058 ax-addrcl 8059 ax-mulcl 8060 ax-addcom 8062 ax-mulcom 8063 ax-addass 8064 ax-mulass 8065 ax-distr 8066 ax-i2m1 8067 ax-1rid 8069 ax-0id 8070 ax-rnegex 8071 ax-cnre 8073 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-ral 2491 df-rex 2492 df-reu 2493 df-rab 2495 df-v 2779 df-sbc 3007 df-csb 3103 df-dif 3177 df-un 3179 df-in 3181 df-ss 3188 df-if 3581 df-pw 3629 df-sn 3650 df-pr 3651 df-op 3653 df-uni 3866 df-int 3901 df-br 4061 df-opab 4123 df-mpt 4124 df-id 4359 df-xp 4700 df-rel 4701 df-cnv 4702 df-co 4703 df-dm 4704 df-rn 4705 df-res 4706 df-iota 5252 df-fun 5293 df-fn 5294 df-f 5295 df-f1 5296 df-fo 5297 df-f1o 5298 df-fv 5299 df-riota 5924 df-ov 5972 df-oprab 5973 df-mpo 5974 df-1st 6251 df-2nd 6252 df-sub 8282 df-inn 9074 df-2 9132 df-3 9133 df-4 9134 df-5 9135 df-6 9136 df-7 9137 df-8 9138 df-9 9139 df-n0 9333 df-dec 9542 df-ndx 12996 df-slot 12997 df-base 12999 df-edgf 15765 df-vtx 15774 df-iedg 15775 df-edg 15816 df-usgren 15911 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |