![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > uspgrupgrushgr | Structured version Visualization version GIF version |
Description: A graph is a simple pseudograph iff it is a pseudograph and a simple hypergraph. (Contributed by AV, 30-Nov-2020.) |
Ref | Expression |
---|---|
uspgrupgrushgr | ⊢ (𝐺 ∈ USPGraph ↔ (𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uspgrupgr 26969 | . . 3 ⊢ (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph) | |
2 | uspgrushgr 26968 | . . 3 ⊢ (𝐺 ∈ USPGraph → 𝐺 ∈ USHGraph) | |
3 | 1, 2 | jca 515 | . 2 ⊢ (𝐺 ∈ USPGraph → (𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph)) |
4 | eqid 2798 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
5 | eqid 2798 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
6 | 4, 5 | ushgrf 26856 | . . . 4 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅})) |
7 | edgval 26842 | . . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
8 | upgredgss 26925 | . . . . 5 ⊢ (𝐺 ∈ UPGraph → (Edg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) | |
9 | 7, 8 | eqsstrrid 3964 | . . . 4 ⊢ (𝐺 ∈ UPGraph → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
10 | f1ssr 6556 | . . . 4 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) | |
11 | 6, 9, 10 | syl2anr 599 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) |
12 | 4, 5 | isuspgr 26945 | . . . 4 ⊢ (𝐺 ∈ UPGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
13 | 12 | adantr 484 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph) → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})) |
14 | 11, 13 | mpbird 260 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph) → 𝐺 ∈ USPGraph) |
15 | 3, 14 | impbii 212 | 1 ⊢ (𝐺 ∈ USPGraph ↔ (𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∈ wcel 2111 {crab 3110 ∖ cdif 3878 ⊆ wss 3881 ∅c0 4243 𝒫 cpw 4497 {csn 4525 class class class wbr 5030 dom cdm 5519 ran crn 5520 –1-1→wf1 6321 ‘cfv 6324 ≤ cle 10665 2c2 11680 ♯chash 13686 Vtxcvtx 26789 iEdgciedg 26790 Edgcedg 26840 USHGraphcushgr 26850 UPGraphcupgr 26873 USPGraphcuspgr 26941 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fv 6332 df-edg 26841 df-ushgr 26852 df-upgr 26875 df-uspgr 26943 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |