| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isuhgrop | Structured version Visualization version GIF version | ||
| Description: The property of being an undirected hypergraph represented as an ordered pair. The representation as an ordered pair is the usual representation of a graph, see section I.1 of [Bollobas] p. 1. (Contributed by AV, 1-Jan-2020.) (Revised by AV, 9-Oct-2020.) |
| Ref | Expression |
|---|---|
| isuhgrop | ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (〈𝑉, 𝐸〉 ∈ UHGraph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opex 5432 | . . 3 ⊢ 〈𝑉, 𝐸〉 ∈ V | |
| 2 | eqid 2761 | . . . 4 ⊢ (Vtx‘〈𝑉, 𝐸〉) = (Vtx‘〈𝑉, 𝐸〉) | |
| 3 | eqid 2761 | . . . 4 ⊢ (iEdg‘〈𝑉, 𝐸〉) = (iEdg‘〈𝑉, 𝐸〉) | |
| 4 | 2, 3 | isuhgr 29620 | . . 3 ⊢ (〈𝑉, 𝐸〉 ∈ V → (〈𝑉, 𝐸〉 ∈ UHGraph ↔ (iEdg‘〈𝑉, 𝐸〉):dom (iEdg‘〈𝑉, 𝐸〉)⟶(𝒫 (Vtx‘〈𝑉, 𝐸〉) ∖ {∅}))) |
| 5 | 1, 4 | mp1i 14 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (〈𝑉, 𝐸〉 ∈ UHGraph ↔ (iEdg‘〈𝑉, 𝐸〉):dom (iEdg‘〈𝑉, 𝐸〉)⟶(𝒫 (Vtx‘〈𝑉, 𝐸〉) ∖ {∅}))) |
| 6 | opiedgfv 29567 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) | |
| 7 | 6 | dmeqd 5887 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → dom (iEdg‘〈𝑉, 𝐸〉) = dom 𝐸) |
| 8 | opvtxfv 29564 | . . . . 5 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) | |
| 9 | 8 | pweqd 4574 | . . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → 𝒫 (Vtx‘〈𝑉, 𝐸〉) = 𝒫 𝑉) |
| 10 | 9 | difeq1d 4073 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (𝒫 (Vtx‘〈𝑉, 𝐸〉) ∖ {∅}) = (𝒫 𝑉 ∖ {∅})) |
| 11 | 6, 7, 10 | feq123d 6690 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → ((iEdg‘〈𝑉, 𝐸〉):dom (iEdg‘〈𝑉, 𝐸〉)⟶(𝒫 (Vtx‘〈𝑉, 𝐸〉) ∖ {∅}) ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))) |
| 12 | 5, 11 | bitrd 282 | 1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (〈𝑉, 𝐸〉 ∈ UHGraph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2145 Vcvv 3451 ∖ cdif 3896 ∅c0 4279 𝒫 cpw 4557 {csn 4584 〈cop 4590 dom cdm 5651 ⟶wf 6527 ‘cfv 6531 Vtxcvtx 29556 iEdgciedg 29557 UHGraphcuhgr 29616 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-1st 7990 df-2nd 7991 df-vtx 29558 df-iedg 29559 df-uhgr 29618 |
| This theorem is used by: pliguhgr 31070 |
| Copyright terms: Public domain | W3C validator |