Theorem upgr1een 16365

Description: A graph with one non-loop edge is a pseudograph. Variation of upgr1edc 16362 for a different way of specifying a graph with one edge. (Contributed by Jim Kingdon, 18-Mar-2026.)

Hypotheses

Ref	Expression
upgr1een.k	⊢ (𝜑 → 𝐾 ∈ 𝑋)
upgr1een.v	⊢ (𝜑 → 𝑉 ∈ 𝑌)
upgr1een.e	⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑉)
upgr1een.2o	⊢ (𝜑 → 𝐸 ≈ 2o)

Assertion

Ref	Expression
upgr1een	⊢ (𝜑 → ⟨𝑉, {⟨𝐾, 𝐸⟩}⟩ ∈ UPGraph)

Proof of Theorem upgr1een

Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		upgr1een.2o	. . 3 ⊢ (𝜑 → 𝐸 ≈ 2o)
2		en2 7112	. . 3 ⊢ (𝐸 ≈ 2o → ∃𝑢∃𝑣 𝐸 = {𝑢, 𝑣})
3	1, 2	syl 14	. 2 ⊢ (𝜑 → ∃𝑢∃𝑣 𝐸 = {𝑢, 𝑣})
4		eqid 2238	. . . . 5 ⊢ (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩)
5		upgr1een.k	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ 𝑋)
6	5	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝐾 ∈ 𝑋)
7		upgr1een.e	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑉)
8	7	elpwid 3700	. . . . . . . 8 ⊢ (𝜑 → 𝐸 ⊆ 𝑉)
9	8	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝐸 ⊆ 𝑉)
10		vex 2824	. . . . . . . . 9 ⊢ 𝑢 ∈ V
11	10	prid1 3817	. . . . . . . 8 ⊢ 𝑢 ∈ {𝑢, 𝑣}
12		simpr 110	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝐸 = {𝑢, 𝑣})
13	11, 12	eleqtrrid 2328	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝑢 ∈ 𝐸)
14	9, 13	sseldd 3249	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝑢 ∈ 𝑉)
15		upgr1een.v	. . . . . . . 8 ⊢ (𝜑 → 𝑉 ∈ 𝑌)
16		opexg 4368	. . . . . . . . . 10 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝐸 ∈ 𝒫 𝑉) → ⟨𝐾, 𝐸⟩ ∈ V)
17	5, 7, 16	syl2anc 415	. . . . . . . . 9 ⊢ (𝜑 → ⟨𝐾, 𝐸⟩ ∈ V)
18		snexg 4321	. . . . . . . . 9 ⊢ (⟨𝐾, 𝐸⟩ ∈ V → {⟨𝐾, 𝐸⟩} ∈ V)
19	17, 18	syl 14	. . . . . . . 8 ⊢ (𝜑 → {⟨𝐾, 𝐸⟩} ∈ V)
20		opvtxfv 16263	. . . . . . . 8 ⊢ ((𝑉 ∈ 𝑌 ∧ {⟨𝐾, 𝐸⟩} ∈ V) → (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = 𝑉)
21	15, 19, 20	syl2anc 415	. . . . . . 7 ⊢ (𝜑 → (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = 𝑉)
22	21	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = 𝑉)
23	14, 22	eleqtrrd 2318	. . . . 5 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝑢 ∈ (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩))
24		vex 2824	. . . . . . . . 9 ⊢ 𝑣 ∈ V
25	24	prid2 3818	. . . . . . . 8 ⊢ 𝑣 ∈ {𝑢, 𝑣}
26	25, 12	eleqtrrid 2328	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝑣 ∈ 𝐸)
27	9, 26	sseldd 3249	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝑣 ∈ 𝑉)
28	27, 22	eleqtrrd 2318	. . . . 5 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝑣 ∈ (Vtx‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩))
29	1	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝐸 ≈ 2o)
30	12, 29	eqbrtrrd 4154	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → {𝑢, 𝑣} ≈ 2o)
31		pr2ne 7538	. . . . . . . . 9 ⊢ ((𝑢 ∈ V ∧ 𝑣 ∈ V) → ({𝑢, 𝑣} ≈ 2o ↔ 𝑢 ≠ 𝑣))
32	31	el2v 2827	. . . . . . . 8 ⊢ ({𝑢, 𝑣} ≈ 2o ↔ 𝑢 ≠ 𝑣)
33	30, 32	sylib 122	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → 𝑢 ≠ 𝑣)
34	33	olcd 746	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → (𝑢 = 𝑣 ∨ 𝑢 ≠ 𝑣))
35		dcne 2431	. . . . . 6 ⊢ (DECID 𝑢 = 𝑣 ↔ (𝑢 = 𝑣 ∨ 𝑢 ≠ 𝑣))
36	34, 35	sylibr 134	. . . . 5 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → DECID 𝑢 = 𝑣)
37		opiedgfv 16266	. . . . . . . 8 ⊢ ((𝑉 ∈ 𝑌 ∧ {⟨𝐾, 𝐸⟩} ∈ V) → (iEdg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = {⟨𝐾, 𝐸⟩})
38	15, 19, 37	syl2anc 415	. . . . . . 7 ⊢ (𝜑 → (iEdg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = {⟨𝐾, 𝐸⟩})
39	38	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → (iEdg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = {⟨𝐾, 𝐸⟩})
40	12	opeq2d 3911	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → ⟨𝐾, 𝐸⟩ = ⟨𝐾, {𝑢, 𝑣}⟩)
41	40	sneqd 3722	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → {⟨𝐾, 𝐸⟩} = {⟨𝐾, {𝑢, 𝑣}⟩})
42	39, 41	eqtrd 2271	. . . . 5 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → (iEdg‘⟨𝑉, {⟨𝐾, 𝐸⟩}⟩) = {⟨𝐾, {𝑢, 𝑣}⟩})
43	4, 6, 23, 28, 36, 42	upgr1edc 16362	. . . 4 ⊢ ((𝜑 ∧ 𝐸 = {𝑢, 𝑣}) → ⟨𝑉, {⟨𝐾, 𝐸⟩}⟩ ∈ UPGraph)
44	43	ex 115	. . 3 ⊢ (𝜑 → (𝐸 = {𝑢, 𝑣} → ⟨𝑉, {⟨𝐾, 𝐸⟩}⟩ ∈ UPGraph))
45	44	exlimdvv 1953	. 2 ⊢ (𝜑 → (∃𝑢∃𝑣 𝐸 = {𝑢, 𝑣} → ⟨𝑉, {⟨𝐾, 𝐸⟩}⟩ ∈ UPGraph))
46	3, 45	mpd 13	1 ⊢ (𝜑 → ⟨𝑉, {⟨𝐾, 𝐸⟩}⟩ ∈ UPGraph)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  DECID wdc 846   = wceq 1402  ∃wex 1545   ∈ wcel 2209   ≠ wne 2420  Vcvv 2821   ⊆ wss 3220  𝒫 cpw 3688  {csn 3709  {cpr 3710  ⟨cop 3712   class class class wbr 4130  ‘cfv 5377  2_oc2o 6681   ≈ cen 7020  Vtxcvtx 16253  iEdgciedg 16254  UPGraphcupgr 16332

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-1o 6687  df-2o 6688  df-er 6807  df-en 7023  df-sub 8499  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-n0 9564  df-dec 9778  df-ndx 13355  df-slot 13356  df-base 13358  df-edgf 16246  df-vtx 16255  df-iedg 16256  df-upgren 16334

This theorem is used by:  umgr1een  16366  p1evtxdeqfilem  16552  p1evtxdeqfi  16553