| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgruspgr | Structured version Visualization version GIF version | ||
| Description: A simple graph is a simple pseudograph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 15-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgruspgr | ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | eqid 2760 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 1, 2 | isusgr 29613 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
| 4 | 2re 12339 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 5 | 4 | eqlei2 11345 | . . . . . . 7 ⊢ ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2) |
| 6 | 5 | a1i 11 | . . . . . 6 ⊢ (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)) |
| 7 | 6 | ss2rabi 4024 | . . . . 5 ⊢ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} |
| 8 | f1ss 6778 | . . . . 5 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) | |
| 9 | 7, 8 | mpan2 704 | . . . 4 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 10 | 3, 9 | biimtrdi 256 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
| 11 | 1, 2 | isuspgr 29612 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
| 12 | 10, 11 | sylibrd 262 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)) |
| 13 | 12 | pm2.43i 53 | 1 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 {crab 3412 ∖ cdif 3896 ⊆ wss 3899 ∅c0 4279 𝒫 cpw 4557 {csn 4584 class class class wbr 5103 dom cdm 5655 –1-1→wf1 6530 ‘cfv 6533 ≤ cle 11268 2c2 12319 ♯chash 14394 Vtxcvtx 29453 iEdgciedg 29454 USPGraphcuspgr 29608 USGraphcusgr 29609 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-i2m1 11192 ax-1ne0 11193 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-2 12327 df-uspgr 29610 df-usgr 29611 |
| This theorem is used by: usgrumgruspgr 29642 usgruspgrb 29643 usgrupgr 29645 usgrislfuspgr 29647 usgredg2vtxeu 29681 usgredgedg 29690 usgredgleord 29693 vtxdusgrfvedg 29951 usgrn2cycl 30277 wlksnfi 30375 usgrwwlks2on 30426 wpthswwlks2on 30432 usgr2wspthon 30436 rusgrnumwwlk 30446 rusgrnumwlkg 30448 clwlksndivn 30556 clwlknon2num 30848 numclwlk1lem2 30850 isubgr3stgr 48891 usgrexmpl12ngrlic 48955 gpg5ngric 49044 |
| Copyright terms: Public domain | W3C validator |