Theorem uhgrvtxedgiedgb 29577

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.)

Hypotheses

Ref	Expression
uhgrvtxedgiedgb.i	⊢ 𝐼 = (iEdg‘𝐺)
uhgrvtxedgiedgb.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
uhgrvtxedgiedgb	⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖) ↔ ∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒))

Distinct variable groups:   𝑒,𝐸   𝑒,𝐼,𝑖   𝑈,𝑒,𝑖

Allowed substitution hints:   𝐸(𝑖)   𝐺(𝑒, 𝑖)   𝑉(𝑒, 𝑖)

Proof of Theorem uhgrvtxedgiedgb

Step	Hyp	Ref	Expression
1		edgval 29490	. . . . . . 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 5925	. . . . . 6 ⊢ ran 𝐼 = ran (iEdg‘𝐺)
6	2, 3, 5	3eqtr4g 2822	. . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐸 = ran 𝐼)
7	6	rexeqdv 3322	. . . 4 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒))
8	4	uhgrfun 29507	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼)
9	8	funfnd 6568	. . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐼 Fn dom 𝐼)
10		eleq2 2851	. . . . . 6 ⊢ (𝑒 = (𝐼‘𝑖) → (𝑈 ∈ 𝑒 ↔ 𝑈 ∈ (𝐼‘𝑖)))
11	10	rexrn 7083	. . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖)))
12	9, 11	syl 18	. . . 4 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖)))
13	7, 12	bitrd 282	. . 3 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖)))
14	13	adantr 486	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖)))
15	14	bicomd 226	1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖) ↔ ∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3088  dom cdm 5659  ran crn 5660   Fn wfn 6532  ‘cfv 6537  iEdgciedg 29438  Edgcedg 29488  UHGraphcuhgr 29497

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-edg 29489  df-uhgr 29499

This theorem is used by:  vtxduhgr0edgnel  29938