Theorem isausgr 29656

Description: The property of an ordered pair to be an alternatively defined simple graph, defined as a pair (V,E) of a set V (vertex set) and a set of unordered pairs of elements of V (edge set). (Contributed by Alexander van der Vekens, 28-Aug-2017.)

Hypothesis

Ref	Expression
ausgr.1	⊢ 𝐺 = {⟨𝑣, 𝑒⟩ ∣ 𝑒 ⊆ {𝑥 ∈ 𝒫 𝑣 ∣ (♯‘𝑥) = 2}}

Assertion

Ref	Expression
isausgr	⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (𝑉𝐺𝐸 ↔ 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}))

Distinct variable groups:   𝑣,𝑒,𝑥,𝐸   𝑒,𝑉,𝑣,𝑥   𝑥,𝑋

Allowed substitution hints:   𝐺(𝑥, 𝑣, 𝑒)   𝑊(𝑥, 𝑣, 𝑒)   𝑋(𝑣, 𝑒)

Proof of Theorem isausgr

Step	Hyp	Ref	Expression
1		simpr 490	. . 3 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → 𝑒 = 𝐸)
2		pweq 4571	. . . . 5 ⊢ (𝑣 = 𝑉 → 𝒫 𝑣 = 𝒫 𝑉)
3	2	adantr 486	. . . 4 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → 𝒫 𝑣 = 𝒫 𝑉)
4	3	rabeqdv 3427	. . 3 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → {𝑥 ∈ 𝒫 𝑣 ∣ (♯‘𝑥) = 2} = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2})
5	1, 4	sseq12d 3964	. 2 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝑒 ⊆ {𝑥 ∈ 𝒫 𝑣 ∣ (♯‘𝑥) = 2} ↔ 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}))
6		ausgr.1	. 2 ⊢ 𝐺 = {⟨𝑣, 𝑒⟩ ∣ 𝑒 ⊆ {𝑥 ∈ 𝒫 𝑣 ∣ (♯‘𝑥) = 2}}
7	5, 6	brabga 5512	1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (𝑉𝐺𝐸 ↔ 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3412   ⊆ wss 3899  𝒫 cpw 4557   class class class wbr 5103  {copab 5167  ‘cfv 6535  2c2 12344  ♯chash 14419

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 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398

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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168

This theorem is used by:  ausgrusgrb  29657  usgrausgri  29658  ausgrumgri  29659  ausgrusgri  29660