Theorem uhgrvtxedgiedgb 29495

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 29408	. . . . . . 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 5927	. . . . . 6 ⊢ ran 𝐼 = ran (iEdg‘𝐺)
6	2, 3, 5	3eqtr4g 2823	. . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐸 = ran 𝐼)
7	6	rexeqdv 3324	. . . 4 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒))
8	4	uhgrfun 29425	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼)
9	8	funfnd 6567	. . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐼 Fn dom 𝐼)
10		eleq2 2852	. . . . . 6 ⊢ (𝑒 = (𝐼‘𝑖) → (𝑈 ∈ 𝑒 ↔ 𝑈 ∈ (𝐼‘𝑖)))
11	10	rexrn 7082	. . . . 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 485	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖)))
15	14	bicomd 226	1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑈 ∈ 𝑉) → (∃𝑖 ∈ dom 𝐼 𝑈 ∈ (𝐼‘𝑖) ↔ ∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∃wrex 3089  dom cdm 5661  ran crn 5662   Fn wfn 6531  ‘cfv 6536  iEdgciedg 29356  Edgcedg 29406  UHGraphcuhgr 29415

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-edg 29407  df-uhgr 29417

This theorem is used by:  vtxduhgr0edgnel  29853