nbupgrel - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > nbupgrel		Structured version Visualization version GIF version

Theorem nbupgrel 29418

Description: A neighbor of a vertex in a pseudograph. (Contributed by AV, 5-Nov-2020.)

**Hypotheses**
Ref	Expression
nbuhgr.v	⊢ 𝑉 = (Vtx‘𝐺)
nbuhgr.e	⊢ 𝐸 = (Edg‘𝐺)

**Assertion**
Ref	Expression
nbupgrel	⊢ (((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝐾)) → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑁, 𝐾} ∈ 𝐸))

Proof of Theorem nbupgrel Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nbuhgr.v	. . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺)
2		nbuhgr.e	. . . . . 6 ⊢ 𝐸 = (Edg‘𝐺)
3	1, 2	nbupgr 29417	. . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) → (𝐺 NeighbVtx 𝐾) = {𝑛 ∈ (𝑉 ∖ {𝐾}) ∣ {𝐾, 𝑛} ∈ 𝐸})
4	3	eleq2d 2822	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝐾}) ∣ {𝐾, 𝑛} ∈ 𝐸}))
5		preq2 4691	. . . . . 6 ⊢ (𝑛 = 𝑁 → {𝐾, 𝑛} = {𝐾, 𝑁})
6	5	eleq1d 2821	. . . . 5 ⊢ (𝑛 = 𝑁 → ({𝐾, 𝑛} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸))
7	6	elrab 3646	. . . 4 ⊢ (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝐾}) ∣ {𝐾, 𝑛} ∈ 𝐸} ↔ (𝑁 ∈ (𝑉 ∖ {𝐾}) ∧ {𝐾, 𝑁} ∈ 𝐸))
8	4, 7	bitrdi 287	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ (𝑁 ∈ (𝑉 ∖ {𝐾}) ∧ {𝐾, 𝑁} ∈ 𝐸)))
9	8	adantr 480	. 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝐾)) → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ (𝑁 ∈ (𝑉 ∖ {𝐾}) ∧ {𝐾, 𝑁} ∈ 𝐸)))
10		eldifsn 4742	. . . . 5 ⊢ (𝑁 ∈ (𝑉 ∖ {𝐾}) ↔ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝐾))
11	10	biimpri 228	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝐾) → 𝑁 ∈ (𝑉 ∖ {𝐾}))
12	11	adantl 481	. . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝐾)) → 𝑁 ∈ (𝑉 ∖ {𝐾}))
13	12	biantrurd 532	. 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝐾)) → ({𝐾, 𝑁} ∈ 𝐸 ↔ (𝑁 ∈ (𝑉 ∖ {𝐾}) ∧ {𝐾, 𝑁} ∈ 𝐸)))
14		prcom 4689	. . . 4 ⊢ {𝐾, 𝑁} = {𝑁, 𝐾}
15	14	eleq1i 2827	. . 3 ⊢ ({𝐾, 𝑁} ∈ 𝐸 ↔ {𝑁, 𝐾} ∈ 𝐸)
16	15	a1i 11	. 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝐾)) → ({𝐾, 𝑁} ∈ 𝐸 ↔ {𝑁, 𝐾} ∈ 𝐸))
17	9, 13, 16	3bitr2d 307	1 ⊢ (((𝐺 ∈ UPGraph ∧ 𝐾 ∈ 𝑉) ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝐾)) → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑁, 𝐾} ∈ 𝐸))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 {crab 3399 ∖ cdif 3898 {csn 4580 {cpr 4582 ‘cfv 6492 (class class class)co 7358 Vtxcvtx 29069 Edgcedg 29120 UPGraphcupgr 29153 NeighbVtx cnbgr 29405

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-oadd 8401 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-dju 9813 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-n0 12402 df-xnn0 12475 df-z 12489 df-uz 12752 df-fz 13424 df-hash 14254 df-edg 29121 df-upgr 29155 df-nbgr 29406

This theorem is referenced by: nbupgrres 29437 cplgr3v 29508

W3C validator