![]() |
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 2733 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
2 | eqid 2733 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
3 | 1, 2 | isusgr 28413 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
4 | 2re 12286 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
5 | 4 | eqlei2 11325 | . . . . . . 7 ⊢ ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2) |
6 | 5 | a1i 11 | . . . . . 6 ⊢ (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)) |
7 | 6 | ss2rabi 4075 | . . . . 5 ⊢ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} |
8 | f1ss 6794 | . . . . 5 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) | |
9 | 7, 8 | mpan2 690 | . . . 4 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
10 | 3, 9 | syl6bi 253 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
11 | 1, 2 | isuspgr 28412 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
12 | 10, 11 | sylibrd 259 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)) |
13 | 12 | pm2.43i 52 | 1 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2107 {crab 3433 ∖ cdif 3946 ⊆ wss 3949 ∅c0 4323 𝒫 cpw 4603 {csn 4629 class class class wbr 5149 dom cdm 5677 –1-1→wf1 6541 ‘cfv 6544 ≤ cle 11249 2c2 12267 ♯chash 14290 Vtxcvtx 28256 iEdgciedg 28257 USPGraphcuspgr 28408 USGraphcusgr 28409 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-i2m1 11178 ax-1ne0 11179 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-po 5589 df-so 5590 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-2 12275 df-uspgr 28410 df-usgr 28411 |
This theorem is referenced by: usgrumgruspgr 28440 usgruspgrb 28441 usgrupgr 28442 usgrislfuspgr 28444 usgredg2vtxeu 28478 usgredgedg 28487 usgredgleord 28490 vtxdusgrfvedg 28748 usgrn2cycl 29063 wlksnfi 29161 rusgrnumwwlk 29229 rusgrnumwlkg 29231 clwlksndivn 29339 clwlknon2num 29621 numclwlk1lem2 29623 |
Copyright terms: Public domain | W3C validator |