Theorem upgr0eopALT 29521

Description: Alternate proof of upgr0eop 29519, using the general theorem gropeld 29438 to transform a theorem for an arbitrary representation of a graph into a theorem for a graph represented as ordered pair. This general approach causes some overhead, which makes the proof longer than necessary (see proof of upgr0eop 29519). (Contributed by AV, 11-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
upgr0eopALT	⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)

Proof of Theorem upgr0eopALT

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3461	. . . . . 6 ⊢ 𝑔 ∈ V
2	1	a1i 11	. . . . 5 ⊢ (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ V)
3		simpr 490	. . . . 5 ⊢ (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → (iEdg‘𝑔) = ∅)
4	2, 3	upgr0e 29516	. . . 4 ⊢ (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)
5	4	ax-gen 1828	. . 3 ⊢ ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph)
6	5	a1i 11	. 2 ⊢ (𝑉 ∈ 𝑊 → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ UPGraph))
7		id 23	. 2 ⊢ (𝑉 ∈ 𝑊 → 𝑉 ∈ 𝑊)
8		0ex 5272	. . 3 ⊢ ∅ ∈ V
9	8	a1i 11	. 2 ⊢ (𝑉 ∈ 𝑊 → ∅ ∈ V)
10	6, 7, 9	gropeld 29438	1 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2146  Vcvv 3457  ∅c0 4286  ⟨cop 4597  ‘cfv 6540  Vtxcvtx 29401  iEdgciedg 29402  UPGraphcupgr 29485

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-pow 5338  ax-pr 5406  ax-un 7742  ax-resscn 11172  ax-1cn 11173  ax-icn 11174  ax-addcl 11175  ax-addrcl 11176  ax-mulcl 11177  ax-mulrcl 11178  ax-i2m1 11183  ax-1ne0 11184  ax-rrecex 11187  ax-cnre 11188  ax-pre-lttri 11189

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-nel 3067  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  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-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-1st 7992  df-2nd 7993  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-pnf 11260  df-mnf 11261  df-xr 11262  df-ltxr 11263  df-le 11264  df-2 12318  df-vtx 29403  df-iedg 29404  df-upgr 29487  df-umgr 29488

This theorem is used by: (None)