Theorem ushggricedg 47187

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 6905	. . . . 5 ⊢ 𝑉 ∈ V
3	2	a1i 11	. . . 4 ⊢ (𝐺 ∈ USHGraph → 𝑉 ∈ V)
4	3	resiexd 7222	. . 3 ⊢ (𝐺 ∈ USHGraph → ( I ↾ 𝑉) ∈ V)
5		f1oi 6871	. . . . . 6 ⊢ ( I ↾ 𝑉):𝑉–1-1-onto→𝑉
6	5	a1i 11	. . . . 5 ⊢ (𝐺 ∈ USHGraph → ( I ↾ 𝑉):𝑉–1-1-onto→𝑉)
7		ushggricedg.s	. . . . . . . 8 ⊢ 𝐻 = ⟨𝑉, ( I ↾ 𝐸)⟩
8	7	fveq2i 6894	. . . . . . 7 ⊢ (Vtx‘𝐻) = (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩)
9		ushggricedg.e	. . . . . . . . . . 11 ⊢ 𝐸 = (Edg‘𝐺)
10	9	fvexi 6905	. . . . . . . . . 10 ⊢ 𝐸 ∈ V
11		resiexg 7914	. . . . . . . . . 10 ⊢ (𝐸 ∈ V → ( I ↾ 𝐸) ∈ V)
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ ( I ↾ 𝐸) ∈ V
13	2, 12	pm3.2i 470	. . . . . . . 8 ⊢ (𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V)
14		opvtxfv 28810	. . . . . . . 8 ⊢ ((𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V) → (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝑉)
15	13, 14	mp1i 13	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝑉)
16	8, 15	eqtrid 2780	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → (Vtx‘𝐻) = 𝑉)
17	16	f1oeq3d 6830	. . . . 5 ⊢ (𝐺 ∈ USHGraph → (( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻) ↔ ( I ↾ 𝑉):𝑉–1-1-onto→𝑉))
18	6, 17	mpbird 257	. . . 4 ⊢ (𝐺 ∈ USHGraph → ( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻))
19		fvexd 6906	. . . . 5 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺) ∈ V)
20		eqid 2728	. . . . . . . . 9 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
21	1, 20	ushgrf 28869	. . . . . . . 8 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}))
22		f1f1orn 6844	. . . . . . . 8 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺))
23	21, 22	syl 17	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺))
24	7	fveq2i 6894	. . . . . . . . . . 11 ⊢ (iEdg‘𝐻) = (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)
25	10	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ USHGraph → 𝐸 ∈ V)
26	25	resiexd 7222	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USHGraph → ( I ↾ 𝐸) ∈ V)
27		opiedgfv 28813	. . . . . . . . . . . 12 ⊢ ((𝑉 ∈ V ∧ ( I ↾ 𝐸) ∈ V) → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
28	2, 26, 27	sylancr 586	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
29	24, 28	eqtrid 2780	. . . . . . . . . 10 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐻) = ( I ↾ 𝐸))
30	29	dmeqd 5902	. . . . . . . . 9 ⊢ (𝐺 ∈ USHGraph → dom (iEdg‘𝐻) = dom ( I ↾ 𝐸))
31		dmresi 6049	. . . . . . . . . 10 ⊢ dom ( I ↾ 𝐸) = 𝐸
32	9	a1i 11	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → 𝐸 = (Edg‘𝐺))
33		edgval 28855	. . . . . . . . . . 11 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
34	32, 33	eqtrdi 2784	. . . . . . . . . 10 ⊢ (𝐺 ∈ USHGraph → 𝐸 = ran (iEdg‘𝐺))
35	31, 34	eqtrid 2780	. . . . . . . . 9 ⊢ (𝐺 ∈ USHGraph → dom ( I ↾ 𝐸) = ran (iEdg‘𝐺))
36	30, 35	eqtrd 2768	. . . . . . . 8 ⊢ (𝐺 ∈ USHGraph → dom (iEdg‘𝐻) = ran (iEdg‘𝐺))
37	36	f1oeq3d 6830	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→ran (iEdg‘𝐺)))
38	23, 37	mpbird 257	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻))
39		ushgruhgr 28875	. . . . . . . . . 10 ⊢ (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph)
40	1, 20	uhgrss 28870	. . . . . . . . . 10 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ 𝑉)
41	39, 40	sylan 579	. . . . . . . . 9 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ 𝑉)
42		resiima 6073	. . . . . . . . 9 ⊢ (((iEdg‘𝐺)‘𝑖) ⊆ 𝑉 → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
43	41, 42	syl 17	. . . . . . . 8 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
44		f1f 6787	. . . . . . . . . . . . 13 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 𝑉 ∖ {∅}) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
45	21, 44	syl 17	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
46	45	ffund 6720	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → Fun (iEdg‘𝐺))
47		fvelrn 7080	. . . . . . . . . . 11 ⊢ ((Fun (iEdg‘𝐺) ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ ran (iEdg‘𝐺))
48	46, 47	sylan 579	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ ran (iEdg‘𝐺))
49	9, 33	eqtri 2756	. . . . . . . . . 10 ⊢ 𝐸 = ran (iEdg‘𝐺)
50	48, 49	eleqtrrdi 2840	. . . . . . . . 9 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ 𝐸)
51		fvresi 7176	. . . . . . . . 9 ⊢ (((iEdg‘𝐺)‘𝑖) ∈ 𝐸 → (( I ↾ 𝐸)‘((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
52	50, 51	syl 17	. . . . . . . 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 586	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
56	24, 55	eqtr2id 2781	. . . . . . . . 9 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ( I ↾ 𝐸) = (iEdg‘𝐻))
57	56	fveq1d 6893	. . . . . . . 8 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝐸)‘((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
58	43, 52, 57	3eqtr2d 2774	. . . . . . 7 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
59	58	ralrimiva 3142	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
60	38, 59	jca 511	. . . . 5 ⊢ (𝐺 ∈ USHGraph → ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
61		f1oeq1 6821	. . . . . 6 ⊢ (𝑔 = (iEdg‘𝐺) → (𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻)))
62		fveq1 6890	. . . . . . . . 9 ⊢ (𝑔 = (iEdg‘𝐺) → (𝑔‘𝑖) = ((iEdg‘𝐺)‘𝑖))
63	62	fveq2d 6895	. . . . . . . 8 ⊢ (𝑔 = (iEdg‘𝐺) → ((iEdg‘𝐻)‘(𝑔‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖)))
64	63	eqeq2d 2739	. . . . . . 7 ⊢ (𝑔 = (iEdg‘𝐺) → ((( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)) ↔ (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
65	64	ralbidv 3173	. . . . . 6 ⊢ (𝑔 = (iEdg‘𝐺) → (∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((iEdg‘𝐺)‘𝑖))))
66	61, 65	anbi12d 631	. . . . 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 3584	. . . 4 ⊢ (𝐺 ∈ USHGraph → ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))
68	18, 67	jca 511	. . 3 ⊢ (𝐺 ∈ USHGraph → (( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)))))
69		f1oeq1 6821	. . . 4 ⊢ (𝑓 = ( I ↾ 𝑉) → (𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ↔ ( I ↾ 𝑉):𝑉–1-1-onto→(Vtx‘𝐻)))
70		imaeq1 6052	. . . . . . . 8 ⊢ (𝑓 = ( I ↾ 𝑉) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)))
71	70	eqeq1d 2730	. . . . . . 7 ⊢ (𝑓 = ( I ↾ 𝑉) → ((𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)) ↔ (( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))
72	71	ralbidv 3173	. . . . . 6 ⊢ (𝑓 = ( I ↾ 𝑉) → (∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)(( I ↾ 𝑉) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))
73	72	anbi2d 629	. . . . 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 1917	. . . 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 631	. . 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 3584	. 2 ⊢ (𝐺 ∈ USHGraph → ∃𝑓(𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖)))))
77		opex 5460	. . . 4 ⊢ ⟨𝑉, ( I ↾ 𝐸)⟩ ∈ V
78	7, 77	eqeltri 2825	. . 3 ⊢ 𝐻 ∈ V
79		eqid 2728	. . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
80		eqid 2728	. . . 4 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
81	1, 79, 20, 80	dfgric2 47175	. . 3 ⊢ ((𝐺 ∈ USHGraph ∧ 𝐻 ∈ V) → (𝐺 ≃𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))))
82	78, 81	mpan2 690	. 2 ⊢ (𝐺 ∈ USHGraph → (𝐺 ≃𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)(𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑔‘𝑖))))))
83	76, 82	mpbird 257	1 ⊢ (𝐺 ∈ USHGraph → 𝐺 ≃𝑔𝑟 𝐻)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1534  ∃wex 1774   ∈ wcel 2099  ∀wral 3057  Vcvv 3470   ∖ cdif 3942   ⊆ wss 3945  ∅c0 4318  𝒫 cpw 4598  {csn 4624  ⟨cop 4630   class class class wbr 5142   I cid 5569  dom cdm 5672  ran crn 5673   ↾ cres 5674   “ cima 5675  Fun wfun 6536  ⟶wf 6538  –1-1→wf1 6539  –1-1-onto→wf1o 6541  ‘cfv 6542  Vtxcvtx 28802  iEdgciedg 28803  Edgcedg 28853  UHGraphcuhgr 28862  USHGraphcushgr 28863   ≃_𝑔𝑟 cgric 47154

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7734

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2937  df-ral 3058  df-rex 3067  df-reu 3373  df-rab 3429  df-v 3472  df-sbc 3776  df-csb 3891  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5143  df-opab 5205  df-mpt 5226  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-1o 8480  df-map 8840  df-vtx 28804  df-iedg 28805  df-edg 28854  df-uhgr 28864  df-ushgr 28865  df-grim 47156  df-gric 47159

This theorem is referenced by: (None)

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »