Theorem eldioph2lem2 42742

Description: Lemma for eldioph2 42743. 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 768	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ¬ 𝑆 ∈ Fin)
2		fzfi 13913	. . . 4 ⊢ (1...𝑁) ∈ Fin
3		difinf 9236	. . . 4 ⊢ ((¬ 𝑆 ∈ Fin ∧ (1...𝑁) ∈ Fin) → ¬ (𝑆 ∖ (1...𝑁)) ∈ Fin)
4	1, 2, 3	sylancl 586	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ¬ (𝑆 ∖ (1...𝑁)) ∈ Fin)
5		fzfi 13913	. . . 4 ⊢ (1...𝐴) ∈ Fin
6		diffi 9116	. . . 4 ⊢ ((1...𝐴) ∈ Fin → ((1...𝐴) ∖ (1...𝑁)) ∈ Fin)
7	5, 6	ax-mp 5	. . 3 ⊢ ((1...𝐴) ∖ (1...𝑁)) ∈ Fin
8		isinffi 9921	. . 3 ⊢ ((¬ (𝑆 ∖ (1...𝑁)) ∈ Fin ∧ ((1...𝐴) ∖ (1...𝑁)) ∈ Fin) → ∃𝑎 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)))
9	4, 7, 8	sylancl 586	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ∃𝑎 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)))
10		f1f1orn 6793	. . . . . . . 8 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1-onto→ran 𝑎)
11	10	adantl 481	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1-onto→ran 𝑎)
12		f1oi 6820	. . . . . . . 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 4432	. . . . . . . 8 ⊢ (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅
15	14	a1i 11	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅)
16		f1f 6738	. . . . . . . . . . . 12 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → 𝑎:((1...𝐴) ∖ (1...𝑁))⟶(𝑆 ∖ (1...𝑁)))
17	16	frnd 6678	. . . . . . . . . . 11 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → ran 𝑎 ⊆ (𝑆 ∖ (1...𝑁)))
18	17	adantl 481	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ran 𝑎 ⊆ (𝑆 ∖ (1...𝑁)))
19	18	ssrind 4203	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) ⊆ ((𝑆 ∖ (1...𝑁)) ∩ (1...𝑁)))
20		disjdifr 4432	. . . . . . . . 9 ⊢ ((𝑆 ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅
21	19, 20	sseqtrdi 3984	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) ⊆ ∅)
22		ss0 4361	. . . . . . . 8 ⊢ ((ran 𝑎 ∩ (1...𝑁)) ⊆ ∅ → (ran 𝑎 ∩ (1...𝑁)) = ∅)
23	21, 22	syl 17	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) = ∅)
24		f1oun 6801	. . . . . . 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 838	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1-onto→(ran 𝑎 ∪ (1...𝑁)))
26		f1of1 6781	. . . . . 6 ⊢ ((𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1-onto→(ran 𝑎 ∪ (1...𝑁)) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)))
27	25, 26	syl 17	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)))
28		uncom 4117	. . . . . . 7 ⊢ (((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁)) = ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁)))
29		simplrr 777	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → 𝐴 ∈ (ℤ≥‘𝑁))
30		fzss2 13501	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℤ≥‘𝑁) → (1...𝑁) ⊆ (1...𝐴))
31	29, 30	syl 17	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (1...𝑁) ⊆ (1...𝐴))
32		undif 4441	. . . . . . . 8 ⊢ ((1...𝑁) ⊆ (1...𝐴) ↔ ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁))) = (1...𝐴))
33	31, 32	sylib 218	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁))) = (1...𝐴))
34	28, 33	eqtrid 2776	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁)) = (1...𝐴))
35		f1eq2 6734	. . . . . 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 17	. . . . 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 232	. . . 4 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁)))
38	17	difss2d 4098	. . . . . 6 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → ran 𝑎 ⊆ 𝑆)
39	38	adantl 481	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ran 𝑎 ⊆ 𝑆)
40		simplrl 776	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (1...𝑁) ⊆ 𝑆)
41	39, 40	unssd 4151	. . . 4 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∪ (1...𝑁)) ⊆ 𝑆)
42		f1ss 6743	. . . 4 ⊢ (((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁)) ∧ (ran 𝑎 ∪ (1...𝑁)) ⊆ 𝑆) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆)
43	37, 41, 42	syl2anc 584	. . 3 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆)
44		resundir 5954	. . . 4 ⊢ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁)))
45		dmres 5972	. . . . . . . 8 ⊢ dom (𝑎 ↾ (1...𝑁)) = ((1...𝑁) ∩ dom 𝑎)
46		incom 4168	. . . . . . . . 9 ⊢ ((1...𝑁) ∩ dom 𝑎) = (dom 𝑎 ∩ (1...𝑁))
47		f1dm 6742	. . . . . . . . . . . 12 ⊢ (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → dom 𝑎 = ((1...𝐴) ∖ (1...𝑁)))
48	47	adantl 481	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → dom 𝑎 = ((1...𝐴) ∖ (1...𝑁)))
49	48	ineq1d 4178	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (dom 𝑎 ∩ (1...𝑁)) = (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)))
50	49, 14	eqtrdi 2780	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (dom 𝑎 ∩ (1...𝑁)) = ∅)
51	46, 50	eqtrid 2776	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((1...𝑁) ∩ dom 𝑎) = ∅)
52	45, 51	eqtrid 2776	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → dom (𝑎 ↾ (1...𝑁)) = ∅)
53		relres 5965	. . . . . . . 8 ⊢ Rel (𝑎 ↾ (1...𝑁))
54		reldm0 5881	. . . . . . . 8 ⊢ (Rel (𝑎 ↾ (1...𝑁)) → ((𝑎 ↾ (1...𝑁)) = ∅ ↔ dom (𝑎 ↾ (1...𝑁)) = ∅))
55	53, 54	ax-mp 5	. . . . . . 7 ⊢ ((𝑎 ↾ (1...𝑁)) = ∅ ↔ dom (𝑎 ↾ (1...𝑁)) = ∅)
56	52, 55	sylibr 234	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ↾ (1...𝑁)) = ∅)
57		residm 5970	. . . . . . 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 4128	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁))) = (∅ ∪ ( I ↾ (1...𝑁))))
60		uncom 4117	. . . . . 6 ⊢ (∅ ∪ ( I ↾ (1...𝑁))) = (( I ↾ (1...𝑁)) ∪ ∅)
61		un0 4353	. . . . . 6 ⊢ (( I ↾ (1...𝑁)) ∪ ∅) = ( I ↾ (1...𝑁))
62	60, 61	eqtri 2752	. . . . 5 ⊢ (∅ ∪ ( I ↾ (1...𝑁))) = ( I ↾ (1...𝑁))
63	59, 62	eqtrdi 2780	. . . 4 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁))) = ( I ↾ (1...𝑁)))
64	44, 63	eqtrid 2776	. . 3 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
65		vex 3448	. . . . 5 ⊢ 𝑎 ∈ V
66		ovex 7402	. . . . . 6 ⊢ (1...𝑁) ∈ V
67		resiexg 7868	. . . . . 6 ⊢ ((1...𝑁) ∈ V → ( I ↾ (1...𝑁)) ∈ V)
68	66, 67	ax-mp 5	. . . . 5 ⊢ ( I ↾ (1...𝑁)) ∈ V
69	65, 68	unex 7700	. . . 4 ⊢ (𝑎 ∪ ( I ↾ (1...𝑁))) ∈ V
70		f1eq1 6733	. . . . 5 ⊢ (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → (𝑐:(1...𝐴)–1-1→𝑆 ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆))
71		reseq1 5933	. . . . . 6 ⊢ (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → (𝑐 ↾ (1...𝑁)) = ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)))
72	71	eqeq1d 2731	. . . . 5 ⊢ (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → ((𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)) ↔ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
73	70, 72	anbi12d 632	. . . 4 ⊢ (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → ((𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) ↔ ((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆 ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))))
74	69, 73	spcev 3569	. . 3 ⊢ (((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→𝑆 ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
75	43, 64, 74	syl2anc 584	. 2 ⊢ ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
76	9, 75	exlimddv 1935	1 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝐴 ∈ (ℤ≥‘𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  Vcvv 3444   ∖ cdif 3908   ∪ cun 3909   ∩ cin 3910   ⊆ wss 3911  ∅c0 4292   I cid 5525  dom cdm 5631  ran crn 5632   ↾ cres 5633  Rel wrel 5636  –1-1→wf1 6496  –1-1-onto→wf1o 6498  ‘cfv 6499  (class class class)co 7369  Fincfn 8895  1c1 11045  ℕ₀cn0 12418  ℤ_≥cuz 12769  ...cfz 13444

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 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11100  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121

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 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-1o 8411  df-er 8648  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-card 9868  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-nn 12163  df-n0 12419  df-z 12506  df-uz 12770  df-fz 13445

This theorem is referenced by:  eldioph2b  42744