Metamath Proof Explorer


Theorem ausgrusgrb

Description: The equivalence of the definitions of a simple graph. (Contributed by Alexander van der Vekens, 28-Aug-2017) (Revised by AV, 14-Oct-2020)

Ref Expression
Hypothesis ausgr.1 ⊢ G = v e | e ⊆ x ∈ 𝒫 v | x = 2
Assertion ausgrusgrb ⊢ V ∈ X ∧ E ∈ Y → V G E ↔ V I ↾ E ∈ USGraph

Proof

Step Hyp Ref Expression
1 ausgr.1 ⊢ G = v e | e ⊆ x ∈ 𝒫 v | x = 2
2 1 isausgr ⊢ V ∈ X ∧ E ∈ Y → V G E ↔ E ⊆ x ∈ 𝒫 V | x = 2
3 f1oi ⊢ I ↾ E : E ⟶ 1-1 onto E
4 dff1o5 ⊢ I ↾ E : E ⟶ 1-1 onto E ↔ I ↾ E : E ⟶ 1-1 E ∧ ran ⁡ I ↾ E = E
5 f1ss ⊢ I ↾ E : E ⟶ 1-1 E ∧ E ⊆ x ∈ 𝒫 V | x = 2 → I ↾ E : E ⟶ 1-1 x ∈ 𝒫 V | x = 2
6 dmresi ⊢ dom ⁡ I ↾ E = E
7 6 eqcomi ⊢ E = dom ⁡ I ↾ E
8 f1eq2 ⊢ E = dom ⁡ I ↾ E → I ↾ E : E ⟶ 1-1 x ∈ 𝒫 V | x = 2 ↔ I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
9 7 8 ax-mp ⊢ I ↾ E : E ⟶ 1-1 x ∈ 𝒫 V | x = 2 ↔ I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
10 5 9 sylib ⊢ I ↾ E : E ⟶ 1-1 E ∧ E ⊆ x ∈ 𝒫 V | x = 2 → I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
11 10 ex ⊢ I ↾ E : E ⟶ 1-1 E → E ⊆ x ∈ 𝒫 V | x = 2 → I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
12 11 a1d ⊢ I ↾ E : E ⟶ 1-1 E → V ∈ X ∧ E ∈ Y → E ⊆ x ∈ 𝒫 V | x = 2 → I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
13 12 adantr ⊢ I ↾ E : E ⟶ 1-1 E ∧ ran ⁡ I ↾ E = E → V ∈ X ∧ E ∈ Y → E ⊆ x ∈ 𝒫 V | x = 2 → I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
14 4 13 sylbi ⊢ I ↾ E : E ⟶ 1-1 onto E → V ∈ X ∧ E ∈ Y → E ⊆ x ∈ 𝒫 V | x = 2 → I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
15 3 14 ax-mp ⊢ V ∈ X ∧ E ∈ Y → E ⊆ x ∈ 𝒫 V | x = 2 → I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
16 df-f ⊢ I ↾ E : dom ⁡ I ↾ E ⟶ x ∈ 𝒫 V | x = 2 ↔ I ↾ E Fn dom ⁡ I ↾ E ∧ ran ⁡ I ↾ E ⊆ x ∈ 𝒫 V | x = 2
17 rnresi ⊢ ran ⁡ I ↾ E = E
18 17 sseq1i ⊢ ran ⁡ I ↾ E ⊆ x ∈ 𝒫 V | x = 2 ↔ E ⊆ x ∈ 𝒫 V | x = 2
19 18 biimpi ⊢ ran ⁡ I ↾ E ⊆ x ∈ 𝒫 V | x = 2 → E ⊆ x ∈ 𝒫 V | x = 2
20 19 a1d ⊢ ran ⁡ I ↾ E ⊆ x ∈ 𝒫 V | x = 2 → V ∈ X ∧ E ∈ Y → E ⊆ x ∈ 𝒫 V | x = 2
21 16 20 simplbiim ⊢ I ↾ E : dom ⁡ I ↾ E ⟶ x ∈ 𝒫 V | x = 2 → V ∈ X ∧ E ∈ Y → E ⊆ x ∈ 𝒫 V | x = 2
22 f1f ⊢ I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2 → I ↾ E : dom ⁡ I ↾ E ⟶ x ∈ 𝒫 V | x = 2
23 21 22 syl11 ⊢ V ∈ X ∧ E ∈ Y → I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2 → E ⊆ x ∈ 𝒫 V | x = 2
24 15 23 impbid ⊢ V ∈ X ∧ E ∈ Y → E ⊆ x ∈ 𝒫 V | x = 2 ↔ I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
25 resiexg ⊢ E ∈ Y → I ↾ E ∈ V
26 opiedgfv ⊢ V ∈ X ∧ I ↾ E ∈ V → iEdg ⁡ V I ↾ E = I ↾ E
27 25 26 sylan2 ⊢ V ∈ X ∧ E ∈ Y → iEdg ⁡ V I ↾ E = I ↾ E
28 27 dmeqd ⊢ V ∈ X ∧ E ∈ Y → dom ⁡ iEdg ⁡ V I ↾ E = dom ⁡ I ↾ E
29 opvtxfv ⊢ V ∈ X ∧ I ↾ E ∈ V → Vtx ⁡ V I ↾ E = V
30 25 29 sylan2 ⊢ V ∈ X ∧ E ∈ Y → Vtx ⁡ V I ↾ E = V
31 30 pweqd ⊢ V ∈ X ∧ E ∈ Y → 𝒫 Vtx ⁡ V I ↾ E = 𝒫 V
32 31 rabeqdv ⊢ V ∈ X ∧ E ∈ Y → x ∈ 𝒫 Vtx ⁡ V I ↾ E | x = 2 = x ∈ 𝒫 V | x = 2
33 27 28 32 f1eq123d ⊢ V ∈ X ∧ E ∈ Y → iEdg ⁡ V I ↾ E : dom ⁡ iEdg ⁡ V I ↾ E ⟶ 1-1 x ∈ 𝒫 Vtx ⁡ V I ↾ E | x = 2 ↔ I ↾ E : dom ⁡ I ↾ E ⟶ 1-1 x ∈ 𝒫 V | x = 2
34 24 33 bitr4d ⊢ V ∈ X ∧ E ∈ Y → E ⊆ x ∈ 𝒫 V | x = 2 ↔ iEdg ⁡ V I ↾ E : dom ⁡ iEdg ⁡ V I ↾ E ⟶ 1-1 x ∈ 𝒫 Vtx ⁡ V I ↾ E | x = 2
35 opex ⊢ V I ↾ E ∈ V
36 eqid ⊢ Vtx ⁡ V I ↾ E = Vtx ⁡ V I ↾ E
37 eqid ⊢ iEdg ⁡ V I ↾ E = iEdg ⁡ V I ↾ E
38 36 37 isusgrs ⊢ V I ↾ E ∈ V → V I ↾ E ∈ USGraph ↔ iEdg ⁡ V I ↾ E : dom ⁡ iEdg ⁡ V I ↾ E ⟶ 1-1 x ∈ 𝒫 Vtx ⁡ V I ↾ E | x = 2
39 35 38 ax-mp ⊢ V I ↾ E ∈ USGraph ↔ iEdg ⁡ V I ↾ E : dom ⁡ iEdg ⁡ V I ↾ E ⟶ 1-1 x ∈ 𝒫 Vtx ⁡ V I ↾ E | x = 2
40 39 bicomi ⊢ iEdg ⁡ V I ↾ E : dom ⁡ iEdg ⁡ V I ↾ E ⟶ 1-1 x ∈ 𝒫 Vtx ⁡ V I ↾ E | x = 2 ↔ V I ↾ E ∈ USGraph
41 40 a1i ⊢ V ∈ X ∧ E ∈ Y → iEdg ⁡ V I ↾ E : dom ⁡ iEdg ⁡ V I ↾ E ⟶ 1-1 x ∈ 𝒫 Vtx ⁡ V I ↾ E | x = 2 ↔ V I ↾ E ∈ USGraph
42 2 34 41 3bitrd ⊢ V ∈ X ∧ E ∈ Y → V G E ↔ V I ↾ E ∈ USGraph