Theorem fzopth 10130

Description: A finite set of sequential integers can represent an ordered pair. (Contributed by NM, 31-Oct-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)

Assertion

Ref	Expression
fzopth	⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑀...𝑁) = (𝐽...𝐾) ↔ (𝑀 = 𝐽 ∧ 𝑁 = 𝐾)))

Proof of Theorem fzopth

Step	Hyp	Ref	Expression
1		eluzfz1 10100	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
2	1	adantr 276	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝑀 ∈ (𝑀...𝑁))
3		simpr 110	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → (𝑀...𝑁) = (𝐽...𝐾))
4	2, 3	eleqtrd 2272	. . . . . . 7 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝑀 ∈ (𝐽...𝐾))
5		elfzuz 10090	. . . . . . 7 ⊢ (𝑀 ∈ (𝐽...𝐾) → 𝑀 ∈ (ℤ≥‘𝐽))
6		uzss 9616	. . . . . . 7 ⊢ (𝑀 ∈ (ℤ≥‘𝐽) → (ℤ≥‘𝑀) ⊆ (ℤ≥‘𝐽))
7	4, 5, 6	3syl 17	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → (ℤ≥‘𝑀) ⊆ (ℤ≥‘𝐽))
8		elfzuz2 10098	. . . . . . . . 9 ⊢ (𝑀 ∈ (𝐽...𝐾) → 𝐾 ∈ (ℤ≥‘𝐽))
9		eluzfz1 10100	. . . . . . . . 9 ⊢ (𝐾 ∈ (ℤ≥‘𝐽) → 𝐽 ∈ (𝐽...𝐾))
10	4, 8, 9	3syl 17	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝐽 ∈ (𝐽...𝐾))
11	10, 3	eleqtrrd 2273	. . . . . . 7 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝐽 ∈ (𝑀...𝑁))
12		elfzuz 10090	. . . . . . 7 ⊢ (𝐽 ∈ (𝑀...𝑁) → 𝐽 ∈ (ℤ≥‘𝑀))
13		uzss 9616	. . . . . . 7 ⊢ (𝐽 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝐽) ⊆ (ℤ≥‘𝑀))
14	11, 12, 13	3syl 17	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → (ℤ≥‘𝐽) ⊆ (ℤ≥‘𝑀))
15	7, 14	eqssd 3197	. . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → (ℤ≥‘𝑀) = (ℤ≥‘𝐽))
16		eluzel2 9600	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ)
17	16	adantr 276	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝑀 ∈ ℤ)
18		uz11 9618	. . . . . 6 ⊢ (𝑀 ∈ ℤ → ((ℤ≥‘𝑀) = (ℤ≥‘𝐽) ↔ 𝑀 = 𝐽))
19	17, 18	syl 14	. . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → ((ℤ≥‘𝑀) = (ℤ≥‘𝐽) ↔ 𝑀 = 𝐽))
20	15, 19	mpbid 147	. . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝑀 = 𝐽)
21		eluzfz2 10101	. . . . . . . . 9 ⊢ (𝐾 ∈ (ℤ≥‘𝐽) → 𝐾 ∈ (𝐽...𝐾))
22	4, 8, 21	3syl 17	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝐾 ∈ (𝐽...𝐾))
23	22, 3	eleqtrrd 2273	. . . . . . 7 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝐾 ∈ (𝑀...𝑁))
24		elfzuz3 10091	. . . . . . 7 ⊢ (𝐾 ∈ (𝑀...𝑁) → 𝑁 ∈ (ℤ≥‘𝐾))
25		uzss 9616	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝐾) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝐾))
26	23, 24, 25	3syl 17	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝐾))
27		eluzfz2 10101	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
28	27	adantr 276	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝑁 ∈ (𝑀...𝑁))
29	28, 3	eleqtrd 2272	. . . . . . 7 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝑁 ∈ (𝐽...𝐾))
30		elfzuz3 10091	. . . . . . 7 ⊢ (𝑁 ∈ (𝐽...𝐾) → 𝐾 ∈ (ℤ≥‘𝑁))
31		uzss 9616	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘𝑁) → (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑁))
32	29, 30, 31	3syl 17	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑁))
33	26, 32	eqssd 3197	. . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → (ℤ≥‘𝑁) = (ℤ≥‘𝐾))
34		eluzelz 9604	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ)
35	34	adantr 276	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝑁 ∈ ℤ)
36		uz11 9618	. . . . . 6 ⊢ (𝑁 ∈ ℤ → ((ℤ≥‘𝑁) = (ℤ≥‘𝐾) ↔ 𝑁 = 𝐾))
37	35, 36	syl 14	. . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → ((ℤ≥‘𝑁) = (ℤ≥‘𝐾) ↔ 𝑁 = 𝐾))
38	33, 37	mpbid 147	. . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → 𝑁 = 𝐾)
39	20, 38	jca 306	. . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑀...𝑁) = (𝐽...𝐾)) → (𝑀 = 𝐽 ∧ 𝑁 = 𝐾))
40	39	ex 115	. 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑀...𝑁) = (𝐽...𝐾) → (𝑀 = 𝐽 ∧ 𝑁 = 𝐾)))
41		oveq12 5928	. 2 ⊢ ((𝑀 = 𝐽 ∧ 𝑁 = 𝐾) → (𝑀...𝑁) = (𝐽...𝐾))
42	40, 41	impbid1 142	1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑀...𝑁) = (𝐽...𝐾) ↔ (𝑀 = 𝐽 ∧ 𝑁 = 𝐾)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2164   ⊆ wss 3154  ‘cfv 5255  (class class class)co 5919  ℤcz 9320  ℤ_≥cuz 9595  ...cfz 10077

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-apti 7989

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2987  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-neg 8195  df-z 9321  df-uz 9596  df-fz 10078

This theorem is referenced by:  fz0to4untppr  10193  2ffzeq  10210  gsumfzval  12977  gsumval2  12983