Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ushggricedg Structured version   Visualization version   GIF version

Theorem ushggricedg 47834
Description: A simple hypergraph (with arbitrarily indexed edges) is isomorphic to a graph with the same vertices and the same edges, indexed by the edges themselves. (Contributed by AV, 11-Nov-2022.)
Hypotheses
Ref Expression
ushggricedg.v 𝑉 = (Vtx‘𝐺)
ushggricedg.e 𝐸 = (Edg‘𝐺)
ushggricedg.s 𝐻 = ⟨𝑉, ( I ↾ 𝐸)⟩
Assertion
Ref Expression
ushggricedg (𝐺 ∈ USHGraph → 𝐺𝑔𝑟 𝐻)

Proof of Theorem ushggricedg
Dummy variables 𝑓 𝑔 𝑖 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ushggricedg.v . . . . . 6 𝑉 = (Vtx‘𝐺)
21fvexi 6921 . . . . 5 𝑉 ∈ V
32a1i 11 . . . 4 (𝐺 ∈ USHGraph → 𝑉 ∈ V)
43resiexd 7236 . . 3 (𝐺 ∈ USHGraph → ( I ↾ 𝑉) ∈ V)
5 f1oi 6887 . . . . . 6 ( I ↾ 𝑉):𝑉1-1-onto𝑉
65a1i 11 . . . . 5 (𝐺 ∈ USHGraph → ( I ↾ 𝑉):𝑉1-1-onto𝑉)
7 ushggricedg.s . . . . . . . 8 𝐻 = ⟨𝑉, ( I ↾ 𝐸)⟩
87fveq2i 6910 . . . . . . 7 (Vtx‘𝐻) = (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩)
9 ushggricedg.e . . . . . . . . . . 11 𝐸 = (Edg‘𝐺)
109fvexi 6921 . . . . . . . . . 10 𝐸 ∈ V
11 resiexg 7935 . . . . . . . . . 10 (𝐸 ∈ V → ( I ↾ 𝐸) ∈ V)
1210, 11ax-mp 5 . . . . . . . . 9 ( I ↾ 𝐸) ∈ V
132, 12pm3.2i 470 . . . . . . . 8 (𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V)
14 opvtxfv 29036 . . . . . . . 8 ((𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V) → (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝑉)
1513, 14mp1i 13 . . . . . . 7 (𝐺 ∈ USHGraph → (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝑉)
168, 15eqtrid 2787 . . . . . 6 (𝐺 ∈ USHGraph → (Vtx‘𝐻) = 𝑉)
1716f1oeq3d 6846 . . . . 5 (𝐺 ∈ USHGraph → (( I ↾ 𝑉):𝑉1-1-onto→(Vtx‘𝐻) ↔ ( I ↾ 𝑉):𝑉1-1-onto𝑉))
186, 17mpbird 257 . . . 4 (𝐺 ∈ USHGraph → ( I ↾ 𝑉):𝑉1-1-onto→(Vtx‘𝐻))
19 fvexd 6922 . . . . 5 (𝐺 ∈ USHGraph → (iEdg‘𝐺) ∈ V)
20 eqid 2735 . . . . . . . . 9 (iEdg‘𝐺) = (iEdg‘𝐺)
211, 20ushgrf 29095 . . . . . . . 8 (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}))
22 f1f1orn 6860 . . . . . . . 8 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺))
2321, 22syl 17 . . . . . . 7 (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺))
247fveq2i 6910 . . . . . . . . . . 11 (iEdg‘𝐻) = (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)
2510a1i 11 . . . . . . . . . . . . 13 (𝐺 ∈ USHGraph → 𝐸 ∈ V)
2625resiexd 7236 . . . . . . . . . . . 12 (𝐺 ∈ USHGraph → ( I ↾ 𝐸) ∈ V)
27 opiedgfv 29039 . . . . . . . . . . . 12 ((𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V) → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
282, 26, 27sylancr 587 . . . . . . . . . . 11 (𝐺 ∈ USHGraph → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
2924, 28eqtrid 2787 . . . . . . . . . 10 (𝐺 ∈ USHGraph → (iEdg‘𝐻) = ( I ↾ 𝐸))
3029dmeqd 5919 . . . . . . . . 9 (𝐺 ∈ USHGraph → dom (iEdg‘𝐻) = dom ( I ↾ 𝐸))
31 dmresi 6072 . . . . . . . . . 10 dom ( I ↾ 𝐸) = 𝐸
329a1i 11 . . . . . . . . . . 11 (𝐺 ∈ USHGraph → 𝐸 = (Edg‘𝐺))
33 edgval 29081 . . . . . . . . . . 11 (Edg‘𝐺) = ran (iEdg‘𝐺)
3432, 33eqtrdi 2791 . . . . . . . . . 10 (𝐺 ∈ USHGraph → 𝐸 = ran (iEdg‘𝐺))
3531, 34eqtrid 2787 . . . . . . . . 9 (𝐺 ∈ USHGraph → dom ( I ↾ 𝐸) = ran (iEdg‘𝐺))
3630, 35eqtrd 2775 . . . . . . . 8 (𝐺 ∈ USHGraph → dom (iEdg‘𝐻) = ran (iEdg‘𝐺))
3736f1oeq3d 6846 . . . . . . 7 (𝐺 ∈ USHGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺)))
3823, 37mpbird 257 . . . . . 6 (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻))
39 ushgruhgr 29101 . . . . . . . . . 10 (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph)
401, 20uhgrss 29096 . . . . . . . . . 10 ((𝐺 ∈ UHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ 𝑉)
4139, 40sylan 580 . . . . . . . . 9 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ 𝑉)
42 resiima 6096 . . . . . . . . 9 (((iEdg‘𝐺)‘𝑖) ⊆ 𝑉 → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
4341, 42syl 17 . . . . . . . 8 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
44 f1f 6805 . . . . . . . . . . . . 13 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
4521, 44syl 17 . . . . . . . . . . . 12 (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
4645ffund 6741 . . . . . . . . . . 11 (𝐺 ∈ USHGraph → Fun (iEdg‘𝐺))
47 fvelrn 7096 . . . . . . . . . . 11 ((Fun (iEdg‘𝐺) ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ ran (iEdg‘𝐺))
4846, 47sylan 580 . . . . . . . . . 10 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ ran (iEdg‘𝐺))
499, 33eqtri 2763 . . . . . . . . . 10 𝐸 = ran (iEdg‘𝐺)
5048, 49eleqtrrdi 2850 . . . . . . . . 9 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ 𝐸)
51 fvresi 7193 . . . . . . . . 9 (((iEdg‘𝐺)‘𝑖) ∈ 𝐸 → (( I ↾ 𝐸)‘((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
5250, 51syl 17 . . . . . . . 8 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝐸)‘((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
5310a1i 11 . . . . . . . . . . . 12 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → 𝐸 ∈ V)
5453resiexd 7236 . . . . . . . . . . 11 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ( I ↾ 𝐸) ∈ V)
552, 54, 27sylancr 587 . . . . . . . . . 10 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
5624, 55eqtr2id 2788 . . . . . . . . 9 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ( I ↾ 𝐸) = (iEdg‘𝐻))
5756fveq1d 6909 . . . . . . . 8 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝐸)‘((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
5843, 52, 573eqtr2d 2781 . . . . . . 7 ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
5958ralrimiva 3144 . . . . . 6 (𝐺 ∈ USHGraph → ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
6038, 59jca 511 . . . . 5 (𝐺 ∈ USHGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
61 f1oeq1 6837 . . . . . 6 (𝑔 = (iEdg‘𝐺) → (𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻)))
62 fveq1 6906 . . . . . . . . 9 (𝑔 = (iEdg‘𝐺) → (𝑔𝑖) = ((iEdg‘𝐺)‘𝑖))
6362fveq2d 6911 . . . . . . . 8 (𝑔 = (iEdg‘𝐺) → ((iEdg‘𝐻)‘(𝑔𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
6463eqeq2d 2746 . . . . . . 7 (𝑔 = (iEdg‘𝐺) → ((( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)) ↔ (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
6564ralbidv 3176 . . . . . 6 (𝑔 = (iEdg‘𝐺) → (∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
6661, 65anbi12d 632 . . . . 5 (𝑔 = (iEdg‘𝐺) → ((𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))) ↔ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))))
6719, 60, 66spcedv 3598 . . . 4 (𝐺 ∈ USHGraph → ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))))
6818, 67jca 511 . . 3 (𝐺 ∈ USHGraph → (( I ↾ 𝑉):𝑉1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)))))
69 f1oeq1 6837 . . . 4 (𝑓 = ( I ↾ 𝑉) → (𝑓:𝑉1-1-onto→(Vtx‘𝐻) ↔ ( I ↾ 𝑉):𝑉1-1-onto→(Vtx‘𝐻)))
70 imaeq1 6075 . . . . . . . 8 (𝑓 = ( I ↾ 𝑉) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)))
7170eqeq1d 2737 . . . . . . 7 (𝑓 = ( I ↾ 𝑉) → ((𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)) ↔ (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))))
7271ralbidv 3176 . . . . . 6 (𝑓 = ( I ↾ 𝑉) → (∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))))
7372anbi2d 630 . . . . 5 (𝑓 = ( I ↾ 𝑉) → ((𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))) ↔ (𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)))))
7473exbidv 1919 . . . 4 (𝑓 = ( I ↾ 𝑉) → (∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))) ↔ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)))))
7569, 74anbi12d 632 . . 3 (𝑓 = ( I ↾ 𝑉) → ((𝑓:𝑉1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)))) ↔ (( I ↾ 𝑉):𝑉1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))))))
764, 68, 75spcedv 3598 . 2 (𝐺 ∈ USHGraph → ∃𝑓(𝑓:𝑉1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖)))))
77 opex 5475 . . . 4 𝑉, ( I ↾ 𝐸)⟩ ∈ V
787, 77eqeltri 2835 . . 3 𝐻 ∈ V
79 eqid 2735 . . . 4 (Vtx‘𝐻) = (Vtx‘𝐻)
80 eqid 2735 . . . 4 (iEdg‘𝐻) = (iEdg‘𝐻)
811, 79, 20, 80dfgric2 47822 . . 3 ((𝐺 ∈ USHGraph ∧ 𝐻 ∈ V) → (𝐺𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))))))
8278, 81mpan2 691 . 2 (𝐺 ∈ USHGraph → (𝐺𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔𝑖))))))
8376, 82mpbird 257 1 (𝐺 ∈ USHGraph → 𝐺𝑔𝑟 𝐻)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wex 1776  wcel 2106  wral 3059  Vcvv 3478  cdif 3960  wss 3963  c0 4339  𝒫 cpw 4605  {csn 4631  cop 4637   class class class wbr 5148   I cid 5582  dom cdm 5689  ran crn 5690  cres 5691  cima 5692  Fun wfun 6557  wf 6559  1-1wf1 6560  1-1-ontowf1o 6562  cfv 6563  Vtxcvtx 29028  iEdgciedg 29029  Edgcedg 29079  UHGraphcuhgr 29088  USHGraphcushgr 29089  𝑔𝑟 cgric 47800
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-1o 8505  df-map 8867  df-vtx 29030  df-iedg 29031  df-edg 29080  df-uhgr 29090  df-ushgr 29091  df-grim 47802  df-gric 47805
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator