| 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 2737 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | eqid 2737 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 1, 2 | isusgr 29238 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
| 4 | 2re 12231 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 5 | 4 | eqlei2 11256 | . . . . . . 7 ⊢ ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2) |
| 6 | 5 | a1i 11 | . . . . . 6 ⊢ (𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) → ((♯‘𝑥) = 2 → (♯‘𝑥) ≤ 2)) |
| 7 | 6 | ss2rabi 4030 | . . . . 5 ⊢ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} |
| 8 | f1ss 6743 | . . . . 5 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) | |
| 9 | 7, 8 | mpan2 692 | . . . 4 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
| 10 | 3, 9 | biimtrdi 253 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
| 11 | 1, 2 | isuspgr 29237 | . . 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 2114 {crab 3401 ∖ cdif 3900 ⊆ wss 3903 ∅c0 4287 𝒫 cpw 4556 {csn 4582 class class class wbr 5100 dom cdm 5632 –1-1→wf1 6497 ‘cfv 6500 ≤ cle 11179 2c2 12212 ♯chash 14265 Vtxcvtx 29081 iEdgciedg 29082 USPGraphcuspgr 29233 USGraphcusgr 29234 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-i2m1 11106 ax-1ne0 11107 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-po 5540 df-so 5541 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-2 12220 df-uspgr 29235 df-usgr 29236 |
| This theorem is referenced by: usgrumgruspgr 29267 usgruspgrb 29268 usgrupgr 29270 usgrislfuspgr 29272 usgredg2vtxeu 29306 usgredgedg 29315 usgredgleord 29318 vtxdusgrfvedg 29577 usgrn2cycl 29894 wlksnfi 29992 usgrwwlks2on 30043 wpthswwlks2on 30049 usgr2wspthon 30053 rusgrnumwwlk 30063 rusgrnumwlkg 30065 clwlksndivn 30173 clwlknon2num 30455 numclwlk1lem2 30457 isubgr3stgr 48335 usgrexmpl12ngrlic 48399 gpg5ngric 48488 |
| Copyright terms: Public domain | W3C validator |