iscgrglt - Metamath Proof Explorer

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

Theorem iscgrglt 28749

Description: The property for two sequences 𝐴 and 𝐵 of points to be congruent, where the congruence is only required for indices verifying a less-than relation. (Contributed by Thierry Arnoux, 7-Oct-2020.)

**Hypotheses**
Ref	Expression
trgcgrg.p	⊢ 𝑃 = (Base‘𝐺)
trgcgrg.m	⊢ − = (dist‘𝐺)
trgcgrg.r	⊢ ∼ = (cgrG‘𝐺)
trgcgrg.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
iscgrglt.d	⊢ (𝜑 → 𝐷 ⊆ ℝ)
iscgrglt.a	⊢ (𝜑 → 𝐴:𝐷⟶𝑃)
iscgrglt.b	⊢ (𝜑 → 𝐵:𝐷⟶𝑃)

**Assertion**
Ref	Expression
iscgrglt	⊢ (𝜑 → (𝐴 ∼ 𝐵 ↔ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴(𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))

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

Proof of Theorem iscgrglt Dummy variables 𝑘 𝑙 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		trgcgrg.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		trgcgrg.m	. . 3 ⊢ − = (dist‘𝐺)
3		trgcgrg.r	. . 3 ⊢ ∼ = (cgrG‘𝐺)
4		trgcgrg.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5		iscgrglt.d	. . 3 ⊢ (𝜑 → 𝐷 ⊆ ℝ)
6		iscgrglt.a	. . 3 ⊢ (𝜑 → 𝐴:𝐷⟶𝑃)
7		iscgrglt.b	. . 3 ⊢ (𝜑 → 𝐵:𝐷⟶𝑃)
8	1, 2, 3, 4, 5, 6, 7	iscgrgd 28748	. 2 ⊢ (𝜑 → (𝐴 ∼ 𝐵 ↔ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))
9		simp2 1153	. . . . 5 ⊢ (((𝜑 ∧ (𝑖 ∈ dom 𝐴 ∧ 𝑗 ∈ dom 𝐴)) ∧ ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)) ∧ 𝑖 < 𝑗) → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
10	9	3exp 1135	. . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ dom 𝐴 ∧ 𝑗 ∈ dom 𝐴)) → (((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)) → (𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))
11	10	ralimdvva 3218	. . 3 ⊢ (𝜑 → (∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)) → ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴(𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))
12		breq1 5116	. . . . . 6 ⊢ (𝑘 = 𝑖 → (𝑘 < 𝑙 ↔ 𝑖 < 𝑙))
13		fveq2 6882	. . . . . . . 8 ⊢ (𝑘 = 𝑖 → (𝐴‘𝑘) = (𝐴‘𝑖))
14	13	oveq1d 7426	. . . . . . 7 ⊢ (𝑘 = 𝑖 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐴‘𝑖) − (𝐴‘𝑙)))
15		fveq2 6882	. . . . . . . 8 ⊢ (𝑘 = 𝑖 → (𝐵‘𝑘) = (𝐵‘𝑖))
16	15	oveq1d 7426	. . . . . . 7 ⊢ (𝑘 = 𝑖 → ((𝐵‘𝑘) − (𝐵‘𝑙)) = ((𝐵‘𝑖) − (𝐵‘𝑙)))
17	14, 16	eqeq12d 2785	. . . . . 6 ⊢ (𝑘 = 𝑖 → (((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)) ↔ ((𝐴‘𝑖) − (𝐴‘𝑙)) = ((𝐵‘𝑖) − (𝐵‘𝑙))))
18	12, 17	imbi12d 347	. . . . 5 ⊢ (𝑘 = 𝑖 → ((𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙))) ↔ (𝑖 < 𝑙 → ((𝐴‘𝑖) − (𝐴‘𝑙)) = ((𝐵‘𝑖) − (𝐵‘𝑙)))))
19		breq2 5117	. . . . . 6 ⊢ (𝑙 = 𝑗 → (𝑖 < 𝑙 ↔ 𝑖 < 𝑗))
20		fveq2 6882	. . . . . . . 8 ⊢ (𝑙 = 𝑗 → (𝐴‘𝑙) = (𝐴‘𝑗))
21	20	oveq2d 7427	. . . . . . 7 ⊢ (𝑙 = 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑙)) = ((𝐴‘𝑖) − (𝐴‘𝑗)))
22		fveq2 6882	. . . . . . . 8 ⊢ (𝑙 = 𝑗 → (𝐵‘𝑙) = (𝐵‘𝑗))
23	22	oveq2d 7427	. . . . . . 7 ⊢ (𝑙 = 𝑗 → ((𝐵‘𝑖) − (𝐵‘𝑙)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
24	21, 23	eqeq12d 2785	. . . . . 6 ⊢ (𝑙 = 𝑗 → (((𝐴‘𝑖) − (𝐴‘𝑙)) = ((𝐵‘𝑖) − (𝐵‘𝑙)) ↔ ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))
25	19, 24	imbi12d 347	. . . . 5 ⊢ (𝑙 = 𝑗 → ((𝑖 < 𝑙 → ((𝐴‘𝑖) − (𝐴‘𝑙)) = ((𝐵‘𝑖) − (𝐵‘𝑙))) ↔ (𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))
26	18, 25	cbvral2vw 3253	. . . 4 ⊢ (∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙))) ↔ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴(𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))
27		simpllr 787	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 < 𝑗) → 𝑖 ∈ dom 𝐴)
28		simplr 780	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 < 𝑗) → 𝑗 ∈ dom 𝐴)
29		simp-4r 795	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 < 𝑗) → ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙))))
30	27, 28, 29	jca31 523	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 < 𝑗) → ((𝑖 ∈ dom 𝐴 ∧ 𝑗 ∈ dom 𝐴) ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))))
31		simpr 489	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 < 𝑗) → 𝑖 < 𝑗)
32	18, 25	rspc2va 3602	. . . . . . . . 9 ⊢ (((𝑖 ∈ dom 𝐴 ∧ 𝑗 ∈ dom 𝐴) ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) → (𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))
33	30, 31, 32	sylc 66	. . . . . . . 8 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 < 𝑗) → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
34		eqid 2769	. . . . . . . . . . 11 ⊢ (Itv‘𝐺) = (Itv‘𝐺)
35	4	ad3antrrr 742	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → 𝐺 ∈ TarskiG)
36	6	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝐴:𝐷⟶𝑃)
37		simplr 780	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝑖 ∈ dom 𝐴)
38	36	fdmd 6717	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → dom 𝐴 = 𝐷)
39	37, 38	eleqtrd 2871	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝑖 ∈ 𝐷)
40	36, 39	ffvelcdmd 7081	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → (𝐴‘𝑖) ∈ 𝑃)
41	40	adantr 485	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → (𝐴‘𝑖) ∈ 𝑃)
42	7	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝐵:𝐷⟶𝑃)
43	42, 39	ffvelcdmd 7081	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → (𝐵‘𝑖) ∈ 𝑃)
44	43	adantr 485	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → (𝐵‘𝑖) ∈ 𝑃)
45	1, 2, 34, 35, 41, 44	tgcgrtriv 28719	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → ((𝐴‘𝑖) − (𝐴‘𝑖)) = ((𝐵‘𝑖) − (𝐵‘𝑖)))
46		simpr 489	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → 𝑖 = 𝑗)
47	46	fveq2d 6886	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → (𝐴‘𝑖) = (𝐴‘𝑗))
48	47	oveq2d 7427	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → ((𝐴‘𝑖) − (𝐴‘𝑖)) = ((𝐴‘𝑖) − (𝐴‘𝑗)))
49	46	fveq2d 6886	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → (𝐵‘𝑖) = (𝐵‘𝑗))
50	49	oveq2d 7427	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → ((𝐵‘𝑖) − (𝐵‘𝑖)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
51	45, 48, 50	3eqtr3d 2812	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
52	51	adantl3r 762	. . . . . . . 8 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑖 = 𝑗) → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
53	4	ad4antr 744	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → 𝐺 ∈ TarskiG)
54		simpr 489	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝑗 ∈ dom 𝐴)
55	54, 38	eleqtrd 2871	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝑗 ∈ 𝐷)
56	36, 55	ffvelcdmd 7081	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → (𝐴‘𝑗) ∈ 𝑃)
57	56	adantr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → (𝐴‘𝑗) ∈ 𝑃)
58	57	adantl3r 762	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → (𝐴‘𝑗) ∈ 𝑃)
59	40	adantr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → (𝐴‘𝑖) ∈ 𝑃)
60	59	adantl3r 762	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → (𝐴‘𝑖) ∈ 𝑃)
61	42, 55	ffvelcdmd 7081	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → (𝐵‘𝑗) ∈ 𝑃)
62	61	adantr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → (𝐵‘𝑗) ∈ 𝑃)
63	62	adantl3r 762	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → (𝐵‘𝑗) ∈ 𝑃)
64	43	adantr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → (𝐵‘𝑖) ∈ 𝑃)
65	64	adantl3r 762	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → (𝐵‘𝑖) ∈ 𝑃)
66		simplr 780	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → 𝑗 ∈ dom 𝐴)
67		simpllr 787	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → 𝑖 ∈ dom 𝐴)
68		simp-4r 795	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙))))
69	66, 67, 68	jca31 523	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → ((𝑗 ∈ dom 𝐴 ∧ 𝑖 ∈ dom 𝐴) ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))))
70		simpr 489	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → 𝑗 < 𝑖)
71		breq1 5116	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑗 → (𝑘 < 𝑙 ↔ 𝑗 < 𝑙))
72		fveq2 6882	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑗 → (𝐴‘𝑘) = (𝐴‘𝑗))
73	72	oveq1d 7426	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑗 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐴‘𝑗) − (𝐴‘𝑙)))
74		fveq2 6882	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑗 → (𝐵‘𝑘) = (𝐵‘𝑗))
75	74	oveq1d 7426	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑗 → ((𝐵‘𝑘) − (𝐵‘𝑙)) = ((𝐵‘𝑗) − (𝐵‘𝑙)))
76	73, 75	eqeq12d 2785	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑗 → (((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)) ↔ ((𝐴‘𝑗) − (𝐴‘𝑙)) = ((𝐵‘𝑗) − (𝐵‘𝑙))))
77	71, 76	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑗 → ((𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙))) ↔ (𝑗 < 𝑙 → ((𝐴‘𝑗) − (𝐴‘𝑙)) = ((𝐵‘𝑗) − (𝐵‘𝑙)))))
78		breq2 5117	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑖 → (𝑗 < 𝑙 ↔ 𝑗 < 𝑖))
79		fveq2 6882	. . . . . . . . . . . . . 14 ⊢ (𝑙 = 𝑖 → (𝐴‘𝑙) = (𝐴‘𝑖))
80	79	oveq2d 7427	. . . . . . . . . . . . 13 ⊢ (𝑙 = 𝑖 → ((𝐴‘𝑗) − (𝐴‘𝑙)) = ((𝐴‘𝑗) − (𝐴‘𝑖)))
81		fveq2 6882	. . . . . . . . . . . . . 14 ⊢ (𝑙 = 𝑖 → (𝐵‘𝑙) = (𝐵‘𝑖))
82	81	oveq2d 7427	. . . . . . . . . . . . 13 ⊢ (𝑙 = 𝑖 → ((𝐵‘𝑗) − (𝐵‘𝑙)) = ((𝐵‘𝑗) − (𝐵‘𝑖)))
83	80, 82	eqeq12d 2785	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑖 → (((𝐴‘𝑗) − (𝐴‘𝑙)) = ((𝐵‘𝑗) − (𝐵‘𝑙)) ↔ ((𝐴‘𝑗) − (𝐴‘𝑖)) = ((𝐵‘𝑗) − (𝐵‘𝑖))))
84	78, 83	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑙 = 𝑖 → ((𝑗 < 𝑙 → ((𝐴‘𝑗) − (𝐴‘𝑙)) = ((𝐵‘𝑗) − (𝐵‘𝑙))) ↔ (𝑗 < 𝑖 → ((𝐴‘𝑗) − (𝐴‘𝑖)) = ((𝐵‘𝑗) − (𝐵‘𝑖)))))
85	77, 84	rspc2va 3602	. . . . . . . . . 10 ⊢ (((𝑗 ∈ dom 𝐴 ∧ 𝑖 ∈ dom 𝐴) ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) → (𝑗 < 𝑖 → ((𝐴‘𝑗) − (𝐴‘𝑖)) = ((𝐵‘𝑗) − (𝐵‘𝑖))))
86	69, 70, 85	sylc 66	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → ((𝐴‘𝑗) − (𝐴‘𝑖)) = ((𝐵‘𝑗) − (𝐵‘𝑖)))
87	1, 2, 34, 53, 58, 60, 63, 65, 86	tgcgrcomlr 28715	. . . . . . . 8 ⊢ (((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) ∧ 𝑗 < 𝑖) → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
88	6	fdmd 6717	. . . . . . . . . . . 12 ⊢ (𝜑 → dom 𝐴 = 𝐷)
89	88, 5	eqsstrd 3979	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐴 ⊆ ℝ)
90	89	ad3antrrr 742	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → dom 𝐴 ⊆ ℝ)
91		simplr 780	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝑖 ∈ dom 𝐴)
92	90, 91	sseldd 3946	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝑖 ∈ ℝ)
93		simpr 489	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝑗 ∈ dom 𝐴)
94	90, 93	sseldd 3946	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → 𝑗 ∈ ℝ)
95	92, 94	lttri4d 11351	. . . . . . . 8 ⊢ ((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → (𝑖 < 𝑗 ∨ 𝑖 = 𝑗 ∨ 𝑗 < 𝑖))
96	33, 52, 87, 95	mpjao3dan 1457	. . . . . . 7 ⊢ ((((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ 𝑖 ∈ dom 𝐴) ∧ 𝑗 ∈ dom 𝐴) → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
97	96	anasss 471	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) ∧ (𝑖 ∈ dom 𝐴 ∧ 𝑗 ∈ dom 𝐴)) → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
98	97	ralrimivva 3214	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙)))) → ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))
99	98	ex 417	. . . 4 ⊢ (𝜑 → (∀𝑘 ∈ dom 𝐴∀𝑙 ∈ dom 𝐴(𝑘 < 𝑙 → ((𝐴‘𝑘) − (𝐴‘𝑙)) = ((𝐵‘𝑘) − (𝐵‘𝑙))) → ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))
100	26, 99	biimtrrid 246	. . 3 ⊢ (𝜑 → (∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴(𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))) → ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗))))
101	11, 100	impbid 215	. 2 ⊢ (𝜑 → (∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)) ↔ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴(𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))
102	8, 101	bitrd 282	1 ⊢ (𝜑 → (𝐴 ∼ 𝐵 ↔ ∀𝑖 ∈ dom 𝐴∀𝑗 ∈ dom 𝐴(𝑖 < 𝑗 → ((𝐴‘𝑖) − (𝐴‘𝑗)) = ((𝐵‘𝑖) − (𝐵‘𝑗)))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ⊆ wss 3913 class class class wbr 5113 dom cdm 5662 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ℝcr 11099 < clt 11243 Basecbs 17269 distcds 17319 TarskiGcstrkg 28662 Itvcitv 28668 cgrGccgrg 28745

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-pre-lttri 11174 ax-pre-lttrn 11175

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-po 5570 df-so 5571 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-er 8694 df-pm 8827 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-ltxr 11248 df-trkgc 28683 df-trkgcb 28685 df-trkg 28688 df-cgrg 28746

This theorem is referenced by: tgcgr4 28766

W3C validator