| 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 29118 | . . . . . . 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 5892 | . . . . . 6 ⊢ ran 𝐼 = ran (iEdg‘𝐺) |
| 6 | 2, 3, 5 | 3eqtr4g 2796 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐸 = ran 𝐼) |
| 7 | 6 | rexeqdv 3296 | . . . 4 ⊢ (𝐺 ∈ UHGraph → (∃𝑒 ∈ 𝐸 𝑈 ∈ 𝑒 ↔ ∃𝑒 ∈ ran 𝐼 𝑈 ∈ 𝑒)) |
| 8 | 4 | uhgrfun 29135 | . . . . . 6 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼) |
| 9 | 8 | funfnd 6529 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → 𝐼 Fn dom 𝐼) |
| 10 | eleq2 2825 | . . . . . 6 ⊢ (𝑒 = (𝐼‘𝑖) → (𝑈 ∈ 𝑒 ↔ 𝑈 ∈ (𝐼‘𝑖))) | |
| 11 | 10 | rexrn 7039 | . . . . 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 1542 ∈ wcel 2114 ∃wrex 3061 dom cdm 5631 ran crn 5632 Fn wfn 6493 ‘cfv 6498 iEdgciedg 29066 Edgcedg 29116 UHGraphcuhgr 29125 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fv 6506 df-edg 29117 df-uhgr 29127 |
| This theorem is referenced by: vtxduhgr0edgnel 29563 |
| Copyright terms: Public domain | W3C validator |