![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > usgrf | Structured version Visualization version GIF version |
Description: The edge function of a simple graph is a one-to-one function into unordered pairs of vertices. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 13-Oct-2020.) |
Ref | Expression |
---|---|
isuspgr.v | ⊢ 𝑉 = (Vtx‘𝐺) |
isuspgr.e | ⊢ 𝐸 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
usgrf | ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isuspgr.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | isuspgr.e | . . 3 ⊢ 𝐸 = (iEdg‘𝐺) | |
3 | 1, 2 | isusgr 26269 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
4 | 3 | ibi 256 | 1 ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1630 ∈ wcel 2144 {crab 3064 ∖ cdif 3718 ∅c0 4061 𝒫 cpw 4295 {csn 4314 dom cdm 5249 –1-1→wf1 6028 ‘cfv 6031 2c2 11271 ♯chash 13320 Vtxcvtx 26094 iEdgciedg 26095 USGraphcusgr 26265 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1869 ax-4 1884 ax-5 1990 ax-6 2056 ax-7 2092 ax-9 2153 ax-10 2173 ax-11 2189 ax-12 2202 ax-13 2407 ax-ext 2750 ax-nul 4920 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 827 df-3an 1072 df-tru 1633 df-ex 1852 df-nf 1857 df-sb 2049 df-eu 2621 df-clab 2757 df-cleq 2763 df-clel 2766 df-nfc 2901 df-ral 3065 df-rex 3066 df-rab 3069 df-v 3351 df-sbc 3586 df-dif 3724 df-un 3726 df-in 3728 df-ss 3735 df-nul 4062 df-if 4224 df-pw 4297 df-sn 4315 df-pr 4317 df-op 4321 df-uni 4573 df-br 4785 df-opab 4845 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fv 6039 df-usgr 26267 |
This theorem is referenced by: usgredg2ALT 26306 usgrf1oedg 26320 usgrsizedg 26328 usgrres 26422 clwlksfclwwlkOLD 27240 |
Copyright terms: Public domain | W3C validator |