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

Theorem grlicref 49054
Description: Graph local isomorphism is reflexive for hypergraphs. (Contributed by AV, 9-Jun-2025.)
Assertion
Ref Expression
grlicref (𝐺 ∈ UHGraph → 𝐺 ≃𝑙𝑔𝑟 𝐺)

Proof of Theorem grlicref
Dummy variables 𝑓 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvexd 6892 . . . 4 (𝐺 ∈ UHGraph → (Vtx‘𝐺) ∈ V)
21resiexd 7214 . . 3 (𝐺 ∈ UHGraph → ( I ↾ (Vtx‘𝐺)) ∈ V)
3 eqid 2761 . . . . . . . . 9 (Vtx‘𝐺) = (Vtx‘𝐺)
43clnbgrssvtx 48873 . . . . . . . 8 (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)
54a1i 11 . . . . . . 7 (𝑣 ∈ (Vtx‘𝐺) → (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺))
63isubgruhgr 48910 . . . . . . 7 ((𝐺 ∈ UHGraph ∧ (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ∈ UHGraph)
75, 6sylan2 605 . . . . . 6 ((𝐺 ∈ UHGraph ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ∈ UHGraph)
8 gricref 48962 . . . . . 6 ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ∈ UHGraph → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)))
97, 8syl 18 . . . . 5 ((𝐺 ∈ UHGraph ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)))
109ralrimiva 3155 . . . 4 (𝐺 ∈ UHGraph → ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)))
11 f1oi 6855 . . . 4 ( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺)
1210, 11jctil 529 . . 3 (𝐺 ∈ UHGraph → (( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣))))
13 f1oeq1 6804 . . . 4 (𝑓 = ( I ↾ (Vtx‘𝐺)) → (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ↔ ( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺)))
14 fveq1 6876 . . . . . . . . 9 (𝑓 = ( I ↾ (Vtx‘𝐺)) → (𝑓‘𝑣) = (( I ↾ (Vtx‘𝐺))‘𝑣))
1514oveq2d 7428 . . . . . . . 8 (𝑓 = ( I ↾ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx (𝑓‘𝑣)) = (𝐺 ClNeighbVtx (( I ↾ (Vtx‘𝐺))‘𝑣)))
1615oveq2d 7428 . . . . . . 7 (𝑓 = ( I ↾ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx (𝑓‘𝑣))) = (𝐺 ISubGr (𝐺 ClNeighbVtx (( I ↾ (Vtx‘𝐺))‘𝑣))))
1716breq2d 5115 . . . . . 6 (𝑓 = ( I ↾ (Vtx‘𝐺)) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (𝑓‘𝑣))) ↔ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (( I ↾ (Vtx‘𝐺))‘𝑣)))))
18 fvresi 7170 . . . . . . . . 9 (𝑣 ∈ (Vtx‘𝐺) → (( I ↾ (Vtx‘𝐺))‘𝑣) = 𝑣)
1918oveq2d 7428 . . . . . . . 8 (𝑣 ∈ (Vtx‘𝐺) → (𝐺 ClNeighbVtx (( I ↾ (Vtx‘𝐺))‘𝑣)) = (𝐺 ClNeighbVtx 𝑣))
2019oveq2d 7428 . . . . . . 7 (𝑣 ∈ (Vtx‘𝐺) → (𝐺 ISubGr (𝐺 ClNeighbVtx (( I ↾ (Vtx‘𝐺))‘𝑣))) = (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)))
2120breq2d 5115 . . . . . 6 (𝑣 ∈ (Vtx‘𝐺) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (( I ↾ (Vtx‘𝐺))‘𝑣))) ↔ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣))))
2217, 21sylan9bb 519 . . . . 5 ((𝑓 = ( I ↾ (Vtx‘𝐺)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (𝑓‘𝑣))) ↔ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣))))
2322ralbidva 3184 . . . 4 (𝑓 = ( I ↾ (Vtx‘𝐺)) → (∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (𝑓‘𝑣))) ↔ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣))))
2413, 23anbi12d 644 . . 3 (𝑓 = ( I ↾ (Vtx‘𝐺)) → ((𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (𝑓‘𝑣)))) ↔ (( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)))))
252, 12, 24spcedv 3553 . 2 (𝐺 ∈ UHGraph → ∃𝑓(𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (𝑓‘𝑣)))))
263, 3dfgrlic2 49050 . . 3 ((𝐺 ∈ UHGraph ∧ 𝐺 ∈ UHGraph) → (𝐺 ≃𝑙𝑔𝑟 𝐺 ↔ ∃𝑓(𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (𝑓‘𝑣))))))
2726anidms 577 . 2 (𝐺 ∈ UHGraph → (𝐺 ≃𝑙𝑔𝑟 𝐺 ↔ ∃𝑓(𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐺 ISubGr (𝐺 ClNeighbVtx (𝑓‘𝑣))))))
2825, 27mpbird 260 1 (𝐺 ∈ UHGraph → 𝐺 ≃𝑙𝑔𝑟 𝐺)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ⊆ wss 3899   class class class wbr 5103   I cid 5545   ↾ cres 5653  –1-1-onto→wf1o 6530  ‘cfv 6531  (class class class)co 7412  Vtxcvtx 29556  UHGraphcuhgr 29616   ClNeighbVtx cclnbgr 48860   ISubGr cisubgr 48902   ≃𝑔𝑟 cgric 48918   ≃𝑙𝑔𝑟 cgrlic 49019
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-1o 8460  df-map 8833  df-vtx 29558  df-iedg 29559  df-uhgr 29618  df-clnbgr 48861  df-isubgr 48903  df-grim 48920  df-gric 48923  df-grlim 49020  df-grlic 49023
This theorem is used by:  grlicer  49058
  Copyright terms: Public domain W3C validator