Theorem zfz1iso 11104

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 6933	. . . 4 ⊢ (𝐴 ∈ Fin ↔ ∃𝑛 ∈ ω 𝐴 ≈ 𝑛)
2	1	biimpi 120	. . 3 ⊢ (𝐴 ∈ Fin → ∃𝑛 ∈ ω 𝐴 ≈ 𝑛)
3	2	adantl 277	. 2 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) → ∃𝑛 ∈ ω 𝐴 ≈ 𝑛)
4		simprlr 540	. . . 4 ⊢ ((𝑛 ∈ ω ∧ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)) → 𝐴 ∈ Fin)
5		breq2 4092	. . . . . . . . 9 ⊢ (𝑤 = ∅ → (𝑥 ≈ 𝑤 ↔ 𝑥 ≈ ∅))
6	5	anbi2d 464	. . . . . . . 8 ⊢ (𝑤 = ∅ → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅)))
7	6	imbi1d 231	. . . . . . 7 ⊢ (𝑤 = ∅ → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
8	7	albidv 1872	. . . . . 6 ⊢ (𝑤 = ∅ → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
9		breq2 4092	. . . . . . . . 9 ⊢ (𝑤 = 𝑘 → (𝑥 ≈ 𝑤 ↔ 𝑥 ≈ 𝑘))
10	9	anbi2d 464	. . . . . . . 8 ⊢ (𝑤 = 𝑘 → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘)))
11	10	imbi1d 231	. . . . . . 7 ⊢ (𝑤 = 𝑘 → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
12	11	albidv 1872	. . . . . 6 ⊢ (𝑤 = 𝑘 → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
13		breq2 4092	. . . . . . . . 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 1872	. . . . . 6 ⊢ (𝑤 = suc 𝑘 → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
17		breq2 4092	. . . . . . . . 9 ⊢ (𝑤 = 𝑛 → (𝑥 ≈ 𝑤 ↔ 𝑥 ≈ 𝑛))
18	17	anbi2d 464	. . . . . . . 8 ⊢ (𝑤 = 𝑛 → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛)))
19	18	imbi1d 231	. . . . . . 7 ⊢ (𝑤 = 𝑛 → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
20	19	albidv 1872	. . . . . 6 ⊢ (𝑤 = 𝑛 → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑤) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
21		iso0 5957	. . . . . . . . . 10 ⊢ ∅ Isom < , < (∅, ∅)
22		en0 6968	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ≈ ∅ ↔ 𝑥 = ∅)
23	22	biimpi 120	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ≈ ∅ → 𝑥 = ∅)
24	23	fveq2d 5643	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ≈ ∅ → (♯‘𝑥) = (♯‘∅))
25		hash0 11057	. . . . . . . . . . . . . . 15 ⊢ (♯‘∅) = 0
26	24, 25	eqtrdi 2280	. . . . . . . . . . . . . 14 ⊢ (𝑥 ≈ ∅ → (♯‘𝑥) = 0)
27	26	oveq2d 6033	. . . . . . . . . . . . 13 ⊢ (𝑥 ≈ ∅ → (1...(♯‘𝑥)) = (1...0))
28		fz10 10280	. . . . . . . . . . . . 13 ⊢ (1...0) = ∅
29	27, 28	eqtrdi 2280	. . . . . . . . . . . 12 ⊢ (𝑥 ≈ ∅ → (1...(♯‘𝑥)) = ∅)
30		isoeq4 5944	. . . . . . . . . . . 12 ⊢ ((1...(♯‘𝑥)) = ∅ → (∅ Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∅ Isom < , < (∅, 𝑥)))
31	29, 30	syl 14	. . . . . . . . . . 11 ⊢ (𝑥 ≈ ∅ → (∅ Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∅ Isom < , < (∅, 𝑥)))
32		isoeq5 5945	. . . . . . . . . . . 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 4216	. . . . . . . . . 10 ⊢ ∅ ∈ V
37		isoeq1 5941	. . . . . . . . . 10 ⊢ (𝑓 = ∅ → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∅ Isom < , < ((1...(♯‘𝑥)), 𝑥)))
38	36, 37	spcev 2901	. . . . . . . . 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 1497	. . . . . 6 ⊢ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ ∅) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
42		sseq1 3250	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑎 ⊆ ℤ ↔ 𝑥 ⊆ ℤ))
43		eleq1 2294	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑎 ∈ Fin ↔ 𝑥 ∈ Fin))
44	42, 43	anbi12d 473	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → ((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ↔ (𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin)))
45		breq1 4091	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑎 ≈ 𝑘 ↔ 𝑥 ≈ 𝑘))
46	44, 45	anbi12d 473	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → (((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) ↔ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘)))
47		fveq2 5639	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (♯‘𝑎) = (♯‘𝑥))
48	47	oveq2d 6033	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → (1...(♯‘𝑎)) = (1...(♯‘𝑥)))
49		isoeq4 5944	. . . . . . . . . . . 12 ⊢ ((1...(♯‘𝑎)) = (1...(♯‘𝑥)) → (𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎) ↔ 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑎)))
50	48, 49	syl 14	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎) ↔ 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑎)))
51		isoeq5 5945	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑥 → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑎) ↔ 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
52	50, 51	bitrd 188	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎) ↔ 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
53	52	exbidv 1873	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → (∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎) ↔ ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
54	46, 53	imbi12d 234	. . . . . . . 8 ⊢ (𝑎 = 𝑥 → ((((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎)) ↔ (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))))
55	54	cbvalv 1966	. . . . . . 7 ⊢ (∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎)) ↔ ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
56		simprll 539	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → 𝑥 ⊆ ℤ)
57		zssq 9860	. . . . . . . . . . . . 13 ⊢ ℤ ⊆ ℚ
58	56, 57	sstrdi 3239	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → 𝑥 ⊆ ℚ)
59		simprlr 540	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → 𝑥 ∈ Fin)
60		vex 2805	. . . . . . . . . . . . . . . 16 ⊢ 𝑘 ∈ V
61		nsuceq0g 4515	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ V → suc 𝑘 ≠ ∅)
62	60, 61	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ suc 𝑘 ≠ ∅
63	62	neii 2404	. . . . . . . . . . . . . 14 ⊢ ¬ suc 𝑘 = ∅
64		simplrr 538	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → 𝑥 ≈ suc 𝑘)
65	64	ensymd 6956	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → suc 𝑘 ≈ 𝑥)
66		simpr 110	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → 𝑥 = ∅)
67	65, 66	breqtrd 4114	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ 𝑥 = ∅) → suc 𝑘 ≈ ∅)
68		en0 6968	. . . . . . . . . . . . . . . 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 670	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → ¬ 𝑥 = ∅)
72	71	neqned 2409	. . . . . . . . . . . 12 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → 𝑥 ≠ ∅)
73		fimaxq 11090	. . . . . . . . . . . 12 ⊢ ((𝑥 ⊆ ℚ ∧ 𝑥 ∈ Fin ∧ 𝑥 ≠ ∅) → ∃𝑚 ∈ 𝑥 ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)
74	58, 59, 72, 73	syl3anc 1273	. . . . . . . . . . 11 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → ∃𝑚 ∈ 𝑥 ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)
75		simplll 535	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → 𝑘 ∈ ω)
76		simpllr 536	. . . . . . . . . . . 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 538	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → 𝑥 ≈ suc 𝑘)
80		simprl 531	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → 𝑚 ∈ 𝑥)
81		simprr 533	. . . . . . . . . . . 12 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)
82	75, 76, 77, 78, 79, 80, 81	zfz1isolem1 11103	. . . . . . . . . . 11 ⊢ ((((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) ∧ (𝑚 ∈ 𝑥 ∧ ∀𝑧 ∈ 𝑥 𝑧 ≤ 𝑚)) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
83	74, 82	rexlimddv 2655	. . . . . . . . . 10 ⊢ (((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) ∧ ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘)) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥))
84	83	ex 115	. . . . . . . . 9 ⊢ ((𝑘 ∈ ω ∧ ∀𝑎(((𝑎 ⊆ ℤ ∧ 𝑎 ∈ Fin) ∧ 𝑎 ≈ 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑎)), 𝑎))) → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ suc 𝑘) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
85	84	alrimiv 1922	. . . . . . . 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 4698	. . . . 5 ⊢ (𝑛 ∈ ω → ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
89	88	adantr 276	. . . 4 ⊢ ((𝑛 ∈ ω ∧ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)) → ∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)))
90		simpr 110	. . . 4 ⊢ ((𝑛 ∈ ω ∧ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)) → ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛))
91		sseq1 3250	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ ℤ ↔ 𝐴 ⊆ ℤ))
92		eleq1 2294	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ Fin ↔ 𝐴 ∈ Fin))
93	91, 92	anbi12d 473	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ↔ (𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin)))
94		breq1 4091	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝑛 ↔ 𝐴 ≈ 𝑛))
95	93, 94	anbi12d 473	. . . . . 6 ⊢ (𝑥 = 𝐴 → (((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) ↔ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)))
96		fveq2 5639	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (♯‘𝑥) = (♯‘𝐴))
97	96	oveq2d 6033	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (1...(♯‘𝑥)) = (1...(♯‘𝐴)))
98		isoeq4 5944	. . . . . . . . 9 ⊢ ((1...(♯‘𝑥)) = (1...(♯‘𝐴)) → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝑥)))
99	97, 98	syl 14	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝑥)))
100		isoeq5 5945	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑓 Isom < , < ((1...(♯‘𝐴)), 𝑥) ↔ 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴)))
101	99, 100	bitrd 188	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴)))
102	101	exbidv 1873	. . . . . 6 ⊢ (𝑥 = 𝐴 → (∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥) ↔ ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴)))
103	95, 102	imbi12d 234	. . . . 5 ⊢ (𝑥 = 𝐴 → ((((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) ↔ (((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))))
104	103	spcgv 2893	. . . 4 ⊢ (𝐴 ∈ Fin → (∀𝑥(((𝑥 ⊆ ℤ ∧ 𝑥 ∈ Fin) ∧ 𝑥 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝑥)), 𝑥)) → (((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))))
105	4, 89, 90, 104	syl3c 63	. . 3 ⊢ ((𝑛 ∈ ω ∧ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ 𝐴 ≈ 𝑛)) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))
106	105	an12s 567	. 2 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))
107	3, 106	rexlimddv 2655	1 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ∈ Fin) → ∃𝑓 𝑓 Isom < , < ((1...(♯‘𝐴)), 𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1395   = wceq 1397  ∃wex 1540   ∈ wcel 2202   ≠ wne 2402  ∀wral 2510  ∃wrex 2511  Vcvv 2802   ⊆ wss 3200  ∅c0 3494   class class class wbr 4088  suc csuc 4462  ωcom 4688  ‘cfv 5326   Isom wiso 5327  (class class class)co 6017   ≈ cen 6906  Fincfn 6908  0cc0 8031  1c1 8032   < clt 8213   ≤ cle 8214  ℤcz 9478  ℚcq 9852  ...cfz 10242  ♯chash 11036

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-isom 5335  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-frec 6556  df-1o 6581  df-oadd 6585  df-er 6701  df-en 6909  df-dom 6910  df-fin 6911  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-q 9853  df-rp 9888  df-fz 10243  df-ihash 11037

This theorem is referenced by:  summodclem2  11942  zsumdc  11944  prodmodclem2  12137  zproddc  12139