![]() |
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 28918 | . . . . . . 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 5938 | . . . . . 6 ⊢ ran 𝐼 = ran (iEdg‘𝐺) |
6 | 2, 3, 5 | 3eqtr4g 2790 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐸 = ran 𝐼) |
7 | 6 | rexeqdv 3316 | . . . 4 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒)) |
8 | 4 | uhgrfun 28935 | . . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼) |
9 | 8 | funfnd 6583 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐼 Fn dom 𝐼) |
10 | eleq2 2814 | . . . . . 6 ⊢ (𝑒 = (𝐼‘𝑖) → (𝑈 ∈ 𝑒 ↔ 𝑈 ∈ (𝐼‘𝑖))) | |
11 | 10 | rexrn 7094 | . . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖))) |
12 | 9, 11 | syl 17 | . . . 4 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖))) |
13 | 7, 12 | bitrd 278 | . . 3 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖))) |
14 | 13 | adantr 479 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖))) |
15 | 14 | bicomd 222 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖) ↔ ∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∃wrex 3060 dom cdm 5677 ran crn 5678 Fn wfn 6542 ‘cfv 6547 iEdgciedg 28866 Edgcedg 28916 UHGraphcuhgr 28925 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5299 ax-nul 5306 ax-pr 5428 ax-un 7739 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-ral 3052 df-rex 3061 df-rab 3420 df-v 3465 df-sbc 3775 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-fv 6555 df-edg 28917 df-uhgr 28927 |
This theorem is referenced by: vtxduhgr0edgnel 29364 |
Copyright terms: Public domain | W3C validator |