Theorem ushggricedg 49024

Description: A simple hypergraph (with arbitrarily indexed edges) is isomorphic to a graph with the same vertices and the same edges, indexed by the edges themselves. (Contributed by AV, 11-Nov-2022.)

Hypotheses

Ref	Expression
ushggricedg.v	⊢ 𝑉 = (Vtx‘𝐺)
ushggricedg.e	⊢ 𝐸 = (Edg‘𝐺)
ushggricedg.s	⊢ 𝐻 = ⟨𝑉, ( I ↾ 𝐸)⟩

Assertion

Ref	Expression
ushggricedg	⊢ (𝐺 ∈ USHGraph → 𝐺 ≃𝑔𝑟 𝐻)

Proof of Theorem ushggricedg

Dummy variables 𝑓 𝑔 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ushggricedg.v	. . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	fvexi 6899	. . . . 5 ⊢ 𝑉 ∈ V
3	2	a1i 11	. . . 4 ⊢ (𝐺 ∈ USHGraph → 𝑉 ∈ V)
4	3	resiexd 7222	. . 3 ⊢ (𝐺 ∈ USHGraph → ( I ↾ 𝑉) ∈ V)
5		f1oi 6863	. . . . . 6 ⊢ ( I ↾ 𝑉):𝑉–1-1-onto→𝑉
6	5	a1i 11	. . . . 5 ⊢ (𝐺 ∈ USHGraph → ( I ↾ 𝑉):𝑉–1-1-onto→𝑉)
7		ushggricedg.s	. . . . . . . 8 ⊢ 𝐻 = ⟨𝑉, ( I ↾ 𝐸)⟩
8	7	fveq2i 6888	. . . . . . 7 ⊢ (Vtx‘𝐻) = (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩)
9		ushggricedg.e	. . . . . . . . . . 11 ⊢ 𝐸 = (Edg‘𝐺)
10	9	fvexi 6899	. . . . . . . . . 10 ⊢ 𝐸 ∈ V
11		resiexg 7924	. . . . . . . . . 10 ⊢ (𝐸 ∈ V → ( I ↾ 𝐸) ∈ V)
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ ( I ↾ 𝐸) ∈ V
13	2, 12	pm3.2i 476	. . . . . . . 8 ⊢ (𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V)
14		opvtxfv 29582	. . . . . . . 8 ⊢ ((𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V) → (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝑉)
15	13, 14	mp1i 14	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝑉)
16	8, 15	eqtrid 2808	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → (Vtx‘𝐻) = 𝑉)
17	16	f1oeq3d 6821	. . . . 5 ⊢ (𝐺 ∈ USHGraph → (( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻) ↔ ( I ↾ 𝑉):𝑉–1-1-onto→𝑉))
18	6, 17	mpbird 260	. . . 4 ⊢ (𝐺 ∈ USHGraph → ( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻))
19		fvexd 6900	. . . . 5 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺) ∈ V)
20		eqid 2761	. . . . . . . . 9 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
21	1, 20	ushgrf 29641	. . . . . . . 8 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}))
22		f1f1orn 6836	. . . . . . . 8 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺))
23	21, 22	syl 18	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺))
24	7	fveq2i 6888	. . . . . . . . . . 11 ⊢ (iEdg‘𝐻) = (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)
25	10	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ USHGraph → 𝐸 ∈ V)
26	25	resiexd 7222	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USHGraph → ( I ↾ 𝐸) ∈ V)
27		opiedgfv 29585	. . . . . . . . . . . 12 ⊢ ((𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V) → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
28	2, 26, 27	sylancr 599	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
29	24, 28	eqtrid 2808	. . . . . . . . . 10 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐻) = ( I ↾ 𝐸))
30	29	dmeqd 5887	. . . . . . . . 9 ⊢ (𝐺 ∈ USHGraph → dom (iEdg‘𝐻) = dom ( I ↾ 𝐸))
31		dmresi 6044	. . . . . . . . . 10 ⊢ dom ( I ↾ 𝐸) = 𝐸
32	9	a1i 11	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → 𝐸 = (Edg‘𝐺))
33		edgval 29627	. . . . . . . . . . 11 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
34	32, 33	eqtrdi 2812	. . . . . . . . . 10 ⊢ (𝐺 ∈ USHGraph → 𝐸 = ran (iEdg‘𝐺))
35	31, 34	eqtrid 2808	. . . . . . . . 9 ⊢ (𝐺 ∈ USHGraph → dom ( I ↾ 𝐸) = ran (iEdg‘𝐺))
36	30, 35	eqtrd 2796	. . . . . . . 8 ⊢ (𝐺 ∈ USHGraph → dom (iEdg‘𝐻) = ran (iEdg‘𝐺))
37	36	f1oeq3d 6821	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺)))
38	23, 37	mpbird 260	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻))
39		ushgruhgr 29647	. . . . . . . . . 10 ⊢ (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph)
40	1, 20	uhgrss 29642	. . . . . . . . . 10 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ 𝑉)
41	39, 40	sylan 592	. . . . . . . . 9 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ 𝑉)
42		resiima 6074	. . . . . . . . 9 ⊢ (((iEdg‘𝐺)‘𝑖) ⊆ 𝑉 → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
43	41, 42	syl 18	. . . . . . . 8 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
44		f1f 6778	. . . . . . . . . . . . 13 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
45	21, 44	syl 18	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
46	45	ffund 6714	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → Fun (iEdg‘𝐺))
47		fvelrn 7076	. . . . . . . . . . 11 ⊢ ((Fun (iEdg‘𝐺) ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ ran (iEdg‘𝐺))
48	46, 47	sylan 592	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ ran (iEdg‘𝐺))
49	9, 33	eqtri 2784	. . . . . . . . . 10 ⊢ 𝐸 = ran (iEdg‘𝐺)
50	48, 49	eleqtrrdi 2872	. . . . . . . . 9 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ 𝐸)
51		fvresi 7178	. . . . . . . . 9 ⊢ (((iEdg‘𝐺)‘𝑖) ∈ 𝐸 → (( I ↾ 𝐸)‘((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
52	50, 51	syl 18	. . . . . . . 8 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝐸)‘((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
53	10	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → 𝐸 ∈ V)
54	53	resiexd 7222	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ( I ↾ 𝐸) ∈ V)
55	2, 54, 27	sylancr 599	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
56	24, 55	eqtr2id 2809	. . . . . . . . 9 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ( I ↾ 𝐸) = (iEdg‘𝐻))
57	56	fveq1d 6887	. . . . . . . 8 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝐸)‘((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
58	43, 52, 57	3eqtr2d 2802	. . . . . . 7 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
59	58	ralrimiva 3155	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
60	38, 59	jca 521	. . . . 5 ⊢ (𝐺 ∈ USHGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
61		f1oeq1 6812	. . . . . 6 ⊢ (𝑔 = (iEdg‘𝐺) → (𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻)))
62		fveq1 6884	. . . . . . . . 9 ⊢ (𝑔 = (iEdg‘𝐺) → (𝑔‘𝑖) = ((iEdg‘𝐺)‘𝑖))
63	62	fveq2d 6889	. . . . . . . 8 ⊢ (𝑔 = (iEdg‘𝐺) → ((iEdg‘𝐻)‘(𝑔‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
64	63	eqeq2d 2772	. . . . . . 7 ⊢ (𝑔 = (iEdg‘𝐺) → ((( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)) ↔ (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
65	64	ralbidv 3186	. . . . . 6 ⊢ (𝑔 = (iEdg‘𝐺) → (∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
66	61, 65	anbi12d 644	. . . . 5 ⊢ (𝑔 = (iEdg‘𝐺) → ((𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))) ↔ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))))
67	19, 60, 66	spcedv 3553	. . . 4 ⊢ (𝐺 ∈ USHGraph → ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))
68	18, 67	jca 521	. . 3 ⊢ (𝐺 ∈ USHGraph → (( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)))))
69		f1oeq1 6812	. . . 4 ⊢ (𝑓 = ( I ↾ 𝑉) → (𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ↔ ( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻)))
70		imaeq1 6047	. . . . . . . 8 ⊢ (𝑓 = ( I ↾ 𝑉) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)))
71	70	eqeq1d 2763	. . . . . . 7 ⊢ (𝑓 = ( I ↾ 𝑉) → ((𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)) ↔ (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))
72	71	ralbidv 3186	. . . . . 6 ⊢ (𝑓 = ( I ↾ 𝑉) → (∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))
73	72	anbi2d 642	. . . . 5 ⊢ (𝑓 = ( I ↾ 𝑉) → ((𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))) ↔ (𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)))))
74	73	exbidv 1954	. . . 4 ⊢ (𝑓 = ( I ↾ 𝑉) → (∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))) ↔ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)))))
75	69, 74	anbi12d 644	. . 3 ⊢ (𝑓 = ( I ↾ 𝑉) → ((𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)))) ↔ (( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))))
76	4, 68, 75	spcedv 3553	. 2 ⊢ (𝐺 ∈ USHGraph → ∃𝑓(𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)))))
77		opex 5432	. . . 4 ⊢ ⟨𝑉, ( I ↾ 𝐸)⟩ ∈ V
78	7, 77	eqeltri 2857	. . 3 ⊢ 𝐻 ∈ V
79		eqid 2761	. . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
80		eqid 2761	. . . 4 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
81	1, 79, 20, 80	dfgric2 49012	. . 3 ⊢ ((𝐺 ∈ USHGraph ∧ 𝐻 ∈ V) → (𝐺 ≃𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))))
82	78, 81	mpan2 704	. 2 ⊢ (𝐺 ∈ USHGraph → (𝐺 ≃𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))))
83	76, 82	mpbird 260	1 ⊢ (𝐺 ∈ USHGraph → 𝐺 ≃𝑔𝑟 𝐻)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  {csn 4584  ⟨cop 4590   class class class wbr 5103   I cid 5545  dom cdm 5651  ran crn 5652   ↾ cres 5653   “ cima 5654  Fun wfun 6532  ⟶wf 6534  –1-1→wf1 6535  –1-1-onto→wf1o 6537  ‘cfv 6538  Vtxcvtx 29574  iEdgciedg 29575  Edgcedg 29625  UHGraphcuhgr 29634  USHGraphcushgr 29635   ≃_𝑔𝑟 cgric 48973

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  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-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-1o 8476  df-map 8849  df-vtx 29576  df-iedg 29577  df-edg 29626  df-uhgr 29636  df-ushgr 29637  df-grim 48975  df-gric 48978

This theorem is used by: (None)