| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uhgrvtxedgiedgb | Structured version Visualization version GIF version | ||
| Description: In a hypergraph, a vertex is incident with an edge iff it is contained in an element of the range of the edge function. (Contributed by AV, 24-Dec-2020.) (Revised by AV, 6-Jul-2022.) |
| Ref | Expression |
|---|---|
| uhgrvtxedgiedgb.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| uhgrvtxedgiedgb.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| uhgrvtxedgiedgb | ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖) ↔ ∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | edgval 29027 | . . . . . . 7 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 2 | 1 | a1i 11 | . . . . . 6 ⊢ (𝐺 ∈ UHGraph → (Edg‘𝐺) = ran (iEdg‘𝐺)) |
| 3 | uhgrvtxedgiedgb.e | . . . . . 6 ⊢ 𝐸 = (Edg‘𝐺) | |
| 4 | uhgrvtxedgiedgb.i | . . . . . . 7 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 5 | 4 | rneqi 5876 | . . . . . 6 ⊢ ran 𝐼 = ran (iEdg‘𝐺) |
| 6 | 2, 3, 5 | 3eqtr4g 2791 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐸 = ran 𝐼) |
| 7 | 6 | rexeqdv 3293 | . . . 4 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒)) |
| 8 | 4 | uhgrfun 29044 | . . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼) |
| 9 | 8 | funfnd 6512 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐼 Fn dom 𝐼) |
| 10 | eleq2 2820 | . . . . . 6 ⊢ (𝑒 = (𝐼‘𝑖) → (𝑈 ∈ 𝑒 ↔ 𝑈 ∈ (𝐼‘𝑖))) | |
| 11 | 10 | rexrn 7020 | . . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖))) |
| 12 | 9, 11 | syl 17 | . . . 4 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖))) |
| 13 | 7, 12 | bitrd 279 | . . 3 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖))) |
| 14 | 13 | adantr 480 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖))) |
| 15 | 14 | bicomd 223 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖) ↔ ∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∃wrex 3056 dom cdm 5614 ran crn 5615 Fn wfn 6476 ‘cfv 6481 iEdgciedg 28975 Edgcedg 29025 UHGraphcuhgr 29034 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pr 5368 ax-un 7668 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3737 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-fv 6489 df-edg 29026 df-uhgr 29036 |
| This theorem is referenced by: vtxduhgr0edgnel 29473 |
| Copyright terms: Public domain | W3C validator |