Theorem isushgr 29621

Description: The predicate "is an undirected simple hypergraph." (Contributed by AV, 19-Jan-2020.) (Revised by AV, 9-Oct-2020.)

Hypotheses

Ref	Expression
isuhgr.v	⊢ 𝑉 = (Vtx‘𝐺)
isuhgr.e	⊢ 𝐸 = (iEdg‘𝐺)

Assertion

Ref	Expression
isushgr	⊢ (𝐺 ∈ 𝑈 → (𝐺 ∈ USHGraph ↔ 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅})))

Proof of Theorem isushgr

Dummy variables 𝑔 ℎ 𝑣 𝑒 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ushgr 29619	. . 3 ⊢ USHGraph = {𝑔 ∣ [(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒–1-1→(𝒫 𝑣 ∖ {∅})}
2	1	eleq2i 2853	. 2 ⊢ (𝐺 ∈ USHGraph ↔ 𝐺 ∈ {𝑔 ∣ [(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒–1-1→(𝒫 𝑣 ∖ {∅})})
3		fveq2 6877	. . . . 5 ⊢ (ℎ = 𝐺 → (iEdg‘ℎ) = (iEdg‘𝐺))
4		isuhgr.e	. . . . 5 ⊢ 𝐸 = (iEdg‘𝐺)
5	3, 4	eqtr4di 2814	. . . 4 ⊢ (ℎ = 𝐺 → (iEdg‘ℎ) = 𝐸)
6	3	dmeqd 5887	. . . . 5 ⊢ (ℎ = 𝐺 → dom (iEdg‘ℎ) = dom (iEdg‘𝐺))
7	4	eqcomi 2770	. . . . . 6 ⊢ (iEdg‘𝐺) = 𝐸
8	7	dmeqi 5886	. . . . 5 ⊢ dom (iEdg‘𝐺) = dom 𝐸
9	6, 8	eqtrdi 2812	. . . 4 ⊢ (ℎ = 𝐺 → dom (iEdg‘ℎ) = dom 𝐸)
10		fveq2 6877	. . . . . . 7 ⊢ (ℎ = 𝐺 → (Vtx‘ℎ) = (Vtx‘𝐺))
11		isuhgr.v	. . . . . . 7 ⊢ 𝑉 = (Vtx‘𝐺)
12	10, 11	eqtr4di 2814	. . . . . 6 ⊢ (ℎ = 𝐺 → (Vtx‘ℎ) = 𝑉)
13	12	pweqd 4574	. . . . 5 ⊢ (ℎ = 𝐺 → 𝒫 (Vtx‘ℎ) = 𝒫 𝑉)
14	13	difeq1d 4073	. . . 4 ⊢ (ℎ = 𝐺 → (𝒫 (Vtx‘ℎ) ∖ {∅}) = (𝒫 𝑉 ∖ {∅}))
15	5, 9, 14	f1eq123d 6808	. . 3 ⊢ (ℎ = 𝐺 → ((iEdg‘ℎ):dom (iEdg‘ℎ)–1-1→(𝒫 (Vtx‘ℎ) ∖ {∅}) ↔ 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅})))
16		fvexd 6892	. . . . 5 ⊢ (𝑔 = ℎ → (Vtx‘𝑔) ∈ V)
17		fveq2 6877	. . . . 5 ⊢ (𝑔 = ℎ → (Vtx‘𝑔) = (Vtx‘ℎ))
18		fvexd 6892	. . . . . 6 ⊢ ((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) → (iEdg‘𝑔) ∈ V)
19		fveq2 6877	. . . . . . 7 ⊢ (𝑔 = ℎ → (iEdg‘𝑔) = (iEdg‘ℎ))
20	19	adantr 486	. . . . . 6 ⊢ ((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) → (iEdg‘𝑔) = (iEdg‘ℎ))
21		simpr 490	. . . . . . 7 ⊢ (((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) ∧ 𝑒 = (iEdg‘ℎ)) → 𝑒 = (iEdg‘ℎ))
22	21	dmeqd 5887	. . . . . . 7 ⊢ (((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) ∧ 𝑒 = (iEdg‘ℎ)) → dom 𝑒 = dom (iEdg‘ℎ))
23		simpr 490	. . . . . . . . . 10 ⊢ ((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) → 𝑣 = (Vtx‘ℎ))
24	23	pweqd 4574	. . . . . . . . 9 ⊢ ((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) → 𝒫 𝑣 = 𝒫 (Vtx‘ℎ))
25	24	difeq1d 4073	. . . . . . . 8 ⊢ ((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) → (𝒫 𝑣 ∖ {∅}) = (𝒫 (Vtx‘ℎ) ∖ {∅}))
26	25	adantr 486	. . . . . . 7 ⊢ (((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) ∧ 𝑒 = (iEdg‘ℎ)) → (𝒫 𝑣 ∖ {∅}) = (𝒫 (Vtx‘ℎ) ∖ {∅}))
27	21, 22, 26	f1eq123d 6808	. . . . . 6 ⊢ (((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) ∧ 𝑒 = (iEdg‘ℎ)) → (𝑒:dom 𝑒–1-1→(𝒫 𝑣 ∖ {∅}) ↔ (iEdg‘ℎ):dom (iEdg‘ℎ)–1-1→(𝒫 (Vtx‘ℎ) ∖ {∅})))
28	18, 20, 27	sbcied2 3783	. . . . 5 ⊢ ((𝑔 = ℎ ∧ 𝑣 = (Vtx‘ℎ)) → ([(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒–1-1→(𝒫 𝑣 ∖ {∅}) ↔ (iEdg‘ℎ):dom (iEdg‘ℎ)–1-1→(𝒫 (Vtx‘ℎ) ∖ {∅})))
29	16, 17, 28	sbcied2 3783	. . . 4 ⊢ (𝑔 = ℎ → ([(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒–1-1→(𝒫 𝑣 ∖ {∅}) ↔ (iEdg‘ℎ):dom (iEdg‘ℎ)–1-1→(𝒫 (Vtx‘ℎ) ∖ {∅})))
30	29	cbvabv 2831	. . 3 ⊢ {𝑔 ∣ [(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒–1-1→(𝒫 𝑣 ∖ {∅})} = {ℎ ∣ (iEdg‘ℎ):dom (iEdg‘ℎ)–1-1→(𝒫 (Vtx‘ℎ) ∖ {∅})}
31	15, 30	elab2g 3634	. 2 ⊢ (𝐺 ∈ 𝑈 → (𝐺 ∈ {𝑔 ∣ [(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒–1-1→(𝒫 𝑣 ∖ {∅})} ↔ 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅})))
32	2, 31	bitrid 286	1 ⊢ (𝐺 ∈ 𝑈 → (𝐺 ∈ USHGraph ↔ 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅})))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  Vcvv 3451  [wsbc 3739   ∖ cdif 3896  ∅c0 4279  𝒫 cpw 4557  {csn 4584  dom cdm 5651  –1-1→wf1 6528  ‘cfv 6531  Vtxcvtx 29556  iEdgciedg 29557  USHGraphcushgr 29617

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 2733  ax-nul 5260

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 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fv 6539  df-ushgr 29619

This theorem is used by:  ushgrf  29623  uspgrushgr  29740