Theorem eldioph2lem2 43704

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

Assertion

Ref	Expression
eldioph2lem2	⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))

Distinct variable groups:   𝑁,𝑐   𝑆,𝑐   𝐴,𝑐

Proof of Theorem eldioph2lem2

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 781	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ¬ 𝑆 ∈ Fin)
2		fzfi 14069	. . . 4 ⊢ (1...𝑁) ∈ Fin
3		difinf 9281	. . . 4 ⊢ ((¬ 𝑆 ∈ Fin ∧ (1...𝑁) ∈ Fin) → ¬ (𝑆 ∖ (1...𝑁)) ∈ Fin)
4	1, 2, 3	sylancl 598	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ¬ (𝑆 ∖ (1...𝑁)) ∈ Fin)
5		fzfi 14069	. . . 4 ⊢ (1...𝐴) ∈ Fin
6		diffi 9169	. . . 4 ⊢ ((1...𝐴) ∈ Fin → ((1...𝐴) ∖ (1...𝑁)) ∈ Fin)
7	5, 6	ax-mp 5	. . 3 ⊢ ((1...𝐴) ∖ (1...𝑁)) ∈ Fin
8		isinffi 10030	. . 3 ⊢ ((¬ (𝑆 ∖ (1...𝑁)) ∈ Fin ∧ ((1...𝐴) ∖ (1...𝑁)) ∈ Fin) → ∃𝑎 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)))
9	4, 7, 8	sylancl 598	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ∃𝑎 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)))
10		f1f1orn 6825	. . . . . . . 8 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1-onto→ran 𝑎)
11	10	adantl 487	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1-onto→ran 𝑎)
12		f1oi 6852	. . . . . . . 8 ⊢ ( I ↾ (1...𝑁)):(1...𝑁)–1-1-onto→(1...𝑁)
13	12	a1i 11	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ( I ↾ (1...𝑁)):(1...𝑁)–1-1-onto→(1...𝑁))
14		disjdifr 4427	. . . . . . . 8 ⊢ (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅
15	14	a1i 11	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅)
16		f1f 6767	. . . . . . . . . . . 12 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → 𝑎:((1...𝐴) ∖ (1...𝑁))⟶(𝑆 ∖ (1...𝑁)))
17	16	frnd 6707	. . . . . . . . . . 11 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → ran 𝑎 ⊆ (𝑆 ∖ (1...𝑁)))
18	17	adantl 487	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ran 𝑎 ⊆ (𝑆 ∖ (1...𝑁)))
19	18	ssrind 4189	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) ⊆ ((𝑆 ∖ (1...𝑁)) ∩ (1...𝑁)))
20		disjdifr 4427	. . . . . . . . 9 ⊢ ((𝑆 ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅
21	19, 20	sseqtrdi 3971	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) ⊆ ∅)
22		ss0 4352	. . . . . . . 8 ⊢ ((ran 𝑎 ∩ (1...𝑁)) ⊆ ∅ → (ran 𝑎 ∩ (1...𝑁)) = ∅)
23	21, 22	syl 18	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) = ∅)
24		f1oun 6833	. . . . . . 7 ⊢ (((𝑎:((1...𝐴) ∖ (1...𝑁))–1-1-onto→ran 𝑎 ∧ ( I ↾ (1...𝑁)):(1...𝑁)–1-1-onto→(1...𝑁)) ∧ ((((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅ ∧ (ran 𝑎 ∩ (1...𝑁)) = ∅)) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1-onto→(ran 𝑎 ∪ (1...𝑁)))
25	11, 13, 15, 23, 24	syl22anc 852	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1-onto→(ran 𝑎 ∪ (1...𝑁)))
26		f1of1 6812	. . . . . 6 ⊢ ((𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1-onto→(ran 𝑎 ∪ (1...𝑁)) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)))
27	25, 26	syl 18	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)))
28		uncom 4105	. . . . . . 7 ⊢ (((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁)) = ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁)))
29		simplrr 790	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → 𝐴 ∈ (ℤ≥‘𝑁))
30		fzss2 13652	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℤ≥‘𝑁) → (1...𝑁) ⊆ (1...𝐴))
31	29, 30	syl 18	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (1...𝑁) ⊆ (1...𝐴))
32		undif 4438	. . . . . . . 8 ⊢ ((1...𝑁) ⊆ (1...𝐴) ↔ ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁))) = (1...𝐴))
33	31, 32	sylib 221	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁))) = (1...𝐴))
34	28, 33	eqtrid 2807	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁)) = (1...𝐴))
35		f1eq2 6763	. . . . . 6 ⊢ ((((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁)) = (1...𝐴) → ((𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)) ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁))))
36	34, 35	syl 18	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)) ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁))))
37	27, 36	mpbid 235	. . . 4 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁)))
38	17	difss2d 4086	. . . . . 6 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → ran 𝑎 ⊆ 𝑆)
39	38	adantl 487	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ran 𝑎 ⊆ 𝑆)
40		simplrl 789	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (1...𝑁) ⊆ 𝑆)
41	39, 40	unssd 4138	. . . 4 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∪ (1...𝑁)) ⊆ 𝑆)
42		f1ss 6774	. . . 4 ⊢ (((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁)) ∧ (ran 𝑎 ∪ (1...𝑁)) ⊆ 𝑆) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆)
43	37, 41, 42	syl2anc 596	. . 3 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆)
44		resundir 5982	. . . 4 ⊢ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁)))
45		dmres 6000	. . . . . . . 8 ⊢ dom (𝑎 ↾ (1...𝑁)) = ((1...𝑁) ∩ dom 𝑎)
46		incom 4155	. . . . . . . . 9 ⊢ ((1...𝑁) ∩ dom 𝑎) = (dom 𝑎 ∩ (1...𝑁))
47		f1dm 6773	. . . . . . . . . . . 12 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → dom 𝑎 = ((1...𝐴) ∖ (1...𝑁)))
48	47	adantl 487	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → dom 𝑎 = ((1...𝐴) ∖ (1...𝑁)))
49	48	ineq1d 4165	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (dom 𝑎 ∩ (1...𝑁)) = (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)))
50	49, 14	eqtrdi 2811	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (dom 𝑎 ∩ (1...𝑁)) = ∅)
51	46, 50	eqtrid 2807	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((1...𝑁) ∩ dom 𝑎) = ∅)
52	45, 51	eqtrid 2807	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → dom (𝑎 ↾ (1...𝑁)) = ∅)
53		relres 5993	. . . . . . . 8 ⊢ Rel (𝑎 ↾ (1...𝑁))
54		reldm0 5907	. . . . . . . 8 ⊢ (Rel (𝑎 ↾ (1...𝑁)) → ((𝑎 ↾ (1...𝑁)) = ∅ ↔ dom (𝑎 ↾ (1...𝑁)) = ∅))
55	53, 54	ax-mp 5	. . . . . . 7 ⊢ ((𝑎 ↾ (1...𝑁)) = ∅ ↔ dom (𝑎 ↾ (1...𝑁)) = ∅)
56	52, 55	sylibr 237	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ↾ (1...𝑁)) = ∅)
57		residm 5998	. . . . . . 7 ⊢ (( I ↾ (1...𝑁)) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))
58	57	a1i 11	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (( I ↾ (1...𝑁)) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
59	56, 58	uneq12d 4116	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁))) = (∅ ∪ ( I ↾ (1...𝑁))))
60		uncom 4105	. . . . . 6 ⊢ (∅ ∪ ( I ↾ (1...𝑁))) = (( I ↾ (1...𝑁)) ∪ ∅)
61		un0 4344	. . . . . 6 ⊢ (( I ↾ (1...𝑁)) ∪ ∅) = ( I ↾ (1...𝑁))
62	60, 61	eqtri 2783	. . . . 5 ⊢ (∅ ∪ ( I ↾ (1...𝑁))) = ( I ↾ (1...𝑁))
63	59, 62	eqtrdi 2811	. . . 4 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁))) = ( I ↾ (1...𝑁)))
64	44, 63	eqtrid 2807	. . 3 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
65		vex 3454	. . . . 5 ⊢ 𝑎 ∈ V
66		ovex 7442	. . . . . 6 ⊢ (1...𝑁) ∈ V
67		resiexg 7908	. . . . . 6 ⊢ ((1...𝑁) ∈ V → ( I ↾ (1...𝑁)) ∈ V)
68	66, 67	ax-mp 5	. . . . 5 ⊢ ( I ↾ (1...𝑁)) ∈ V
69	65, 68	unex 7745	. . . 4 ⊢ (𝑎 ∪ ( I ↾ (1...𝑁))) ∈ V
70		f1eq1 6762	. . . . 5 ⊢ (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → (𝑐:(1...𝐴)–1-1→𝑆 ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆))
71		reseq1 5961	. . . . . 6 ⊢ (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → (𝑐 ↾ (1...𝑁)) = ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)))
72	71	eqeq1d 2762	. . . . 5 ⊢ (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → ((𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)) ↔ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
73	70, 72	anbi12d 644	. . . 4 ⊢ (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → ((𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) ↔ ((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆 ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))))
74	69, 73	spcev 3560	. . 3 ⊢ (((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆 ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
75	43, 64, 74	syl2anc 596	. 2 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
76	9, 75	exlimddv 1968	1 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  Vcvv 3450   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279   I cid 5542  dom cdm 5648  ran crn 5649   ↾ cres 5650  Rel wrel 5653  –1-1→wf1 6525  –1-1-onto→wf1o 6527  ‘cfv 6528  (class class class)co 7409  Fincfn 8952  1c1 11158  ℕ₀cn0 12561  ℤ_≥cuz 12920  ...cfz 13594

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735  ax-cnex 11213  ax-resscn 11214  ax-1cn 11215  ax-icn 11216  ax-addcl 11217  ax-addrcl 11218  ax-mulcl 11219  ax-mulrcl 11220  ax-mulcom 11221  ax-addass 11222  ax-mulass 11223  ax-distr 11224  ax-i2m1 11225  ax-1ne0 11226  ax-1rid 11227  ax-rnegex 11228  ax-rrecex 11229  ax-cnre 11230  ax-pre-lttri 11231  ax-pre-lttrn 11232  ax-pre-ltadd 11233  ax-pre-mulgt0 11234

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6294  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-riota 7366  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7862  df-1st 7985  df-2nd 7986  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8455  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-card 9977  df-pnf 11302  df-mnf 11303  df-xr 11304  df-ltxr 11305  df-le 11306  df-sub 11500  df-neg 11501  df-nn 12291  df-n0 12562  df-z 12649  df-uz 12921  df-fz 13595

This theorem is used by:  eldioph2b  43706