Theorem eldioph2lem1 42753

Description: Lemma for eldioph2 42755. Construct necessary renaming function for one direction. (Contributed by Stefan O'Rear, 8-Oct-2014.)

Assertion

Ref	Expression
eldioph2lem1	⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ∃𝑑 ∈ (ℤ≥‘𝑁)∃𝑒 ∈ V (𝑒:(1...𝑑)–1-1-onto→𝐴 ∧ (𝑒 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))

Distinct variable groups:   𝐴,𝑑,𝑒   𝑁,𝑑,𝑒

Proof of Theorem eldioph2lem1

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nn0re 12393	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ)
2	1	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → 𝑁 ∈ ℝ)
3	2	recnd 11143	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → 𝑁 ∈ ℂ)
4		ax-1cn 11067	. . . . . . . 8 ⊢ 1 ∈ ℂ
5		addcom 11302	. . . . . . . 8 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑁 + 1) = (1 + 𝑁))
6	3, 4, 5	sylancl 586	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (𝑁 + 1) = (1 + 𝑁))
7		diffi 9089	. . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → (𝐴 ∖ (1...𝑁)) ∈ Fin)
8	7	3ad2ant2 1134	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (𝐴 ∖ (1...𝑁)) ∈ Fin)
9		fzfid 13880	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (1...𝑁) ∈ Fin)
10		disjdifr 4424	. . . . . . . . . 10 ⊢ ((𝐴 ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅
11	10	a1i 11	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ((𝐴 ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅)
12		hashun 14289	. . . . . . . . 9 ⊢ (((𝐴 ∖ (1...𝑁)) ∈ Fin ∧ (1...𝑁) ∈ Fin ∧ ((𝐴 ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅) → (♯‘((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁))) = ((♯‘(𝐴 ∖ (1...𝑁))) + (♯‘(1...𝑁))))
13	8, 9, 11, 12	syl3anc 1373	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁))) = ((♯‘(𝐴 ∖ (1...𝑁))) + (♯‘(1...𝑁))))
14		uncom 4109	. . . . . . . . . 10 ⊢ ((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁)) = ((1...𝑁) ∪ (𝐴 ∖ (1...𝑁)))
15		simp3 1138	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (1...𝑁) ⊆ 𝐴)
16		undif 4433	. . . . . . . . . . 11 ⊢ ((1...𝑁) ⊆ 𝐴 ↔ ((1...𝑁) ∪ (𝐴 ∖ (1...𝑁))) = 𝐴)
17	15, 16	sylib 218	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ((1...𝑁) ∪ (𝐴 ∖ (1...𝑁))) = 𝐴)
18	14, 17	eqtrid 2776	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁)) = 𝐴)
19	18	fveq2d 6826	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁))) = (♯‘𝐴))
20		hashfz1 14253	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → (♯‘(1...𝑁)) = 𝑁)
21	20	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘(1...𝑁)) = 𝑁)
22	21	oveq2d 7365	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ((♯‘(𝐴 ∖ (1...𝑁))) + (♯‘(1...𝑁))) = ((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁))
23	13, 19, 22	3eqtr3d 2772	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘𝐴) = ((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁))
24	6, 23	oveq12d 7367	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ((𝑁 + 1)...(♯‘𝐴)) = ((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁)))
25	24	fveq2d 6826	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘((𝑁 + 1)...(♯‘𝐴))) = (♯‘((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁))))
26		1zzd 12506	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → 1 ∈ ℤ)
27		hashcl 14263	. . . . . . . . . 10 ⊢ ((𝐴 ∖ (1...𝑁)) ∈ Fin → (♯‘(𝐴 ∖ (1...𝑁))) ∈ ℕ0)
28	8, 27	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘(𝐴 ∖ (1...𝑁))) ∈ ℕ0)
29	28	nn0zd 12497	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘(𝐴 ∖ (1...𝑁))) ∈ ℤ)
30		nn0z 12496	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ)
31	30	3ad2ant1 1133	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → 𝑁 ∈ ℤ)
32		fzen 13444	. . . . . . . 8 ⊢ ((1 ∈ ℤ ∧ (♯‘(𝐴 ∖ (1...𝑁))) ∈ ℤ ∧ 𝑁 ∈ ℤ) → (1...(♯‘(𝐴 ∖ (1...𝑁)))) ≈ ((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁)))
33	26, 29, 31, 32	syl3anc 1373	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (1...(♯‘(𝐴 ∖ (1...𝑁)))) ≈ ((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁)))
34	33	ensymd 8930	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁)) ≈ (1...(♯‘(𝐴 ∖ (1...𝑁)))))
35		fzfi 13879	. . . . . . 7 ⊢ ((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁)) ∈ Fin
36		fzfi 13879	. . . . . . 7 ⊢ (1...(♯‘(𝐴 ∖ (1...𝑁)))) ∈ Fin
37		hashen 14254	. . . . . . 7 ⊢ ((((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁)) ∈ Fin ∧ (1...(♯‘(𝐴 ∖ (1...𝑁)))) ∈ Fin) → ((♯‘((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁))) = (♯‘(1...(♯‘(𝐴 ∖ (1...𝑁))))) ↔ ((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁)) ≈ (1...(♯‘(𝐴 ∖ (1...𝑁))))))
38	35, 36, 37	mp2an 692	. . . . . 6 ⊢ ((♯‘((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁))) = (♯‘(1...(♯‘(𝐴 ∖ (1...𝑁))))) ↔ ((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁)) ≈ (1...(♯‘(𝐴 ∖ (1...𝑁)))))
39	34, 38	sylibr 234	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘((1 + 𝑁)...((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁))) = (♯‘(1...(♯‘(𝐴 ∖ (1...𝑁))))))
40		hashfz1 14253	. . . . . 6 ⊢ ((♯‘(𝐴 ∖ (1...𝑁))) ∈ ℕ0 → (♯‘(1...(♯‘(𝐴 ∖ (1...𝑁))))) = (♯‘(𝐴 ∖ (1...𝑁))))
41	28, 40	syl 17	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘(1...(♯‘(𝐴 ∖ (1...𝑁))))) = (♯‘(𝐴 ∖ (1...𝑁))))
42	25, 39, 41	3eqtrd 2768	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → (♯‘((𝑁 + 1)...(♯‘𝐴))) = (♯‘(𝐴 ∖ (1...𝑁))))
43		fzfi 13879	. . . . 5 ⊢ ((𝑁 + 1)...(♯‘𝐴)) ∈ Fin
44		hashen 14254	. . . . 5 ⊢ ((((𝑁 + 1)...(♯‘𝐴)) ∈ Fin ∧ (𝐴 ∖ (1...𝑁)) ∈ Fin) → ((♯‘((𝑁 + 1)...(♯‘𝐴))) = (♯‘(𝐴 ∖ (1...𝑁))) ↔ ((𝑁 + 1)...(♯‘𝐴)) ≈ (𝐴 ∖ (1...𝑁))))
45	43, 8, 44	sylancr 587	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ((♯‘((𝑁 + 1)...(♯‘𝐴))) = (♯‘(𝐴 ∖ (1...𝑁))) ↔ ((𝑁 + 1)...(♯‘𝐴)) ≈ (𝐴 ∖ (1...𝑁))))
46	42, 45	mpbid 232	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ((𝑁 + 1)...(♯‘𝐴)) ≈ (𝐴 ∖ (1...𝑁)))
47		bren 8882	. . 3 ⊢ (((𝑁 + 1)...(♯‘𝐴)) ≈ (𝐴 ∖ (1...𝑁)) ↔ ∃𝑎 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁)))
48	46, 47	sylib 218	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ∃𝑎 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁)))
49		simpl1 1192	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → 𝑁 ∈ ℕ0)
50	49	nn0zd 12497	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → 𝑁 ∈ ℤ)
51		simpl2 1193	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → 𝐴 ∈ Fin)
52		hashcl 14263	. . . . . 6 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0)
53	51, 52	syl 17	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (♯‘𝐴) ∈ ℕ0)
54	53	nn0zd 12497	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (♯‘𝐴) ∈ ℤ)
55		nn0addge2 12431	. . . . . . 7 ⊢ ((𝑁 ∈ ℝ ∧ (♯‘(𝐴 ∖ (1...𝑁))) ∈ ℕ0) → 𝑁 ≤ ((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁))
56	2, 28, 55	syl2anc 584	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → 𝑁 ≤ ((♯‘(𝐴 ∖ (1...𝑁))) + 𝑁))
57	56, 23	breqtrrd 5120	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → 𝑁 ≤ (♯‘𝐴))
58	57	adantr 480	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → 𝑁 ≤ (♯‘𝐴))
59		eluz2 12741	. . . 4 ⊢ ((♯‘𝐴) ∈ (ℤ≥‘𝑁) ↔ (𝑁 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑁 ≤ (♯‘𝐴)))
60	50, 54, 58, 59	syl3anbrc 1344	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (♯‘𝐴) ∈ (ℤ≥‘𝑁))
61		vex 3440	. . . . 5 ⊢ 𝑎 ∈ V
62		ovex 7382	. . . . . 6 ⊢ (1...𝑁) ∈ V
63		resiexg 7845	. . . . . 6 ⊢ ((1...𝑁) ∈ V → ( I ↾ (1...𝑁)) ∈ V)
64	62, 63	ax-mp 5	. . . . 5 ⊢ ( I ↾ (1...𝑁)) ∈ V
65	61, 64	unex 7680	. . . 4 ⊢ (𝑎 ∪ ( I ↾ (1...𝑁))) ∈ V
66	65	a1i 11	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))) ∈ V)
67		simpr 484	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁)))
68		f1oi 6802	. . . . . 6 ⊢ ( I ↾ (1...𝑁)):(1...𝑁)–1-1-onto→(1...𝑁)
69	68	a1i 11	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ( I ↾ (1...𝑁)):(1...𝑁)–1-1-onto→(1...𝑁))
70		incom 4160	. . . . . 6 ⊢ (((𝑁 + 1)...(♯‘𝐴)) ∩ (1...𝑁)) = ((1...𝑁) ∩ ((𝑁 + 1)...(♯‘𝐴)))
71	49	nn0red 12446	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → 𝑁 ∈ ℝ)
72	71	ltp1d 12055	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → 𝑁 < (𝑁 + 1))
73		fzdisj 13454	. . . . . . 7 ⊢ (𝑁 < (𝑁 + 1) → ((1...𝑁) ∩ ((𝑁 + 1)...(♯‘𝐴))) = ∅)
74	72, 73	syl 17	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((1...𝑁) ∩ ((𝑁 + 1)...(♯‘𝐴))) = ∅)
75	70, 74	eqtrid 2776	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (((𝑁 + 1)...(♯‘𝐴)) ∩ (1...𝑁)) = ∅)
76	10	a1i 11	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((𝐴 ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅)
77		f1oun 6783	. . . . 5 ⊢ (((𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁)) ∧ ( I ↾ (1...𝑁)):(1...𝑁)–1-1-onto→(1...𝑁)) ∧ ((((𝑁 + 1)...(♯‘𝐴)) ∩ (1...𝑁)) = ∅ ∧ ((𝐴 ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅)) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((𝑁 + 1)...(♯‘𝐴)) ∪ (1...𝑁))–1-1-onto→((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁)))
78	67, 69, 75, 76, 77	syl22anc 838	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((𝑁 + 1)...(♯‘𝐴)) ∪ (1...𝑁))–1-1-onto→((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁)))
79		uncom 4109	. . . . . 6 ⊢ (((𝑁 + 1)...(♯‘𝐴)) ∪ (1...𝑁)) = ((1...𝑁) ∪ ((𝑁 + 1)...(♯‘𝐴)))
80		fzsplit1nn0 42747	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (♯‘𝐴) ∈ ℕ0 ∧ 𝑁 ≤ (♯‘𝐴)) → (1...(♯‘𝐴)) = ((1...𝑁) ∪ ((𝑁 + 1)...(♯‘𝐴))))
81	49, 53, 58, 80	syl3anc 1373	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (1...(♯‘𝐴)) = ((1...𝑁) ∪ ((𝑁 + 1)...(♯‘𝐴))))
82	79, 81	eqtr4id 2783	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (((𝑁 + 1)...(♯‘𝐴)) ∪ (1...𝑁)) = (1...(♯‘𝐴)))
83		simpl3 1194	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (1...𝑁) ⊆ 𝐴)
84	83, 16	sylib 218	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((1...𝑁) ∪ (𝐴 ∖ (1...𝑁))) = 𝐴)
85	14, 84	eqtrid 2776	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁)) = 𝐴)
86		f1oeq23 6755	. . . . 5 ⊢ (((((𝑁 + 1)...(♯‘𝐴)) ∪ (1...𝑁)) = (1...(♯‘𝐴)) ∧ ((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁)) = 𝐴) → ((𝑎 ∪ ( I ↾ (1...𝑁))):(((𝑁 + 1)...(♯‘𝐴)) ∪ (1...𝑁))–1-1-onto→((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁)) ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...(♯‘𝐴))–1-1-onto→𝐴))
87	82, 85, 86	syl2anc 584	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((𝑎 ∪ ( I ↾ (1...𝑁))):(((𝑁 + 1)...(♯‘𝐴)) ∪ (1...𝑁))–1-1-onto→((𝐴 ∖ (1...𝑁)) ∪ (1...𝑁)) ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...(♯‘𝐴))–1-1-onto→𝐴))
88	78, 87	mpbid 232	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...(♯‘𝐴))–1-1-onto→𝐴)
89		resundir 5945	. . . 4 ⊢ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁)))
90		dmres 5963	. . . . . . . 8 ⊢ dom (𝑎 ↾ (1...𝑁)) = ((1...𝑁) ∩ dom 𝑎)
91		f1odm 6768	. . . . . . . . . . 11 ⊢ (𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁)) → dom 𝑎 = ((𝑁 + 1)...(♯‘𝐴)))
92	91	adantl 481	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → dom 𝑎 = ((𝑁 + 1)...(♯‘𝐴)))
93	92	ineq2d 4171	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((1...𝑁) ∩ dom 𝑎) = ((1...𝑁) ∩ ((𝑁 + 1)...(♯‘𝐴))))
94	93, 74	eqtrd 2764	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((1...𝑁) ∩ dom 𝑎) = ∅)
95	90, 94	eqtrid 2776	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → dom (𝑎 ↾ (1...𝑁)) = ∅)
96		relres 5956	. . . . . . . 8 ⊢ Rel (𝑎 ↾ (1...𝑁))
97		reldm0 5870	. . . . . . . 8 ⊢ (Rel (𝑎 ↾ (1...𝑁)) → ((𝑎 ↾ (1...𝑁)) = ∅ ↔ dom (𝑎 ↾ (1...𝑁)) = ∅))
98	96, 97	ax-mp 5	. . . . . . 7 ⊢ ((𝑎 ↾ (1...𝑁)) = ∅ ↔ dom (𝑎 ↾ (1...𝑁)) = ∅)
99	95, 98	sylibr 234	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (𝑎 ↾ (1...𝑁)) = ∅)
100		residm 5961	. . . . . . 7 ⊢ (( I ↾ (1...𝑁)) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))
101	100	a1i 11	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → (( I ↾ (1...𝑁)) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
102	99, 101	uneq12d 4120	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁))) = (∅ ∪ ( I ↾ (1...𝑁))))
103		uncom 4109	. . . . . 6 ⊢ (∅ ∪ ( I ↾ (1...𝑁))) = (( I ↾ (1...𝑁)) ∪ ∅)
104		un0 4345	. . . . . 6 ⊢ (( I ↾ (1...𝑁)) ∪ ∅) = ( I ↾ (1...𝑁))
105	103, 104	eqtri 2752	. . . . 5 ⊢ (∅ ∪ ( I ↾ (1...𝑁))) = ( I ↾ (1...𝑁))
106	102, 105	eqtrdi 2780	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁))) = ( I ↾ (1...𝑁)))
107	89, 106	eqtrid 2776	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
108		oveq2 7357	. . . . . 6 ⊢ (𝑑 = (♯‘𝐴) → (1...𝑑) = (1...(♯‘𝐴)))
109	108	f1oeq2d 6760	. . . . 5 ⊢ (𝑑 = (♯‘𝐴) → (𝑒:(1...𝑑)–1-1-onto→𝐴 ↔ 𝑒:(1...(♯‘𝐴))–1-1-onto→𝐴))
110	109	anbi1d 631	. . . 4 ⊢ (𝑑 = (♯‘𝐴) → ((𝑒:(1...𝑑)–1-1-onto→𝐴 ∧ (𝑒 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) ↔ (𝑒:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ (𝑒 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))))
111		f1oeq1 6752	. . . . 5 ⊢ (𝑒 = (𝑎 ∪ ( I ↾ (1...𝑁))) → (𝑒:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...(♯‘𝐴))–1-1-onto→𝐴))
112		reseq1 5924	. . . . . 6 ⊢ (𝑒 = (𝑎 ∪ ( I ↾ (1...𝑁))) → (𝑒 ↾ (1...𝑁)) = ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)))
113	112	eqeq1d 2731	. . . . 5 ⊢ (𝑒 = (𝑎 ∪ ( I ↾ (1...𝑁))) → ((𝑒 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)) ↔ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
114	111, 113	anbi12d 632	. . . 4 ⊢ (𝑒 = (𝑎 ∪ ( I ↾ (1...𝑁))) → ((𝑒:(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ (𝑒 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) ↔ ((𝑎 ∪ ( I ↾ (1...𝑁))):(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))))
115	110, 114	rspc2ev 3590	. . 3 ⊢ (((♯‘𝐴) ∈ (ℤ≥‘𝑁) ∧ (𝑎 ∪ ( I ↾ (1...𝑁))) ∈ V ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))):(1...(♯‘𝐴))–1-1-onto→𝐴 ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → ∃𝑑 ∈ (ℤ≥‘𝑁)∃𝑒 ∈ V (𝑒:(1...𝑑)–1-1-onto→𝐴 ∧ (𝑒 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
116	60, 66, 88, 107, 115	syl112anc 1376	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) ∧ 𝑎:((𝑁 + 1)...(♯‘𝐴))–1-1-onto→(𝐴 ∖ (1...𝑁))) → ∃𝑑 ∈ (ℤ≥‘𝑁)∃𝑒 ∈ V (𝑒:(1...𝑑)–1-1-onto→𝐴 ∧ (𝑒 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
117	48, 116	exlimddv 1935	1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ Fin ∧ (1...𝑁) ⊆ 𝐴) → ∃𝑑 ∈ (ℤ≥‘𝑁)∃𝑒 ∈ V (𝑒:(1...𝑑)–1-1-onto→𝐴 ∧ (𝑒 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2109  ∃wrex 3053  Vcvv 3436   ∖ cdif 3900   ∪ cun 3901   ∩ cin 3902   ⊆ wss 3903  ∅c0 4284   class class class wbr 5092   I cid 5513  dom cdm 5619   ↾ cres 5621  Rel wrel 5624  –1-1-onto→wf1o 6481  ‘cfv 6482  (class class class)co 7349   ≈ cen 8869  Fincfn 8872  ℂcc 11007  ℝcr 11008  1c1 11010   + caddc 11012   < clt 11149   ≤ cle 11150  ℕ₀cn0 12384  ℤcz 12471  ℤ_≥cuz 12735  ...cfz 13410  ♯chash 14237

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-cnex 11065  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085  ax-pre-mulgt0 11086

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-1o 8388  df-oadd 8392  df-er 8625  df-en 8873  df-dom 8874  df-sdom 8875  df-fin 8876  df-dju 9797  df-card 9835  df-pnf 11151  df-mnf 11152  df-xr 11153  df-ltxr 11154  df-le 11155  df-sub 11349  df-neg 11350  df-nn 12129  df-n0 12385  df-z 12472  df-uz 12736  df-fz 13411  df-hash 14238

This theorem is referenced by:  eldioph2  42755