ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isuhgropm GIF version

Theorem isuhgropm 15961
Description: The property of being an undirected hypergraph represented as an ordered pair. The representation as an ordered pair is the usual representation of a graph, see section I.1 of [Bollobas] p. 1. (Contributed by AV, 1-Jan-2020.) (Revised by AV, 9-Oct-2020.)
Assertion
Ref Expression
isuhgropm ((𝑉𝑊𝐸𝑋) → (⟨𝑉, 𝐸⟩ ∈ UHGraph ↔ 𝐸:dom 𝐸⟶{𝑠 ∈ 𝒫 𝑉 ∣ ∃𝑗 𝑗𝑠}))
Distinct variable groups:   𝐸,𝑠   𝑉,𝑠   𝑗,𝑠
Allowed substitution hints:   𝐸(𝑗)   𝑉(𝑗)   𝑊(𝑗,𝑠)   𝑋(𝑗,𝑠)

Proof of Theorem isuhgropm
StepHypRef Expression
1 opexg 4322 . . 3 ((𝑉𝑊𝐸𝑋) → ⟨𝑉, 𝐸⟩ ∈ V)
2 eqid 2230 . . . 4 (Vtx‘⟨𝑉, 𝐸⟩) = (Vtx‘⟨𝑉, 𝐸⟩)
3 eqid 2230 . . . 4 (iEdg‘⟨𝑉, 𝐸⟩) = (iEdg‘⟨𝑉, 𝐸⟩)
42, 3isuhgrm 15951 . . 3 (⟨𝑉, 𝐸⟩ ∈ V → (⟨𝑉, 𝐸⟩ ∈ UHGraph ↔ (iEdg‘⟨𝑉, 𝐸⟩):dom (iEdg‘⟨𝑉, 𝐸⟩)⟶{𝑠 ∈ 𝒫 (Vtx‘⟨𝑉, 𝐸⟩) ∣ ∃𝑗 𝑗𝑠}))
51, 4syl 14 . 2 ((𝑉𝑊𝐸𝑋) → (⟨𝑉, 𝐸⟩ ∈ UHGraph ↔ (iEdg‘⟨𝑉, 𝐸⟩):dom (iEdg‘⟨𝑉, 𝐸⟩)⟶{𝑠 ∈ 𝒫 (Vtx‘⟨𝑉, 𝐸⟩) ∣ ∃𝑗 𝑗𝑠}))
6 opiedgfv 15905 . . 3 ((𝑉𝑊𝐸𝑋) → (iEdg‘⟨𝑉, 𝐸⟩) = 𝐸)
76dmeqd 4935 . . 3 ((𝑉𝑊𝐸𝑋) → dom (iEdg‘⟨𝑉, 𝐸⟩) = dom 𝐸)
8 opvtxfv 15902 . . . . 5 ((𝑉𝑊𝐸𝑋) → (Vtx‘⟨𝑉, 𝐸⟩) = 𝑉)
98pweqd 3658 . . . 4 ((𝑉𝑊𝐸𝑋) → 𝒫 (Vtx‘⟨𝑉, 𝐸⟩) = 𝒫 𝑉)
109rabeqdv 2795 . . 3 ((𝑉𝑊𝐸𝑋) → {𝑠 ∈ 𝒫 (Vtx‘⟨𝑉, 𝐸⟩) ∣ ∃𝑗 𝑗𝑠} = {𝑠 ∈ 𝒫 𝑉 ∣ ∃𝑗 𝑗𝑠})
116, 7, 10feq123d 5475 . 2 ((𝑉𝑊𝐸𝑋) → ((iEdg‘⟨𝑉, 𝐸⟩):dom (iEdg‘⟨𝑉, 𝐸⟩)⟶{𝑠 ∈ 𝒫 (Vtx‘⟨𝑉, 𝐸⟩) ∣ ∃𝑗 𝑗𝑠} ↔ 𝐸:dom 𝐸⟶{𝑠 ∈ 𝒫 𝑉 ∣ ∃𝑗 𝑗𝑠}))
125, 11bitrd 188 1 ((𝑉𝑊𝐸𝑋) → (⟨𝑉, 𝐸⟩ ∈ UHGraph ↔ 𝐸:dom 𝐸⟶{𝑠 ∈ 𝒫 𝑉 ∣ ∃𝑗 𝑗𝑠}))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wex 1540  wcel 2201  {crab 2513  Vcvv 2801  𝒫 cpw 3653  cop 3673  dom cdm 4727  wf 5324  cfv 5328  Vtxcvtx 15892  iEdgciedg 15893  UHGraphcuhgr 15947
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-mulcom 8138  ax-addass 8139  ax-mulass 8140  ax-distr 8141  ax-i2m1 8142  ax-1rid 8144  ax-0id 8145  ax-rnegex 8146  ax-cnre 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-if 3605  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-fo 5334  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1st 6308  df-2nd 6309  df-sub 8357  df-inn 9149  df-2 9207  df-3 9208  df-4 9209  df-5 9210  df-6 9211  df-7 9212  df-8 9213  df-9 9214  df-n0 9408  df-dec 9617  df-ndx 13108  df-slot 13109  df-base 13111  df-edgf 15885  df-vtx 15894  df-iedg 15895  df-uhgrm 15949
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator