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

Theorem incistruhgr 26019
 Description: An incidence structure ⟨𝑃, 𝐿, 𝐼⟩ "where 𝑃 is a set whose elements are called points, 𝐿 is a distinct set whose elements are called lines and 𝐼 ⊆ (𝑃 × 𝐿) is the incidence relation" (see Wikipedia "Incidence structure" (24-Oct-2020), https://en.wikipedia.org/wiki/Incidence_structure) implies an undirected hypergraph, if the incidence relation is right-total (to exclude empty edges). The points become the vertices, and the edge function is derived from the incidence relation by mapping each line ("edge") to the set of vertices incident to the line/edge. With 𝑃 = (Base‘𝑆) and by defining two new slots for lines and incidence relations (analogous to LineG and Itv) and enhancing the definition of iEdg accordingly, it would even be possible to express that a corresponding incidence structure is an undirected hypergraph. By choosing the incident relation appropriately, other kinds of undirected graphs (pseudographs, multigraphs, simple graphs, etc.) could be defined. (Contributed by AV, 24-Oct-2020.)
Hypotheses
Ref Expression
incistruhgr.v 𝑉 = (Vtx‘𝐺)
incistruhgr.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
incistruhgr ((𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿) → ((𝑉 = 𝑃𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒})) → 𝐺 ∈ UHGraph))
Distinct variable groups:   𝑒,𝐸   𝑒,𝐺   𝑒,𝐼,𝑣   𝑒,𝐿,𝑣   𝑃,𝑒,𝑣   𝑒,𝑉,𝑣   𝑒,𝑊
Allowed substitution hints:   𝐸(𝑣)   𝐺(𝑣)   𝑊(𝑣)

