Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eldioph2lem2 Structured version   Visualization version   GIF version

Theorem eldioph2lem2 37641
Description: Lemma for eldioph2 37642. 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.
StepHypRef Expression
1 simplr 807 . . . 4 (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) → ¬ 𝑆 ∈ Fin)
2 fzfi 12811 . . . 4 (1...𝑁) ∈ Fin
3 difinf 8271 . . . 4 ((¬ 𝑆 ∈ Fin ∧ (1...𝑁) ∈ Fin) → ¬ (𝑆 ∖ (1...𝑁)) ∈ Fin)
41, 2, 3sylancl 695 . . 3 (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) → ¬ (𝑆 ∖ (1...𝑁)) ∈ Fin)
5 fzfi 12811 . . . 4 (1...𝐴) ∈ Fin
6 diffi 8233 . . . 4 ((1...𝐴) ∈ Fin → ((1...𝐴) ∖ (1...𝑁)) ∈ Fin)
75, 6ax-mp 5 . . 3 ((1...𝐴) ∖ (1...𝑁)) ∈ Fin
8 isinffi 8856 . . 3 ((¬ (𝑆 ∖ (1...𝑁)) ∈ Fin ∧ ((1...𝐴) ∖ (1...𝑁)) ∈ Fin) → ∃𝑎 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)))
94, 7, 8sylancl 695 . 2 (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) → ∃𝑎 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)))
10 f1f1orn 6186 . . . . . . . 8 (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1-onto→ran 𝑎)
1110adantl 481 . . . . . . 7 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1-onto→ran 𝑎)
12 f1oi 6212 . . . . . . . 8 ( I ↾ (1...𝑁)):(1...𝑁)–1-1-onto→(1...𝑁)
1312a1i 11 . . . . . . 7 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ( I ↾ (1...𝑁)):(1...𝑁)–1-1-onto→(1...𝑁))
14 incom 3838 . . . . . . . . 9 (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)) = ((1...𝑁) ∩ ((1...𝐴) ∖ (1...𝑁)))
15 disjdif 4073 . . . . . . . . 9 ((1...𝑁) ∩ ((1...𝐴) ∖ (1...𝑁))) = ∅
1614, 15eqtri 2673 . . . . . . . 8 (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅
1716a1i 11 . . . . . . 7 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅)
18 f1f 6139 . . . . . . . . . . . 12 (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → 𝑎:((1...𝐴) ∖ (1...𝑁))⟶(𝑆 ∖ (1...𝑁)))
19 frn 6091 . . . . . . . . . . . 12 (𝑎:((1...𝐴) ∖ (1...𝑁))⟶(𝑆 ∖ (1...𝑁)) → ran 𝑎 ⊆ (𝑆 ∖ (1...𝑁)))
2018, 19syl 17 . . . . . . . . . . 11 (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → ran 𝑎 ⊆ (𝑆 ∖ (1...𝑁)))
2120adantl 481 . . . . . . . . . 10 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ran 𝑎 ⊆ (𝑆 ∖ (1...𝑁)))
22 ssrin 3871 . . . . . . . . . 10 (ran 𝑎 ⊆ (𝑆 ∖ (1...𝑁)) → (ran 𝑎 ∩ (1...𝑁)) ⊆ ((𝑆 ∖ (1...𝑁)) ∩ (1...𝑁)))
2321, 22syl 17 . . . . . . . . 9 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) ⊆ ((𝑆 ∖ (1...𝑁)) ∩ (1...𝑁)))
24 incom 3838 . . . . . . . . . 10 ((𝑆 ∖ (1...𝑁)) ∩ (1...𝑁)) = ((1...𝑁) ∩ (𝑆 ∖ (1...𝑁)))
25 disjdif 4073 . . . . . . . . . 10 ((1...𝑁) ∩ (𝑆 ∖ (1...𝑁))) = ∅
2624, 25eqtri 2673 . . . . . . . . 9 ((𝑆 ∖ (1...𝑁)) ∩ (1...𝑁)) = ∅
2723, 26syl6sseq 3684 . . . . . . . 8 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) ⊆ ∅)
28 ss0 4007 . . . . . . . 8 ((ran 𝑎 ∩ (1...𝑁)) ⊆ ∅ → (ran 𝑎 ∩ (1...𝑁)) = ∅)
2927, 28syl 17 . . . . . . 7 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∩ (1...𝑁)) = ∅)
30 f1oun 6194 . . . . . . 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...𝑁)))
3111, 13, 17, 29, 30syl22anc 1367 . . . . . 6 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1-onto→(ran 𝑎 ∪ (1...𝑁)))
32 f1of1 6174 . . . . . 6 ((𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1-onto→(ran 𝑎 ∪ (1...𝑁)) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)))
3331, 32syl 17 . . . . 5 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)))
34 uncom 3790 . . . . . . 7 (((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁)) = ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁)))
35 simplrr 818 . . . . . . . . 9 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → 𝐴 ∈ (ℤ𝑁))
36 fzss2 12419 . . . . . . . . 9 (𝐴 ∈ (ℤ𝑁) → (1...𝑁) ⊆ (1...𝐴))
3735, 36syl 17 . . . . . . . 8 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (1...𝑁) ⊆ (1...𝐴))
38 undif 4082 . . . . . . . 8 ((1...𝑁) ⊆ (1...𝐴) ↔ ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁))) = (1...𝐴))
3937, 38sylib 208 . . . . . . 7 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((1...𝑁) ∪ ((1...𝐴) ∖ (1...𝑁))) = (1...𝐴))
4034, 39syl5eq 2697 . . . . . 6 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁)) = (1...𝐴))
41 f1eq2 6135 . . . . . 6 ((((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁)) = (1...𝐴) → ((𝑎 ∪ ( I ↾ (1...𝑁))):(((1...𝐴) ∖ (1...𝑁)) ∪ (1...𝑁))–1-1→(ran 𝑎 ∪ (1...𝑁)) ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁))))
4240, 41syl 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...𝑁))))
4333, 42mpbid 222 . . . 4 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁)))
4420difss2d 3773 . . . . . 6 (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → ran 𝑎𝑆)
4544adantl 481 . . . . 5 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ran 𝑎𝑆)
46 simplrl 817 . . . . 5 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (1...𝑁) ⊆ 𝑆)
4745, 46unssd 3822 . . . 4 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (ran 𝑎 ∪ (1...𝑁)) ⊆ 𝑆)
48 f1ss 6144 . . . 4 (((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1→(ran 𝑎 ∪ (1...𝑁)) ∧ (ran 𝑎 ∪ (1...𝑁)) ⊆ 𝑆) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1𝑆)
4943, 47, 48syl2anc 694 . . 3 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1𝑆)
50 resundir 5446 . . . 4 ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁)))
51 dmres 5454 . . . . . . . 8 dom (𝑎 ↾ (1...𝑁)) = ((1...𝑁) ∩ dom 𝑎)
52 incom 3838 . . . . . . . . 9 ((1...𝑁) ∩ dom 𝑎) = (dom 𝑎 ∩ (1...𝑁))
53 f1dm 6143 . . . . . . . . . . . 12 (𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁)) → dom 𝑎 = ((1...𝐴) ∖ (1...𝑁)))
5453adantl 481 . . . . . . . . . . 11 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → dom 𝑎 = ((1...𝐴) ∖ (1...𝑁)))
5554ineq1d 3846 . . . . . . . . . 10 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (dom 𝑎 ∩ (1...𝑁)) = (((1...𝐴) ∖ (1...𝑁)) ∩ (1...𝑁)))
5655, 16syl6eq 2701 . . . . . . . . 9 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (dom 𝑎 ∩ (1...𝑁)) = ∅)
5752, 56syl5eq 2697 . . . . . . . 8 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((1...𝑁) ∩ dom 𝑎) = ∅)
5851, 57syl5eq 2697 . . . . . . 7 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → dom (𝑎 ↾ (1...𝑁)) = ∅)
59 relres 5461 . . . . . . . 8 Rel (𝑎 ↾ (1...𝑁))
60 reldm0 5375 . . . . . . . 8 (Rel (𝑎 ↾ (1...𝑁)) → ((𝑎 ↾ (1...𝑁)) = ∅ ↔ dom (𝑎 ↾ (1...𝑁)) = ∅))
6159, 60ax-mp 5 . . . . . . 7 ((𝑎 ↾ (1...𝑁)) = ∅ ↔ dom (𝑎 ↾ (1...𝑁)) = ∅)
6258, 61sylibr 224 . . . . . 6 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (𝑎 ↾ (1...𝑁)) = ∅)
63 residm 5465 . . . . . . 7 (( I ↾ (1...𝑁)) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))
6463a1i 11 . . . . . 6 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → (( I ↾ (1...𝑁)) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
6562, 64uneq12d 3801 . . . . 5 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁))) = (∅ ∪ ( I ↾ (1...𝑁))))
66 uncom 3790 . . . . . 6 (∅ ∪ ( I ↾ (1...𝑁))) = (( I ↾ (1...𝑁)) ∪ ∅)
67 un0 4000 . . . . . 6 (( I ↾ (1...𝑁)) ∪ ∅) = ( I ↾ (1...𝑁))
6866, 67eqtri 2673 . . . . 5 (∅ ∪ ( I ↾ (1...𝑁))) = ( I ↾ (1...𝑁))
6965, 68syl6eq 2701 . . . 4 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ↾ (1...𝑁)) ∪ (( I ↾ (1...𝑁)) ↾ (1...𝑁))) = ( I ↾ (1...𝑁)))
7050, 69syl5eq 2697 . . 3 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
71 vex 3234 . . . . 5 𝑎 ∈ V
72 ovex 6718 . . . . . 6 (1...𝑁) ∈ V
73 resiexg 7144 . . . . . 6 ((1...𝑁) ∈ V → ( I ↾ (1...𝑁)) ∈ V)
7472, 73ax-mp 5 . . . . 5 ( I ↾ (1...𝑁)) ∈ V
7571, 74unex 6998 . . . 4 (𝑎 ∪ ( I ↾ (1...𝑁))) ∈ V
76 f1eq1 6134 . . . . 5 (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → (𝑐:(1...𝐴)–1-1𝑆 ↔ (𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1𝑆))
77 reseq1 5422 . . . . . 6 (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → (𝑐 ↾ (1...𝑁)) = ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)))
7877eqeq1d 2653 . . . . 5 (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → ((𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)) ↔ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
7976, 78anbi12d 747 . . . 4 (𝑐 = (𝑎 ∪ ( I ↾ (1...𝑁))) → ((𝑐:(1...𝐴)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) ↔ ((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1𝑆 ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))))
8075, 79spcev 3331 . . 3 (((𝑎 ∪ ( I ↾ (1...𝑁))):(1...𝐴)–1-1𝑆 ∧ ((𝑎 ∪ ( I ↾ (1...𝑁))) ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
8149, 70, 80syl2anc 694 . 2 ((((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) ∧ 𝑎:((1...𝐴) ∖ (1...𝑁))–1-1→(𝑆 ∖ (1...𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
829, 81exlimddv 1903 1 (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝐴 ∈ (ℤ𝑁))) → ∃𝑐(𝑐:(1...𝐴)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383   = wceq 1523  wex 1744  wcel 2030  Vcvv 3231  cdif 3604  cun 3605  cin 3606  wss 3607  c0 3948   I cid 5052  dom cdm 5143  ran crn 5144  cres 5145  Rel wrel 5148  wf 5922  1-1wf1 5923  1-1-ontowf1o 5925  cfv 5926  (class class class)co 6690  Fincfn 7997  1c1 9975  0cn0 11330  cuz 11725  ...cfz 12364
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-oadd 7609  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-card 8803  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-nn 11059  df-n0 11331  df-z 11416  df-uz 11726  df-fz 12365
This theorem is referenced by:  eldioph2b  37643
  Copyright terms: Public domain W3C validator