MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  uhgrvtxedgiedgb Structured version   Visualization version   GIF version

Theorem uhgrvtxedgiedgb 26031
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.)
Hypotheses
Ref Expression
uhgrvtxedgiedgb.v 𝑉 = (Vtx‘𝐺)
uhgrvtxedgiedgb.i 𝐼 = (iEdg‘𝐺)
uhgrvtxedgiedgb.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
uhgrvtxedgiedgb ((𝐺 ∈ UHGraph ∧ 𝑈𝑉) → (∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼𝑖) ↔ ∃𝑒𝐸 𝑈𝑒))
Distinct variable groups:   𝑒,𝐸   𝑒,𝐼,𝑖   𝑈,𝑒,𝑖
Allowed substitution hints:   𝐸(𝑖)   𝐺(𝑒,𝑖)   𝑉(𝑒,𝑖)

Proof of Theorem uhgrvtxedgiedgb
StepHypRef Expression
1 edgval 25941 . . . . . . 7 (Edg‘𝐺) = ran (iEdg‘𝐺)
21a1i 11 . . . . . 6 (𝐺 ∈ UHGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
3 uhgrvtxedgiedgb.e . . . . . 6 𝐸 = (Edg‘𝐺)
4 uhgrvtxedgiedgb.i . . . . . . 7 𝐼 = (iEdg‘𝐺)
54rneqi 5352 . . . . . 6 ran 𝐼 = ran (iEdg‘𝐺)
62, 3, 53eqtr4g 2681 . . . . 5 (𝐺 ∈ UHGraph → 𝐸 = ran 𝐼)
76rexeqdv 3145 . . . 4 (𝐺 ∈ UHGraph → (∃𝑒𝐸 𝑈𝑒 ↔ ∃𝑒 ∈ ran 𝐼 𝑈𝑒))
84uhgrfun 25961 . . . . . 6 (𝐺 ∈ UHGraph → Fun 𝐼)
9 funfn 5918 . . . . . 6 (Fun 𝐼𝐼 Fn dom 𝐼)
108, 9sylib 208 . . . . 5 (𝐺 ∈ UHGraph → 𝐼 Fn dom 𝐼)
11 eleq2 2690 . . . . . 6 (𝑒 = (𝐼𝑖) → (𝑈𝑒𝑈 ∈ (𝐼𝑖)))
1211rexrn 6361 . . . . 5 (𝐼 Fn dom 𝐼 → (∃𝑒 ∈ ran 𝐼 𝑈𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼𝑖)))
1310, 12syl 17 . . . 4 (𝐺 ∈ UHGraph → (∃𝑒 ∈ ran 𝐼 𝑈𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼𝑖)))
147, 13bitrd 268 . . 3 (𝐺 ∈ UHGraph → (∃𝑒𝐸 𝑈𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼𝑖)))
1514adantr 481 . 2 ((𝐺 ∈ UHGraph ∧ 𝑈𝑉) → (∃𝑒𝐸 𝑈𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼𝑖)))
1615bicomd 213 1 ((𝐺 ∈ UHGraph ∧ 𝑈𝑉) → (∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼𝑖) ↔ ∃𝑒𝐸 𝑈𝑒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wrex 2913  dom cdm 5114  ran crn 5115  Fun wfun 5882   Fn wfn 5883  cfv 5888  Vtxcvtx 25874  iEdgciedg 25875  Edgcedg 25939   UHGraph cuhgr 25951
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-edg 25940  df-uhgr 25953
This theorem is referenced by:  vtxduhgr0edgnel  26390
  Copyright terms: Public domain W3C validator