Theorem graop 29436

Description: Any representation of a graph 𝐺 (especially as extensible structure 𝐺 = {⟨(Base‘ndx), 𝑉⟩, ⟨(.ef‘ndx), 𝐸⟩}) is convertible in a representation of the graph as ordered pair. (Contributed by AV, 7-Oct-2020.)

Hypothesis

Ref	Expression
graop.h	⊢ 𝐻 = ⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩

Assertion

Ref	Expression
graop	⊢ ((Vtx‘𝐺) = (Vtx‘𝐻) ∧ (iEdg‘𝐺) = (iEdg‘𝐻))

Proof of Theorem graop

Step	Hyp	Ref	Expression
1		graop.h	. . . 4 ⊢ 𝐻 = ⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩
2	1	fveq2i 6888	. . 3 ⊢ (Vtx‘𝐻) = (Vtx‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩)
3		fvex 6898	. . . 4 ⊢ (Vtx‘𝐺) ∈ V
4		fvex 6898	. . . 4 ⊢ (iEdg‘𝐺) ∈ V
5	3, 4	opvtxfvi 29416	. . 3 ⊢ (Vtx‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (Vtx‘𝐺)
6	2, 5	eqtr2i 2789	. 2 ⊢ (Vtx‘𝐺) = (Vtx‘𝐻)
7	1	fveq2i 6888	. . 3 ⊢ (iEdg‘𝐻) = (iEdg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩)
8	3, 4	opiedgfvi 29417	. . 3 ⊢ (iEdg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (iEdg‘𝐺)
9	7, 8	eqtr2i 2789	. 2 ⊢ (iEdg‘𝐺) = (iEdg‘𝐻)
10	6, 9	pm3.2i 476	1 ⊢ ((Vtx‘𝐺) = (Vtx‘𝐻) ∧ (iEdg‘𝐺) = (iEdg‘𝐻))

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ⟨cop 4597  ‘cfv 6540  Vtxcvtx 29403  iEdgciedg 29404

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fv 6548  df-1st 7992  df-2nd 7993  df-vtx 29405  df-iedg 29406

This theorem is used by: (None)