Theorem upgr0eopALT 29751

Description: Alternate proof of upgr0eop 29749, using the general theorem gropeld 29668 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 29749). (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 3458	. . . . . 6 ⊢ 𝑔 ∈ V
2	1	a1i 11	. . . . 5 ⊢ (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → 𝑔 ∈ V)
3		simpr 490	. . . . 5 ⊢ (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = ∅) → (iEdg‘𝑔) = ∅)
4	2, 3	upgr0e 29746	. . . 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 5267	. . 3 ⊢ ∅ ∈ V
9	8	a1i 11	. 2 ⊢ (𝑉 ∈ 𝑊 → ∅ ∈ V)
10	6, 7, 9	gropeld 29668	1 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∅c0 4281  ⟨cop 4840  ‘cfv 6566  Vtxcvtx 29631  iEdgciedg 29632  UPGraphcupgr 29715

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-i2m1 11307  ax-1ne0 11308  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-1st 8035  df-2nd 8036  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-2 12445  df-vtx 29633  df-iedg 29634  df-upgr 29717  df-umgr 29718

This theorem is used by: (None)