ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fseq1p1m1 GIF version

Theorem fseq1p1m1 8954
Description: Add/remove an item to/from the end of a finite sequence. (Contributed by Paul Chapman, 17-Nov-2012.) (Revised by Mario Carneiro, 7-Mar-2014.)
Hypothesis
Ref Expression
fseq1p1m1.1 𝐻 = {⟨(𝑁 + 1), 𝐵⟩}
Assertion
Ref Expression
fseq1p1m1 (𝑁 ∈ ℕ0 → ((𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻)) ↔ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))))

Proof of Theorem fseq1p1m1
StepHypRef Expression
1 simpr1 910 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝐹:(1...𝑁)⟶𝐴)
2 nn0p1nn 8219 . . . . . . . . 9 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
32adantr 261 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝑁 + 1) ∈ ℕ)
4 simpr2 911 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝐵𝐴)
5 fseq1p1m1.1 . . . . . . . . 9 𝐻 = {⟨(𝑁 + 1), 𝐵⟩}
6 fsng 5336 . . . . . . . . 9 (((𝑁 + 1) ∈ ℕ ∧ 𝐵𝐴) → (𝐻:{(𝑁 + 1)}⟶{𝐵} ↔ 𝐻 = {⟨(𝑁 + 1), 𝐵⟩}))
75, 6mpbiri 157 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ ∧ 𝐵𝐴) → 𝐻:{(𝑁 + 1)}⟶{𝐵})
83, 4, 7syl2anc 391 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝐻:{(𝑁 + 1)}⟶{𝐵})
94snssd 3509 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → {𝐵} ⊆ 𝐴)
108, 9fssd 5055 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝐻:{(𝑁 + 1)}⟶𝐴)
11 fzp1disj 8940 . . . . . . 7 ((1...𝑁) ∩ {(𝑁 + 1)}) = ∅
1211a1i 9 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((1...𝑁) ∩ {(𝑁 + 1)}) = ∅)
13 fun2 5064 . . . . . 6 (((𝐹:(1...𝑁)⟶𝐴𝐻:{(𝑁 + 1)}⟶𝐴) ∧ ((1...𝑁) ∩ {(𝑁 + 1)}) = ∅) → (𝐹𝐻):((1...𝑁) ∪ {(𝑁 + 1)})⟶𝐴)
141, 10, 12, 13syl21anc 1134 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐹𝐻):((1...𝑁) ∪ {(𝑁 + 1)})⟶𝐴)
15 1z 8269 . . . . . . . 8 1 ∈ ℤ
16 simpl 102 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝑁 ∈ ℕ0)
17 nn0uz 8505 . . . . . . . . . 10 0 = (ℤ‘0)
18 1m1e0 7982 . . . . . . . . . . 11 (1 − 1) = 0
1918fveq2i 5181 . . . . . . . . . 10 (ℤ‘(1 − 1)) = (ℤ‘0)
2017, 19eqtr4i 2063 . . . . . . . . 9 0 = (ℤ‘(1 − 1))
2116, 20syl6eleq 2130 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝑁 ∈ (ℤ‘(1 − 1)))
22 fzsuc2 8939 . . . . . . . 8 ((1 ∈ ℤ ∧ 𝑁 ∈ (ℤ‘(1 − 1))) → (1...(𝑁 + 1)) = ((1...𝑁) ∪ {(𝑁 + 1)}))
2315, 21, 22sylancr 393 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (1...(𝑁 + 1)) = ((1...𝑁) ∪ {(𝑁 + 1)}))
2423eqcomd 2045 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((1...𝑁) ∪ {(𝑁 + 1)}) = (1...(𝑁 + 1)))
2524feq2d 5035 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((𝐹𝐻):((1...𝑁) ∪ {(𝑁 + 1)})⟶𝐴 ↔ (𝐹𝐻):(1...(𝑁 + 1))⟶𝐴))
2614, 25mpbid 135 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐹𝐻):(1...(𝑁 + 1))⟶𝐴)
27 simpr3 912 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝐺 = (𝐹𝐻))
2827feq1d 5034 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐺:(1...(𝑁 + 1))⟶𝐴 ↔ (𝐹𝐻):(1...(𝑁 + 1))⟶𝐴))
2926, 28mpbird 156 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝐺:(1...(𝑁 + 1))⟶𝐴)
3027reseq1d 4611 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐺 ↾ {(𝑁 + 1)}) = ((𝐹𝐻) ↾ {(𝑁 + 1)}))
31 ffn 5046 . . . . . . . . . 10 (𝐹:(1...𝑁)⟶𝐴𝐹 Fn (1...𝑁))
32 fnresdisj 5009 . . . . . . . . . 10 (𝐹 Fn (1...𝑁) → (((1...𝑁) ∩ {(𝑁 + 1)}) = ∅ ↔ (𝐹 ↾ {(𝑁 + 1)}) = ∅))
331, 31, 323syl 17 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (((1...𝑁) ∩ {(𝑁 + 1)}) = ∅ ↔ (𝐹 ↾ {(𝑁 + 1)}) = ∅))
3412, 33mpbid 135 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐹 ↾ {(𝑁 + 1)}) = ∅)
3534uneq1d 3096 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((𝐹 ↾ {(𝑁 + 1)}) ∪ (𝐻 ↾ {(𝑁 + 1)})) = (∅ ∪ (𝐻 ↾ {(𝑁 + 1)})))
36 resundir 4626 . . . . . . 7 ((𝐹𝐻) ↾ {(𝑁 + 1)}) = ((𝐹 ↾ {(𝑁 + 1)}) ∪ (𝐻 ↾ {(𝑁 + 1)}))
37 uncom 3087 . . . . . . . 8 (∅ ∪ (𝐻 ↾ {(𝑁 + 1)})) = ((𝐻 ↾ {(𝑁 + 1)}) ∪ ∅)
38 un0 3251 . . . . . . . 8 ((𝐻 ↾ {(𝑁 + 1)}) ∪ ∅) = (𝐻 ↾ {(𝑁 + 1)})
3937, 38eqtr2i 2061 . . . . . . 7 (𝐻 ↾ {(𝑁 + 1)}) = (∅ ∪ (𝐻 ↾ {(𝑁 + 1)}))
4035, 36, 393eqtr4g 2097 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((𝐹𝐻) ↾ {(𝑁 + 1)}) = (𝐻 ↾ {(𝑁 + 1)}))
41 ffn 5046 . . . . . . 7 (𝐻:{(𝑁 + 1)}⟶𝐴𝐻 Fn {(𝑁 + 1)})
42 fnresdm 5008 . . . . . . 7 (𝐻 Fn {(𝑁 + 1)} → (𝐻 ↾ {(𝑁 + 1)}) = 𝐻)
4310, 41, 423syl 17 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐻 ↾ {(𝑁 + 1)}) = 𝐻)
4430, 40, 433eqtrd 2076 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐺 ↾ {(𝑁 + 1)}) = 𝐻)
4544fveq1d 5180 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((𝐺 ↾ {(𝑁 + 1)})‘(𝑁 + 1)) = (𝐻‘(𝑁 + 1)))
4616nn0zd 8356 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝑁 ∈ ℤ)
4746peano2zd 8361 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝑁 + 1) ∈ ℤ)
48 snidg 3400 . . . . 5 ((𝑁 + 1) ∈ ℤ → (𝑁 + 1) ∈ {(𝑁 + 1)})
49 fvres 5198 . . . . 5 ((𝑁 + 1) ∈ {(𝑁 + 1)} → ((𝐺 ↾ {(𝑁 + 1)})‘(𝑁 + 1)) = (𝐺‘(𝑁 + 1)))
5047, 48, 493syl 17 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((𝐺 ↾ {(𝑁 + 1)})‘(𝑁 + 1)) = (𝐺‘(𝑁 + 1)))
515fveq1i 5179 . . . . . 6 (𝐻‘(𝑁 + 1)) = ({⟨(𝑁 + 1), 𝐵⟩}‘(𝑁 + 1))
52 fvsng 5359 . . . . . 6 (((𝑁 + 1) ∈ ℕ ∧ 𝐵𝐴) → ({⟨(𝑁 + 1), 𝐵⟩}‘(𝑁 + 1)) = 𝐵)
5351, 52syl5eq 2084 . . . . 5 (((𝑁 + 1) ∈ ℕ ∧ 𝐵𝐴) → (𝐻‘(𝑁 + 1)) = 𝐵)
543, 4, 53syl2anc 391 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐻‘(𝑁 + 1)) = 𝐵)
5545, 50, 543eqtr3d 2080 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐺‘(𝑁 + 1)) = 𝐵)
5627reseq1d 4611 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐺 ↾ (1...𝑁)) = ((𝐹𝐻) ↾ (1...𝑁)))
57 incom 3129 . . . . . . . 8 ({(𝑁 + 1)} ∩ (1...𝑁)) = ((1...𝑁) ∩ {(𝑁 + 1)})
5857, 12syl5eq 2084 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ({(𝑁 + 1)} ∩ (1...𝑁)) = ∅)
59 ffn 5046 . . . . . . . 8 (𝐻:{(𝑁 + 1)}⟶{𝐵} → 𝐻 Fn {(𝑁 + 1)})
60 fnresdisj 5009 . . . . . . . 8 (𝐻 Fn {(𝑁 + 1)} → (({(𝑁 + 1)} ∩ (1...𝑁)) = ∅ ↔ (𝐻 ↾ (1...𝑁)) = ∅))
618, 59, 603syl 17 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (({(𝑁 + 1)} ∩ (1...𝑁)) = ∅ ↔ (𝐻 ↾ (1...𝑁)) = ∅))
6258, 61mpbid 135 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐻 ↾ (1...𝑁)) = ∅)
6362uneq2d 3097 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((𝐹 ↾ (1...𝑁)) ∪ (𝐻 ↾ (1...𝑁))) = ((𝐹 ↾ (1...𝑁)) ∪ ∅))
64 resundir 4626 . . . . 5 ((𝐹𝐻) ↾ (1...𝑁)) = ((𝐹 ↾ (1...𝑁)) ∪ (𝐻 ↾ (1...𝑁)))
65 un0 3251 . . . . . 6 ((𝐹 ↾ (1...𝑁)) ∪ ∅) = (𝐹 ↾ (1...𝑁))
6665eqcomi 2044 . . . . 5 (𝐹 ↾ (1...𝑁)) = ((𝐹 ↾ (1...𝑁)) ∪ ∅)
6763, 64, 663eqtr4g 2097 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → ((𝐹𝐻) ↾ (1...𝑁)) = (𝐹 ↾ (1...𝑁)))
68 fnresdm 5008 . . . . 5 (𝐹 Fn (1...𝑁) → (𝐹 ↾ (1...𝑁)) = 𝐹)
691, 31, 683syl 17 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐹 ↾ (1...𝑁)) = 𝐹)
7056, 67, 693eqtrrd 2077 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → 𝐹 = (𝐺 ↾ (1...𝑁)))
7129, 55, 703jca 1084 . 2 ((𝑁 ∈ ℕ0 ∧ (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻))) → (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁))))
72 simpr1 910 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝐺:(1...(𝑁 + 1))⟶𝐴)
73 fzssp1 8928 . . . . 5 (1...𝑁) ⊆ (1...(𝑁 + 1))
74 fssres 5066 . . . . 5 ((𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (1...𝑁) ⊆ (1...(𝑁 + 1))) → (𝐺 ↾ (1...𝑁)):(1...𝑁)⟶𝐴)
7572, 73, 74sylancl 392 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐺 ↾ (1...𝑁)):(1...𝑁)⟶𝐴)
76 simpr3 912 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝐹 = (𝐺 ↾ (1...𝑁)))
7776feq1d 5034 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐹:(1...𝑁)⟶𝐴 ↔ (𝐺 ↾ (1...𝑁)):(1...𝑁)⟶𝐴))
7875, 77mpbird 156 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝐹:(1...𝑁)⟶𝐴)
79 simpr2 911 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐺‘(𝑁 + 1)) = 𝐵)
802adantr 261 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝑁 + 1) ∈ ℕ)
81 nnuz 8506 . . . . . . 7 ℕ = (ℤ‘1)
8280, 81syl6eleq 2130 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝑁 + 1) ∈ (ℤ‘1))
83 eluzfz2 8894 . . . . . 6 ((𝑁 + 1) ∈ (ℤ‘1) → (𝑁 + 1) ∈ (1...(𝑁 + 1)))
8482, 83syl 14 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝑁 + 1) ∈ (1...(𝑁 + 1)))
8572, 84ffvelrnd 5303 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐺‘(𝑁 + 1)) ∈ 𝐴)
8679, 85eqeltrrd 2115 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝐵𝐴)
87 ffn 5046 . . . . . . . . 9 (𝐺:(1...(𝑁 + 1))⟶𝐴𝐺 Fn (1...(𝑁 + 1)))
8872, 87syl 14 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝐺 Fn (1...(𝑁 + 1)))
89 fnressn 5349 . . . . . . . 8 ((𝐺 Fn (1...(𝑁 + 1)) ∧ (𝑁 + 1) ∈ (1...(𝑁 + 1))) → (𝐺 ↾ {(𝑁 + 1)}) = {⟨(𝑁 + 1), (𝐺‘(𝑁 + 1))⟩})
9088, 84, 89syl2anc 391 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐺 ↾ {(𝑁 + 1)}) = {⟨(𝑁 + 1), (𝐺‘(𝑁 + 1))⟩})
91 opeq2 3550 . . . . . . . . 9 ((𝐺‘(𝑁 + 1)) = 𝐵 → ⟨(𝑁 + 1), (𝐺‘(𝑁 + 1))⟩ = ⟨(𝑁 + 1), 𝐵⟩)
9291sneqd 3388 . . . . . . . 8 ((𝐺‘(𝑁 + 1)) = 𝐵 → {⟨(𝑁 + 1), (𝐺‘(𝑁 + 1))⟩} = {⟨(𝑁 + 1), 𝐵⟩})
9379, 92syl 14 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → {⟨(𝑁 + 1), (𝐺‘(𝑁 + 1))⟩} = {⟨(𝑁 + 1), 𝐵⟩})
9490, 93eqtrd 2072 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐺 ↾ {(𝑁 + 1)}) = {⟨(𝑁 + 1), 𝐵⟩})
9594, 5syl6reqr 2091 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝐻 = (𝐺 ↾ {(𝑁 + 1)}))
9676, 95uneq12d 3098 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐹𝐻) = ((𝐺 ↾ (1...𝑁)) ∪ (𝐺 ↾ {(𝑁 + 1)})))
97 simpl 102 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝑁 ∈ ℕ0)
9897, 20syl6eleq 2130 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝑁 ∈ (ℤ‘(1 − 1)))
9915, 98, 22sylancr 393 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (1...(𝑁 + 1)) = ((1...𝑁) ∪ {(𝑁 + 1)}))
10099reseq2d 4612 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐺 ↾ (1...(𝑁 + 1))) = (𝐺 ↾ ((1...𝑁) ∪ {(𝑁 + 1)})))
101 resundi 4625 . . . . 5 (𝐺 ↾ ((1...𝑁) ∪ {(𝑁 + 1)})) = ((𝐺 ↾ (1...𝑁)) ∪ (𝐺 ↾ {(𝑁 + 1)}))
102100, 101syl6req 2089 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → ((𝐺 ↾ (1...𝑁)) ∪ (𝐺 ↾ {(𝑁 + 1)})) = (𝐺 ↾ (1...(𝑁 + 1))))
103 fnresdm 5008 . . . . 5 (𝐺 Fn (1...(𝑁 + 1)) → (𝐺 ↾ (1...(𝑁 + 1))) = 𝐺)
10472, 87, 1033syl 17 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐺 ↾ (1...(𝑁 + 1))) = 𝐺)
10596, 102, 1043eqtrrd 2077 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → 𝐺 = (𝐹𝐻))
10678, 86, 1053jca 1084 . 2 ((𝑁 ∈ ℕ0 ∧ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))) → (𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻)))
10771, 106impbida 528 1 (𝑁 ∈ ℕ0 → ((𝐹:(1...𝑁)⟶𝐴𝐵𝐴𝐺 = (𝐹𝐻)) ↔ (𝐺:(1...(𝑁 + 1))⟶𝐴 ∧ (𝐺‘(𝑁 + 1)) = 𝐵𝐹 = (𝐺 ↾ (1...𝑁)))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97  wb 98  w3a 885   = wceq 1243  wcel 1393  cun 2915  cin 2916  wss 2917  c0 3224  {csn 3375  cop 3378  cres 4347   Fn wfn 4897  wf 4898  cfv 4902  (class class class)co 5512  0cc0 6887  1c1 6888   + caddc 6890  cmin 7180  cn 7912  0cn0 8179  cz 8243  cuz 8471  ...cfz 8872
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311  ax-cnex 6973  ax-resscn 6974  ax-1cn 6975  ax-1re 6976  ax-icn 6977  ax-addcl 6978  ax-addrcl 6979  ax-mulcl 6980  ax-addcom 6982  ax-addass 6984  ax-distr 6986  ax-i2m1 6987  ax-0id 6990  ax-rnegex 6991  ax-cnre 6993  ax-pre-ltirr 6994  ax-pre-ltwlin 6995  ax-pre-lttrn 6996  ax-pre-apti 6997  ax-pre-ltadd 6998
This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-nel 2207  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-riota 5468  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-2o 6002  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6400  df-pli 6401  df-mi 6402  df-lti 6403  df-plpq 6440  df-mpq 6441  df-enq 6443  df-nqqs 6444  df-plqqs 6445  df-mqqs 6446  df-1nqqs 6447  df-rq 6448  df-ltnqqs 6449  df-enq0 6520  df-nq0 6521  df-0nq0 6522  df-plq0 6523  df-mq0 6524  df-inp 6562  df-i1p 6563  df-iplp 6564  df-iltp 6566  df-enr 6809  df-nr 6810  df-ltr 6813  df-0r 6814  df-1r 6815  df-0 6894  df-1 6895  df-r 6897  df-lt 6900  df-pnf 7060  df-mnf 7061  df-xr 7062  df-ltxr 7063  df-le 7064  df-sub 7182  df-neg 7183  df-inn 7913  df-n0 8180  df-z 8244  df-uz 8472  df-fz 8873
This theorem is referenced by:  fseq1m1p1  8955
  Copyright terms: Public domain W3C validator