Theorem zfz1iso 11023

Description: A finite set of integers has an order isomorphism to a one-based finite sequence. (Contributed by Jim Kingdon, 3-Sep-2022.)

Assertion

Ref	Expression
zfz1iso	⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))

Distinct variable group:   𝐴,𝑓

Proof of Theorem zfz1iso

Dummy variables 𝑛 𝑥 𝑎 𝑘 𝑚 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isfi 6875	. . . 4 ⊢ (𝐴 ∈ Fin ↔ ∃𝑛 ∈ ω 𝐴 ≈ 𝑛)
2	1	biimpi 120	. . 3 ⊢ (𝐴 ∈ Fin → ∃𝑛 ∈ ω 𝐴 ≈ 𝑛)
3	2	adantl 277	. 2 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) → ∃𝑛 ∈ ω 𝐴 ≈ 𝑛)
4		simprlr 538	. . . 4 ⊢ ((𝑛 ∈ ω ∧ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)) → 𝐴 ∈ Fin)
5		breq2 4063	. . . . . . . . 9 ⊢ (𝑤 = ∅ → (𝑥 ≈ 𝑤 ↔ 𝑥 ≈ ∅))
6	5	anbi2d 464	. . . . . . . 8 ⊢ (𝑤 = ∅ → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅)))
7	6	imbi1d 231	. . . . . . 7 ⊢ (𝑤 = ∅ → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
8	7	albidv 1848	. . . . . 6 ⊢ (𝑤 = ∅ → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
9		breq2 4063	. . . . . . . . 9 ⊢ (𝑤 = 𝑘 → (𝑥 ≈ 𝑤 ↔ 𝑥 ≈ 𝑘))
10	9	anbi2d 464	. . . . . . . 8 ⊢ (𝑤 = 𝑘 → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘)))
11	10	imbi1d 231	. . . . . . 7 ⊢ (𝑤 = 𝑘 → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
12	11	albidv 1848	. . . . . 6 ⊢ (𝑤 = 𝑘 → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
13		breq2 4063	. . . . . . . . 9 ⊢ (𝑤 = suc 𝑘 → (𝑥 ≈ 𝑤 ↔ 𝑥 ≈ suc 𝑘))
14	13	anbi2d 464	. . . . . . . 8 ⊢ (𝑤 = suc 𝑘 → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)))
15	14	imbi1d 231	. . . . . . 7 ⊢ (𝑤 = suc 𝑘 → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
16	15	albidv 1848	. . . . . 6 ⊢ (𝑤 = suc 𝑘 → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
17		breq2 4063	. . . . . . . . 9 ⊢ (𝑤 = 𝑛 → (𝑥 ≈ 𝑤 ↔ 𝑥 ≈ 𝑛))
18	17	anbi2d 464	. . . . . . . 8 ⊢ (𝑤 = 𝑛 → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛)))
19	18	imbi1d 231	. . . . . . 7 ⊢ (𝑤 = 𝑛 → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
20	19	albidv 1848	. . . . . 6 ⊢ (𝑤 = 𝑛 → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
21		iso0 5909	. . . . . . . . . 10 ⊢ ∅ Isom < , < (∅, ∅)
22		en0 6910	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ≈ ∅ ↔ 𝑥 = ∅)
23	22	biimpi 120	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ≈ ∅ → 𝑥 = ∅)
24	23	fveq2d 5603	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ≈ ∅ → (♯‘𝑥) = (♯‘∅))
25		hash0 10978	. . . . . . . . . . . . . . 15 ⊢ (♯‘∅) = 0
26	24, 25	eqtrdi 2256	. . . . . . . . . . . . . 14 ⊢ (𝑥 ≈ ∅ → (♯‘𝑥) = 0)
27	26	oveq2d 5983	. . . . . . . . . . . . 13 ⊢ (𝑥 ≈ ∅ → (1...(♯‘𝑥)) = (1...0))
28		fz10 10203	. . . . . . . . . . . . 13 ⊢ (1...0) = ∅
29	27, 28	eqtrdi 2256	. . . . . . . . . . . 12 ⊢ (𝑥 ≈ ∅ → (1...(♯‘𝑥)) = ∅)
30		isoeq4 5896	. . . . . . . . . . . 12 ⊢ ((1...(♯‘𝑥)) = ∅ → (∅ Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∅ Isom < , < (∅, 𝑥)))
31	29, 30	syl 14	. . . . . . . . . . 11 ⊢ (𝑥 ≈ ∅ → (∅ Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∅ Isom < , < (∅, 𝑥)))
32		isoeq5 5897	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → (∅ Isom < , < (∅, 𝑥) ↔ ∅ Isom < , < (∅, ∅)))
33	23, 32	syl 14	. . . . . . . . . . 11 ⊢ (𝑥 ≈ ∅ → (∅ Isom < , < (∅, 𝑥) ↔ ∅ Isom < , < (∅, ∅)))
34	31, 33	bitrd 188	. . . . . . . . . 10 ⊢ (𝑥 ≈ ∅ → (∅ Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∅ Isom < , < (∅, ∅)))
35	21, 34	mpbiri 168	. . . . . . . . 9 ⊢ (𝑥 ≈ ∅ → ∅ Isom < , < ((1...(♯‘𝑥)), 𝑥))
36		0ex 4187	. . . . . . . . . 10 ⊢ ∅ ∈ V
37		isoeq1 5893	. . . . . . . . . 10 ⊢ (𝑓 = ∅ → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∅ Isom < , < ((1...(♯‘𝑥)), 𝑥)))
38	36, 37	spcev 2875	. . . . . . . . 9 ⊢ (∅ Isom < , < ((1...(♯‘𝑥)), 𝑥) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
39	35, 38	syl 14	. . . . . . . 8 ⊢ (𝑥 ≈ ∅ → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
40	39	adantl 277	. . . . . . 7 ⊢ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
41	40	ax-gen 1473	. . . . . 6 ⊢ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
42		sseq1 3224	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑎 ⊆ ℤ ↔ 𝑥 ⊆ ℤ))
43		eleq1 2270	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑎 ∈ Fin ↔ 𝑥 ∈ Fin))
44	42, 43	anbi12d 473	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → ((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ↔ (𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin)))
45		breq1 4062	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑎 ≈ 𝑘 ↔ 𝑥 ≈ 𝑘))
46	44, 45	anbi12d 473	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → (((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘)))
47		fveq2 5599	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (♯‘𝑎) = (♯‘𝑥))
48	47	oveq2d 5983	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → (1...(♯‘𝑎)) = (1...(♯‘𝑥)))
49		isoeq4 5896	. . . . . . . . . . . 12 ⊢ ((1...(♯‘𝑎)) = (1...(♯‘𝑥)) → (𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎) ↔ 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑎)))
50	48, 49	syl 14	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎) ↔ 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑎)))
51		isoeq5 5897	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑎) ↔ 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
52	50, 51	bitrd 188	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎) ↔ 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
53	52	exbidv 1849	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → (∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎) ↔ ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
54	46, 53	imbi12d 234	. . . . . . . 8 ⊢ (𝑎 = 𝑥 → ((((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
55	54	cbvalv 1942	. . . . . . 7 ⊢ (∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
56		simprll 537	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → 𝑥 ⊆ ℤ)
57		zssq 9783	. . . . . . . . . . . . 13 ⊢ ℤ ⊆ ℚ
58	56, 57	sstrdi 3213	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → 𝑥 ⊆ ℚ)
59		simprlr 538	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → 𝑥 ∈ Fin)
60		vex 2779	. . . . . . . . . . . . . . . 16 ⊢ 𝑘 ∈ V
61		nsuceq0g 4483	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ V → suc 𝑘 ≠ ∅)
62	60, 61	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ suc 𝑘 ≠ ∅
63	62	neii 2380	. . . . . . . . . . . . . 14 ⊢ ¬ suc 𝑘 = ∅
64		simplrr 536	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → 𝑥 ≈ suc 𝑘)
65	64	ensymd 6898	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → suc 𝑘 ≈ 𝑥)
66		simpr 110	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → 𝑥 = ∅)
67	65, 66	breqtrd 4085	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → suc 𝑘 ≈ ∅)
68		en0 6910	. . . . . . . . . . . . . . . 16 ⊢ (suc 𝑘 ≈ ∅ ↔ suc 𝑘 = ∅)
69	67, 68	sylib 122	. . . . . . . . . . . . . . 15 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → suc 𝑘 = ∅)
70	69	ex 115	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → (𝑥 = ∅ → suc 𝑘 = ∅))
71	63, 70	mtoi 666	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → ¬ 𝑥 = ∅)
72	71	neqned 2385	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → 𝑥 ≠ ∅)
73		fimaxq 11009	. . . . . . . . . . . 12 ⊢ ((𝑥 ⊆ ℚ ∧ 𝑥 ∈ Fin ∧ 𝑥 ≠ ∅) → ∃𝑚 ∈ 𝑥 ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)
74	58, 59, 72, 73	syl3anc 1250	. . . . . . . . . . 11 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → ∃𝑚 ∈ 𝑥 ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)
75		simplll 533	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → 𝑘 ∈ ω)
76		simpllr 534	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎)))
77	56	adantr 276	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → 𝑥 ⊆ ℤ)
78	59	adantr 276	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → 𝑥 ∈ Fin)
79		simplrr 536	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → 𝑥 ≈ suc 𝑘)
80		simprl 529	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → 𝑚 ∈ 𝑥)
81		simprr 531	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)
82	75, 76, 77, 78, 79, 80, 81	zfz1isolem1 11022	. . . . . . . . . . 11 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
83	74, 82	rexlimddv 2630	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
84	83	ex 115	. . . . . . . . 9 ⊢ ((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
85	84	alrimiv 1898	. . . . . . . 8 ⊢ ((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) → ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
86	85	ex 115	. . . . . . 7 ⊢ (𝑘 ∈ ω → (∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎)) → ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
87	55, 86	biimtrrid 153	. . . . . 6 ⊢ (𝑘 ∈ ω → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) → ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
88	8, 12, 16, 20, 41, 87	finds 4666	. . . . 5 ⊢ (𝑛 ∈ ω → ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
89	88	adantr 276	. . . 4 ⊢ ((𝑛 ∈ ω ∧ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)) → ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
90		simpr 110	. . . 4 ⊢ ((𝑛 ∈ ω ∧ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)) → ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛))
91		sseq1 3224	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ ℤ ↔ 𝐴 ⊆ ℤ))
92		eleq1 2270	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ Fin ↔ 𝐴 ∈ Fin))
93	91, 92	anbi12d 473	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ↔ (𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin)))
94		breq1 4062	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝑛 ↔ 𝐴 ≈ 𝑛))
95	93, 94	anbi12d 473	. . . . . 6 ⊢ (𝑥 = 𝐴 → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) ↔ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)))
96		fveq2 5599	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (♯‘𝑥) = (♯‘𝐴))
97	96	oveq2d 5983	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (1...(♯‘𝑥)) = (1...(♯‘𝐴)))
98		isoeq4 5896	. . . . . . . . 9 ⊢ ((1...(♯‘𝑥)) = (1...(♯‘𝐴)) → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝑥)))
99	97, 98	syl 14	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝑥)))
100		isoeq5 5897	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑓 Isom < , < ((1...(♯‘𝐴)), 𝑥) ↔ 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴)))
101	99, 100	bitrd 188	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴)))
102	101	exbidv 1849	. . . . . 6 ⊢ (𝑥 = 𝐴 → (∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴)))
103	95, 102	imbi12d 234	. . . . 5 ⊢ (𝑥 = 𝐴 → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))))
104	103	spcgv 2867	. . . 4 ⊢ (𝐴 ∈ Fin → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) → (((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))))
105	4, 89, 90, 104	syl3c 63	. . 3 ⊢ ((𝑛 ∈ ω ∧ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))
106	105	an12s 565	. 2 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))
107	3, 106	rexlimddv 2630	1 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1371   = wceq 1373  ∃wex 1516   ∈ wcel 2178   ≠ wne 2378  ∀wral 2486  ∃wrex 2487  Vcvv 2776   ⊆ wss 3174  ∅c0 3468   class class class wbr 4059  suc csuc 4430  ωcom 4656  ‘cfv 5290   Isom wiso 5291  (class class class)co 5967   ≈ cen 6848  Fincfn 6850  0cc0 7960  1c1 7961   < clt 8142   ≤ cle 8143  ℤcz 9407  ℚcq 9775  ...cfz 10165  ♯chash 10957

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076  ax-pre-mulgt0 8077  ax-pre-mulext 8078

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-if 3580  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-po 4361  df-iso 4362  df-iord 4431  df-on 4433  df-ilim 4434  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-isom 5299  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-irdg 6479  df-frec 6500  df-1o 6525  df-oadd 6529  df-er 6643  df-en 6851  df-dom 6852  df-fin 6853  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-reap 8683  df-ap 8690  df-div 8781  df-inn 9072  df-n0 9331  df-z 9408  df-uz 9684  df-q 9776  df-rp 9811  df-fz 10166  df-ihash 10958

This theorem is referenced by:  summodclem2  11808  zsumdc  11810  prodmodclem2  12003  zproddc  12005