iscgrg - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > iscgrg		Structured version Visualization version GIF version

Theorem iscgrg 28018

Description: The congruence property for sequences of points. (Contributed by Thierry Arnoux, 3-Apr-2019.)

**Hypotheses**
Ref	Expression
iscgrg.p	⊢ 𝑃 = (Base‘𝐺)
iscgrg.m	⊢ − = (dist‘𝐺)
iscgrg.e	⊢ ∼ = (cgrG‘𝐺)

**Assertion**
Ref	Expression
iscgrg	⊢ (𝐺 ∈ 𝑉 → (𝐴 ∼ 𝐵 ↔ ((𝐴 ∈ (𝑃 ↑_pm ℝ) ∧ 𝐵 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝐴 = dom 𝐵 ∧ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))))

Distinct variable groups: 𝑖,𝑗,𝐺 𝐴,𝑖,𝑗 𝐵,𝑖,𝑗 Allowed substitution hints: 𝑃(𝑖,𝑗) ∼ (𝑖,𝑗) − (𝑖,𝑗) 𝑉(𝑖,𝑗)

Proof of Theorem iscgrg Dummy variables 𝑎 𝑏 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		iscgrg.e	. . . 4 ⊢ ∼ = (cgrG‘𝐺)
2		elex 3492	. . . . 5 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
3		fveq2 6891	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
4		iscgrg.p	. . . . . . . . . . . 12 ⊢ 𝑃 = (Base‘𝐺)
5	3, 4	eqtr4di 2790	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
6	5	oveq1d 7426	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → ((Base‘𝑔) ↑_pm ℝ) = (𝑃 ↑_pm ℝ))
7	6	eleq2d 2819	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑎 ∈ ((Base‘𝑔) ↑_pm ℝ) ↔ 𝑎 ∈ (𝑃 ↑_pm ℝ)))
8	6	eleq2d 2819	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑏 ∈ ((Base‘𝑔) ↑_pm ℝ) ↔ 𝑏 ∈ (𝑃 ↑_pm ℝ)))
9	7, 8	anbi12d 631	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((𝑎 ∈ ((Base‘𝑔) ↑_pm ℝ) ∧ 𝑏 ∈ ((Base‘𝑔) ↑_pm ℝ)) ↔ (𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ))))
10		fveq2 6891	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝐺 → (dist‘𝑔) = (dist‘𝐺))
11		iscgrg.m	. . . . . . . . . . . . 13 ⊢ − = (dist‘𝐺)
12	10, 11	eqtr4di 2790	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝐺 → (dist‘𝑔) = − )
13	12	oveqd 7428	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → ((𝑎‘𝑖)(dist‘𝑔)(𝑎‘𝑗)) = ((𝑎‘𝑖) − (𝑎‘𝑗)))
14	12	oveqd 7428	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → ((𝑏‘𝑖)(dist‘𝑔)(𝑏‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)))
15	13, 14	eqeq12d 2748	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (((𝑎‘𝑖)(dist‘𝑔)(𝑎‘𝑗)) = ((𝑏‘𝑖)(dist‘𝑔)(𝑏‘𝑗)) ↔ ((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))
16	15	2ralbidv 3218	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖)(dist‘𝑔)(𝑎‘𝑗)) = ((𝑏‘𝑖)(dist‘𝑔)(𝑏‘𝑗)) ↔ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))
17	16	anbi2d 629	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖)(dist‘𝑔)(𝑎‘𝑗)) = ((𝑏‘𝑖)(dist‘𝑔)(𝑏‘𝑗))) ↔ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)))))
18	9, 17	anbi12d 631	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (((𝑎 ∈ ((Base‘𝑔) ↑_pm ℝ) ∧ 𝑏 ∈ ((Base‘𝑔) ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖)(dist‘𝑔)(𝑎‘𝑗)) = ((𝑏‘𝑖)(dist‘𝑔)(𝑏‘𝑗)))) ↔ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))))
19	18	opabbidv 5214	. . . . . 6 ⊢ (𝑔 = 𝐺 → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ((Base‘𝑔) ↑_pm ℝ) ∧ 𝑏 ∈ ((Base‘𝑔) ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖)(dist‘𝑔)(𝑎‘𝑗)) = ((𝑏‘𝑖)(dist‘𝑔)(𝑏‘𝑗))))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))})
20		df-cgrg 28017	. . . . . 6 ⊢ cgrG = (𝑔 ∈ V ↦ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ((Base‘𝑔) ↑_pm ℝ) ∧ 𝑏 ∈ ((Base‘𝑔) ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖)(dist‘𝑔)(𝑎‘𝑗)) = ((𝑏‘𝑖)(dist‘𝑔)(𝑏‘𝑗))))})
21		df-xp 5682	. . . . . . . 8 ⊢ ((𝑃 ↑_pm ℝ) × (𝑃 ↑_pm ℝ)) = {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ))}
22		ovex 7444	. . . . . . . . 9 ⊢ (𝑃 ↑_pm ℝ) ∈ V
23	22, 22	xpex 7742	. . . . . . . 8 ⊢ ((𝑃 ↑_pm ℝ) × (𝑃 ↑_pm ℝ)) ∈ V
24	21, 23	eqeltrri 2830	. . . . . . 7 ⊢ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ))} ∈ V
25		simpl 483	. . . . . . . 8 ⊢ (((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)))) → (𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)))
26	25	ssopab2i 5550	. . . . . . 7 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))} ⊆ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ))}
27	24, 26	ssexi 5322	. . . . . 6 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))} ∈ V
28	19, 20, 27	fvmpt 6998	. . . . 5 ⊢ (𝐺 ∈ V → (cgrG‘𝐺) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))})
29	2, 28	syl 17	. . . 4 ⊢ (𝐺 ∈ 𝑉 → (cgrG‘𝐺) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))})
30	1, 29	eqtrid 2784	. . 3 ⊢ (𝐺 ∈ 𝑉 → ∼ = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))})
31	30	breqd 5159	. 2 ⊢ (𝐺 ∈ 𝑉 → (𝐴 ∼ 𝐵 ↔ 𝐴{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))}𝐵))
32		dmeq 5903	. . . . . 6 ⊢ (𝑎 = 𝐴 → dom 𝑎 = dom 𝐴)
33	32	eqeq1d 2734	. . . . 5 ⊢ (𝑎 = 𝐴 → (dom 𝑎 = dom 𝑏 ↔ dom 𝐴 = dom 𝑏))
34	32	adantr 481	. . . . . . 7 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 ∈ dom 𝑎) → dom 𝑎 = dom 𝐴)
35		simpll 765	. . . . . . . . . 10 ⊢ (((𝑎 = 𝐴 ∧ 𝑖 ∈ dom 𝑎) ∧ 𝑗 ∈ dom 𝑎) → 𝑎 = 𝐴)
36	35	fveq1d 6893	. . . . . . . . 9 ⊢ (((𝑎 = 𝐴 ∧ 𝑖 ∈ dom 𝑎) ∧ 𝑗 ∈ dom 𝑎) → (𝑎‘𝑖) = (𝐴‘𝑖))
37	35	fveq1d 6893	. . . . . . . . 9 ⊢ (((𝑎 = 𝐴 ∧ 𝑖 ∈ dom 𝑎) ∧ 𝑗 ∈ dom 𝑎) → (𝑎‘𝑗) = (𝐴‘𝑗))
38	36, 37	oveq12d 7429	. . . . . . . 8 ⊢ (((𝑎 = 𝐴 ∧ 𝑖 ∈ dom 𝑎) ∧ 𝑗 ∈ dom 𝑎) → ((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝐴‘𝑖) − (𝐴‘𝑗)))
39	38	eqeq1d 2734	. . . . . . 7 ⊢ (((𝑎 = 𝐴 ∧ 𝑖 ∈ dom 𝑎) ∧ 𝑗 ∈ dom 𝑎) → (((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)) ↔ ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))
40	34, 39	raleqbidva 3327	. . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑖 ∈ dom 𝑎) → (∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)) ↔ ∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))
41	32, 40	raleqbidva 3327	. . . . 5 ⊢ (𝑎 = 𝐴 → (∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)) ↔ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))
42	33, 41	anbi12d 631	. . . 4 ⊢ (𝑎 = 𝐴 → ((dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))) ↔ (dom 𝐴 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)))))
43		dmeq 5903	. . . . . 6 ⊢ (𝑏 = 𝐵 → dom 𝑏 = dom 𝐵)
44	43	eqeq2d 2743	. . . . 5 ⊢ (𝑏 = 𝐵 → (dom 𝐴 = dom 𝑏 ↔ dom 𝐴 = dom 𝐵))
45		fveq1 6890	. . . . . . . 8 ⊢ (𝑏 = 𝐵 → (𝑏‘𝑖) = (𝐵‘𝑖))
46		fveq1 6890	. . . . . . . 8 ⊢ (𝑏 = 𝐵 → (𝑏‘𝑗) = (𝐵‘𝑗))
47	45, 46	oveq12d 7429	. . . . . . 7 ⊢ (𝑏 = 𝐵 → ((𝑏‘𝑖) − (𝑏‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
48	47	eqeq2d 2743	. . . . . 6 ⊢ (𝑏 = 𝐵 → (((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)) ↔ ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))
49	48	2ralbidv 3218	. . . . 5 ⊢ (𝑏 = 𝐵 → (∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗)) ↔ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))
50	44, 49	anbi12d 631	. . . 4 ⊢ (𝑏 = 𝐵 → ((dom 𝐴 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))) ↔ (dom 𝐴 = dom 𝐵 ∧ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))
51	42, 50	sylan9bb 510	. . 3 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))) ↔ (dom 𝐴 = dom 𝐵 ∧ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))
52		eqid 2732	. . 3 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))}
53	51, 52	brab2a 5769	. 2 ⊢ (𝐴{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ↑_pm ℝ) ∧ 𝑏 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝑎 = dom 𝑏 ∧ ∀𝑖 ∈ dom 𝑎∀𝑗 ∈ dom 𝑎((𝑎‘𝑖) − (𝑎‘𝑗)) = ((𝑏‘𝑖) − (𝑏‘𝑗))))}𝐵 ↔ ((𝐴 ∈ (𝑃 ↑_pm ℝ) ∧ 𝐵 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝐴 = dom 𝐵 ∧ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))
54	31, 53	bitrdi 286	1 ⊢ (𝐺 ∈ 𝑉 → (𝐴 ∼ 𝐵 ↔ ((𝐴 ∈ (𝑃 ↑_pm ℝ) ∧ 𝐵 ∈ (𝑃 ↑_pm ℝ)) ∧ (dom 𝐴 = dom 𝐵 ∧ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 Vcvv 3474 class class class wbr 5148 {copab 5210 × cxp 5674 dom cdm 5676 ‘cfv 6543 (class class class)co 7411 ↑_pm cpm 8823 ℝcr 11111 Basecbs 17148 distcds 17210 cgrGccgrg 28016

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-iota 6495 df-fun 6545 df-fv 6551 df-ov 7414 df-cgrg 28017

This theorem is referenced by: iscgrgd 28019 ercgrg 28023

W3C validator