Proof of Theorem incistruhgr
StepHypRef Expression
1 id 22 . . . . . . . . . 10 (𝑉 = 𝑃𝑉 = 𝑃)
21rabeqdv 3225 . . . . . . . . 9 (𝑉 = 𝑃 → {𝑣𝑉𝑣𝐼𝑒} = {𝑣𝑃𝑣𝐼𝑒})
32mpteq2dv 4778 . . . . . . . 8 (𝑉 = 𝑃 → (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒}))
43eqeq2d 2661 . . . . . . 7 (𝑉 = 𝑃 → (𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) ↔ 𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒})))
5 xpeq1 5157 . . . . . . . . 9 (𝑉 = 𝑃 → (𝑉 × 𝐿) = (𝑃 × 𝐿))
65sseq2d 3666 . . . . . . . 8 (𝑉 = 𝑃 → (𝐼 ⊆ (𝑉 × 𝐿) ↔ 𝐼 ⊆ (𝑃 × 𝐿)))
763anbi2d 1444 . . . . . . 7 (𝑉 = 𝑃 → ((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) ↔ (𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿)))
84, 7anbi12d 747 . . . . . 6 (𝑉 = 𝑃 → ((𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) ∧ (𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿)) ↔ (𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒}) ∧ (𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿))))
9 dmeq 5356 . . . . . . . . 9 (𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) → dom 𝐸 = dom (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}))
10 incistruhgr.v . . . . . . . . . . . . 13 𝑉 = (Vtx‘𝐺)
11 fvex 6239 . . . . . . . . . . . . 13 (Vtx‘𝐺) ∈ V
1210, 11eqeltri 2726 . . . . . . . . . . . 12 𝑉 ∈ V
1312rabex 4845 . . . . . . . . . . 11 {𝑣𝑉𝑣𝐼𝑒} ∈ V
14 eqid 2651 . . . . . . . . . . 11 (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒})
1513, 14dmmpti 6061 . . . . . . . . . 10 dom (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) = 𝐿
1615a1i 11 . . . . . . . . 9 (𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) → dom (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) = 𝐿)
179, 16eqtrd 2685 . . . . . . . 8 (𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) → dom 𝐸 = 𝐿)
18 ssrab2 3720 . . . . . . . . . . . . 13 {𝑣𝑉𝑣𝐼𝑒} ⊆ 𝑉
1918a1i 11 . . . . . . . . . . . 12 (((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ 𝑒𝐿) → {𝑣𝑉𝑣𝐼𝑒} ⊆ 𝑉)
2013elpw 4197 . . . . . . . . . . . 12 ({𝑣𝑉𝑣𝐼𝑒} ∈ 𝒫 𝑉 ↔ {𝑣𝑉𝑣𝐼𝑒} ⊆ 𝑉)
2119, 20sylibr 224 . . . . . . . . . . 11 (((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ 𝑒𝐿) → {𝑣𝑉𝑣𝐼𝑒} ∈ 𝒫 𝑉)
22 eleq2 2719 . . . . . . . . . . . . . . . 16 (ran 𝐼 = 𝐿 → (𝑒 ∈ ran 𝐼𝑒𝐿))
23223ad2ant3 1104 . . . . . . . . . . . . . . 15 ((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) → (𝑒 ∈ ran 𝐼𝑒𝐿))
24 ssrelrn 5347 . . . . . . . . . . . . . . . . 17 ((𝐼 ⊆ (𝑉 × 𝐿) ∧ 𝑒 ∈ ran 𝐼) → ∃𝑣𝑉 𝑣𝐼𝑒)
2524ex 449 . . . . . . . . . . . . . . . 16 (𝐼 ⊆ (𝑉 × 𝐿) → (𝑒 ∈ ran 𝐼 → ∃𝑣𝑉 𝑣𝐼𝑒))
26253ad2ant2 1103 . . . . . . . . . . . . . . 15 ((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) → (𝑒 ∈ ran 𝐼 → ∃𝑣𝑉 𝑣𝐼𝑒))
2723, 26sylbird 250 . . . . . . . . . . . . . 14 ((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) → (𝑒𝐿 → ∃𝑣𝑉 𝑣𝐼𝑒))
2827imp 444 . . . . . . . . . . . . 13 (((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ 𝑒𝐿) → ∃𝑣𝑉 𝑣𝐼𝑒)
29 df-ne 2824 . . . . . . . . . . . . . 14 ({𝑣𝑉𝑣𝐼𝑒} ≠ ∅ ↔ ¬ {𝑣𝑉𝑣𝐼𝑒} = ∅)
30 rabn0 3991 . . . . . . . . . . . . . 14 ({𝑣𝑉𝑣𝐼𝑒} ≠ ∅ ↔ ∃𝑣𝑉 𝑣𝐼𝑒)
3129, 30bitr3i 266 . . . . . . . . . . . . 13 (¬ {𝑣𝑉𝑣𝐼𝑒} = ∅ ↔ ∃𝑣𝑉 𝑣𝐼𝑒)
3228, 31sylibr 224 . . . . . . . . . . . 12 (((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ 𝑒𝐿) → ¬ {𝑣𝑉𝑣𝐼𝑒} = ∅)
3313elsn 4225 . . . . . . . . . . . 12 ({𝑣𝑉𝑣𝐼𝑒} ∈ {∅} ↔ {𝑣𝑉𝑣𝐼𝑒} = ∅)
3432, 33sylnibr 318 . . . . . . . . . . 11 (((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ 𝑒𝐿) → ¬ {𝑣𝑉𝑣𝐼𝑒} ∈ {∅})
3521, 34eldifd 3618 . . . . . . . . . 10 (((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ 𝑒𝐿) → {𝑣𝑉𝑣𝐼𝑒} ∈ (𝒫 𝑉 ∖ {∅}))
3635, 14fmptd 6425 . . . . . . . . 9 ((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) → (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}):𝐿⟶(𝒫 𝑉 ∖ {∅}))
37 simpl 472 . . . . . . . . . 10 ((𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) ∧ dom 𝐸 = 𝐿) → 𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}))
38 simpr 476 . . . . . . . . . 10 ((𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) ∧ dom 𝐸 = 𝐿) → dom 𝐸 = 𝐿)
3937, 38feq12d 6071 . . . . . . . . 9 ((𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) ∧ dom 𝐸 = 𝐿) → (𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}) ↔ (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}):𝐿⟶(𝒫 𝑉 ∖ {∅})))
4036, 39syl5ibr 236 . . . . . . . 8 ((𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) ∧ dom 𝐸 = 𝐿) → ((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
4117, 40mpdan 703 . . . . . . 7 (𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) → ((𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿) → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
4241imp 444 . . . . . 6 ((𝐸 = (𝑒𝐿 ↦ {𝑣𝑉𝑣𝐼𝑒}) ∧ (𝐺𝑊𝐼 ⊆ (𝑉 × 𝐿) ∧ ran 𝐼 = 𝐿)) → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))
438, 42syl6bir 244 . . . . 5 (𝑉 = 𝑃 → ((𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒}) ∧ (𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿)) → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
4443expdimp 452 . . . 4 ((𝑉 = 𝑃𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒})) → ((𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿) → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
4544impcom 445 . . 3 (((𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ (𝑉 = 𝑃𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒}))) → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))
46 incistruhgr.e . . . . . 6 𝐸 = (iEdg‘𝐺)
4710, 46isuhgr 26000 . . . . 5 (𝐺𝑊 → (𝐺 ∈ UHGraph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
48473ad2ant1 1102 . . . 4 ((𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿) → (𝐺 ∈ UHGraph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
4948adantr 480 . . 3 (((𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ (𝑉 = 𝑃𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒}))) → (𝐺 ∈ UHGraph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
5045, 49mpbird 247 . 2 (((𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿) ∧ (𝑉 = 𝑃𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒}))) → 𝐺 ∈ UHGraph)
5150ex 449 1 ((𝐺𝑊𝐼 ⊆ (𝑃 × 𝐿) ∧ ran 𝐼 = 𝐿) → ((𝑉 = 𝑃𝐸 = (𝑒𝐿 ↦ {𝑣𝑃𝑣𝐼𝑒})) → 𝐺 ∈ UHGraph))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 383   ∧ w3a 1054   = wceq 1523   ∈ wcel 2030   ≠ wne 2823  ∃wrex 2942  {crab 2945  Vcvv 3231   ∖ cdif 3604   ⊆ wss 3607  ∅c0 3948  𝒫 cpw 4191  {csn 4210   class class class wbr 4685   ↦ cmpt 4762   × cxp 5141  dom cdm 5143  ran crn 5144  ⟶wf 5922  ‘cfv 5926  Vtxcvtx 25919  iEdgciedg 25920  UHGraphcuhgr 25996 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-fv 5934  df-uhgr 25998 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator