Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iuninc Structured version   Visualization version   GIF version

Theorem iuninc 29265
 Description: The union of an increasing collection of sets is its last element. (Contributed by Thierry Arnoux, 22-Jan-2017.)
Hypotheses
Ref Expression
iuninc.1 (𝜑𝐹 Fn ℕ)
iuninc.2 ((𝜑𝑛 ∈ ℕ) → (𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1)))
Assertion
Ref Expression
iuninc ((𝜑𝑖 ∈ ℕ) → 𝑛 ∈ (1...𝑖)(𝐹𝑛) = (𝐹𝑖))
Distinct variable groups:   𝑖,𝑛   𝑛,𝐹   𝜑,𝑛
Allowed substitution hints:   𝜑(𝑖)   𝐹(𝑖)

Proof of Theorem iuninc
Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 6623 . . . . . 6 (𝑗 = 1 → (1...𝑗) = (1...1))
21iuneq1d 4518 . . . . 5 (𝑗 = 1 → 𝑛 ∈ (1...𝑗)(𝐹𝑛) = 𝑛 ∈ (1...1)(𝐹𝑛))
3 fveq2 6158 . . . . 5 (𝑗 = 1 → (𝐹𝑗) = (𝐹‘1))
42, 3eqeq12d 2636 . . . 4 (𝑗 = 1 → ( 𝑛 ∈ (1...𝑗)(𝐹𝑛) = (𝐹𝑗) ↔ 𝑛 ∈ (1...1)(𝐹𝑛) = (𝐹‘1)))
54imbi2d 330 . . 3 (𝑗 = 1 → ((𝜑 𝑛 ∈ (1...𝑗)(𝐹𝑛) = (𝐹𝑗)) ↔ (𝜑 𝑛 ∈ (1...1)(𝐹𝑛) = (𝐹‘1))))
6 oveq2 6623 . . . . . 6 (𝑗 = 𝑘 → (1...𝑗) = (1...𝑘))
76iuneq1d 4518 . . . . 5 (𝑗 = 𝑘 𝑛 ∈ (1...𝑗)(𝐹𝑛) = 𝑛 ∈ (1...𝑘)(𝐹𝑛))
8 fveq2 6158 . . . . 5 (𝑗 = 𝑘 → (𝐹𝑗) = (𝐹𝑘))
97, 8eqeq12d 2636 . . . 4 (𝑗 = 𝑘 → ( 𝑛 ∈ (1...𝑗)(𝐹𝑛) = (𝐹𝑗) ↔ 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)))
109imbi2d 330 . . 3 (𝑗 = 𝑘 → ((𝜑 𝑛 ∈ (1...𝑗)(𝐹𝑛) = (𝐹𝑗)) ↔ (𝜑 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘))))
11 oveq2 6623 . . . . . 6 (𝑗 = (𝑘 + 1) → (1...𝑗) = (1...(𝑘 + 1)))
1211iuneq1d 4518 . . . . 5 (𝑗 = (𝑘 + 1) → 𝑛 ∈ (1...𝑗)(𝐹𝑛) = 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛))
13 fveq2 6158 . . . . 5 (𝑗 = (𝑘 + 1) → (𝐹𝑗) = (𝐹‘(𝑘 + 1)))
1412, 13eqeq12d 2636 . . . 4 (𝑗 = (𝑘 + 1) → ( 𝑛 ∈ (1...𝑗)(𝐹𝑛) = (𝐹𝑗) ↔ 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛) = (𝐹‘(𝑘 + 1))))
1514imbi2d 330 . . 3 (𝑗 = (𝑘 + 1) → ((𝜑 𝑛 ∈ (1...𝑗)(𝐹𝑛) = (𝐹𝑗)) ↔ (𝜑 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛) = (𝐹‘(𝑘 + 1)))))
16 oveq2 6623 . . . . . 6 (𝑗 = 𝑖 → (1...𝑗) = (1...𝑖))
1716iuneq1d 4518 . . . . 5 (𝑗 = 𝑖 𝑛 ∈ (1...𝑗)(𝐹𝑛) = 𝑛 ∈ (1...𝑖)(𝐹𝑛))
18 fveq2 6158 . . . . 5 (𝑗 = 𝑖 → (𝐹𝑗) = (𝐹𝑖))
1917, 18eqeq12d 2636 . . . 4 (𝑗 = 𝑖 → ( 𝑛 ∈ (1...𝑗)(𝐹𝑛) = (𝐹𝑗) ↔ 𝑛 ∈ (1...𝑖)(𝐹𝑛) = (𝐹𝑖)))
2019imbi2d 330 . . 3 (𝑗 = 𝑖 → ((𝜑 𝑛 ∈ (1...𝑗)(𝐹𝑛) = (𝐹𝑗)) ↔ (𝜑 𝑛 ∈ (1...𝑖)(𝐹𝑛) = (𝐹𝑖))))
21 1z 11367 . . . . . . 7 1 ∈ ℤ
22 fzsn 12341 . . . . . . 7 (1 ∈ ℤ → (1...1) = {1})
2321, 22ax-mp 5 . . . . . 6 (1...1) = {1}
24 iuneq1 4507 . . . . . 6 ((1...1) = {1} → 𝑛 ∈ (1...1)(𝐹𝑛) = 𝑛 ∈ {1} (𝐹𝑛))
2523, 24ax-mp 5 . . . . 5 𝑛 ∈ (1...1)(𝐹𝑛) = 𝑛 ∈ {1} (𝐹𝑛)
26 1ex 9995 . . . . . 6 1 ∈ V
27 fveq2 6158 . . . . . 6 (𝑛 = 1 → (𝐹𝑛) = (𝐹‘1))
2826, 27iunxsn 4576 . . . . 5 𝑛 ∈ {1} (𝐹𝑛) = (𝐹‘1)
2925, 28eqtri 2643 . . . 4 𝑛 ∈ (1...1)(𝐹𝑛) = (𝐹‘1)
3029a1i 11 . . 3 (𝜑 𝑛 ∈ (1...1)(𝐹𝑛) = (𝐹‘1))
31 simpll 789 . . . . . . 7 (((𝑘 ∈ ℕ ∧ 𝜑) ∧ 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)) → 𝑘 ∈ ℕ)
32 elnnuz 11684 . . . . . . . . . 10 (𝑘 ∈ ℕ ↔ 𝑘 ∈ (ℤ‘1))
33 fzsuc 12346 . . . . . . . . . 10 (𝑘 ∈ (ℤ‘1) → (1...(𝑘 + 1)) = ((1...𝑘) ∪ {(𝑘 + 1)}))
3432, 33sylbi 207 . . . . . . . . 9 (𝑘 ∈ ℕ → (1...(𝑘 + 1)) = ((1...𝑘) ∪ {(𝑘 + 1)}))
3534iuneq1d 4518 . . . . . . . 8 (𝑘 ∈ ℕ → 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛) = 𝑛 ∈ ((1...𝑘) ∪ {(𝑘 + 1)})(𝐹𝑛))
36 iunxun 4578 . . . . . . . . 9 𝑛 ∈ ((1...𝑘) ∪ {(𝑘 + 1)})(𝐹𝑛) = ( 𝑛 ∈ (1...𝑘)(𝐹𝑛) ∪ 𝑛 ∈ {(𝑘 + 1)} (𝐹𝑛))
37 ovex 6643 . . . . . . . . . . 11 (𝑘 + 1) ∈ V
38 fveq2 6158 . . . . . . . . . . 11 (𝑛 = (𝑘 + 1) → (𝐹𝑛) = (𝐹‘(𝑘 + 1)))
3937, 38iunxsn 4576 . . . . . . . . . 10 𝑛 ∈ {(𝑘 + 1)} (𝐹𝑛) = (𝐹‘(𝑘 + 1))
4039uneq2i 3748 . . . . . . . . 9 ( 𝑛 ∈ (1...𝑘)(𝐹𝑛) ∪ 𝑛 ∈ {(𝑘 + 1)} (𝐹𝑛)) = ( 𝑛 ∈ (1...𝑘)(𝐹𝑛) ∪ (𝐹‘(𝑘 + 1)))
4136, 40eqtri 2643 . . . . . . . 8 𝑛 ∈ ((1...𝑘) ∪ {(𝑘 + 1)})(𝐹𝑛) = ( 𝑛 ∈ (1...𝑘)(𝐹𝑛) ∪ (𝐹‘(𝑘 + 1)))
4235, 41syl6eq 2671 . . . . . . 7 (𝑘 ∈ ℕ → 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛) = ( 𝑛 ∈ (1...𝑘)(𝐹𝑛) ∪ (𝐹‘(𝑘 + 1))))
4331, 42syl 17 . . . . . 6 (((𝑘 ∈ ℕ ∧ 𝜑) ∧ 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)) → 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛) = ( 𝑛 ∈ (1...𝑘)(𝐹𝑛) ∪ (𝐹‘(𝑘 + 1))))
44 simpr 477 . . . . . . 7 (((𝑘 ∈ ℕ ∧ 𝜑) ∧ 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)) → 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘))
4544uneq1d 3750 . . . . . 6 (((𝑘 ∈ ℕ ∧ 𝜑) ∧ 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)) → ( 𝑛 ∈ (1...𝑘)(𝐹𝑛) ∪ (𝐹‘(𝑘 + 1))) = ((𝐹𝑘) ∪ (𝐹‘(𝑘 + 1))))
46 simplr 791 . . . . . . 7 (((𝑘 ∈ ℕ ∧ 𝜑) ∧ 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)) → 𝜑)
47 iuninc.2 . . . . . . . . . 10 ((𝜑𝑛 ∈ ℕ) → (𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1)))
4847sbt 2418 . . . . . . . . 9 [𝑘 / 𝑛]((𝜑𝑛 ∈ ℕ) → (𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1)))
49 sbim 2394 . . . . . . . . . 10 ([𝑘 / 𝑛]((𝜑𝑛 ∈ ℕ) → (𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1))) ↔ ([𝑘 / 𝑛](𝜑𝑛 ∈ ℕ) → [𝑘 / 𝑛](𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1))))
50 sban 2398 . . . . . . . . . . . 12 ([𝑘 / 𝑛](𝜑𝑛 ∈ ℕ) ↔ ([𝑘 / 𝑛]𝜑 ∧ [𝑘 / 𝑛]𝑛 ∈ ℕ))
51 nfv 1840 . . . . . . . . . . . . . 14 𝑛𝜑
5251sbf 2379 . . . . . . . . . . . . 13 ([𝑘 / 𝑛]𝜑𝜑)
53 clelsb3 2726 . . . . . . . . . . . . 13 ([𝑘 / 𝑛]𝑛 ∈ ℕ ↔ 𝑘 ∈ ℕ)
5452, 53anbi12i 732 . . . . . . . . . . . 12 (([𝑘 / 𝑛]𝜑 ∧ [𝑘 / 𝑛]𝑛 ∈ ℕ) ↔ (𝜑𝑘 ∈ ℕ))
5550, 54bitr2i 265 . . . . . . . . . . 11 ((𝜑𝑘 ∈ ℕ) ↔ [𝑘 / 𝑛](𝜑𝑛 ∈ ℕ))
56 sbsbc 3426 . . . . . . . . . . . 12 ([𝑘 / 𝑛](𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1)) ↔ [𝑘 / 𝑛](𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1)))
57 vex 3193 . . . . . . . . . . . . 13 𝑘 ∈ V
58 sbcssg 4063 . . . . . . . . . . . . 13 (𝑘 ∈ V → ([𝑘 / 𝑛](𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1)) ↔ 𝑘 / 𝑛(𝐹𝑛) ⊆ 𝑘 / 𝑛(𝐹‘(𝑛 + 1))))
5957, 58ax-mp 5 . . . . . . . . . . . 12 ([𝑘 / 𝑛](𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1)) ↔ 𝑘 / 𝑛(𝐹𝑛) ⊆ 𝑘 / 𝑛(𝐹‘(𝑛 + 1)))
60 csbfv 6200 . . . . . . . . . . . . 13 𝑘 / 𝑛(𝐹𝑛) = (𝐹𝑘)
61 csbfv2g 6199 . . . . . . . . . . . . . . 15 (𝑘 ∈ V → 𝑘 / 𝑛(𝐹‘(𝑛 + 1)) = (𝐹𝑘 / 𝑛(𝑛 + 1)))
6257, 61ax-mp 5 . . . . . . . . . . . . . 14 𝑘 / 𝑛(𝐹‘(𝑛 + 1)) = (𝐹𝑘 / 𝑛(𝑛 + 1))
63 csbov1g 6655 . . . . . . . . . . . . . . . 16 (𝑘 ∈ V → 𝑘 / 𝑛(𝑛 + 1) = (𝑘 / 𝑛𝑛 + 1))
6457, 63ax-mp 5 . . . . . . . . . . . . . . 15 𝑘 / 𝑛(𝑛 + 1) = (𝑘 / 𝑛𝑛 + 1)
6564fveq2i 6161 . . . . . . . . . . . . . 14 (𝐹𝑘 / 𝑛(𝑛 + 1)) = (𝐹‘(𝑘 / 𝑛𝑛 + 1))
66 csbvarg 3981 . . . . . . . . . . . . . . . . 17 (𝑘 ∈ V → 𝑘 / 𝑛𝑛 = 𝑘)
6757, 66ax-mp 5 . . . . . . . . . . . . . . . 16 𝑘 / 𝑛𝑛 = 𝑘
6867oveq1i 6625 . . . . . . . . . . . . . . 15 (𝑘 / 𝑛𝑛 + 1) = (𝑘 + 1)
6968fveq2i 6161 . . . . . . . . . . . . . 14 (𝐹‘(𝑘 / 𝑛𝑛 + 1)) = (𝐹‘(𝑘 + 1))
7062, 65, 693eqtri 2647 . . . . . . . . . . . . 13 𝑘 / 𝑛(𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1))
7160, 70sseq12i 3616 . . . . . . . . . . . 12 (𝑘 / 𝑛(𝐹𝑛) ⊆ 𝑘 / 𝑛(𝐹‘(𝑛 + 1)) ↔ (𝐹𝑘) ⊆ (𝐹‘(𝑘 + 1)))
7256, 59, 713bitrri 287 . . . . . . . . . . 11 ((𝐹𝑘) ⊆ (𝐹‘(𝑘 + 1)) ↔ [𝑘 / 𝑛](𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1)))
7355, 72imbi12i 340 . . . . . . . . . 10 (((𝜑𝑘 ∈ ℕ) → (𝐹𝑘) ⊆ (𝐹‘(𝑘 + 1))) ↔ ([𝑘 / 𝑛](𝜑𝑛 ∈ ℕ) → [𝑘 / 𝑛](𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1))))
7449, 73bitr4i 267 . . . . . . . . 9 ([𝑘 / 𝑛]((𝜑𝑛 ∈ ℕ) → (𝐹𝑛) ⊆ (𝐹‘(𝑛 + 1))) ↔ ((𝜑𝑘 ∈ ℕ) → (𝐹𝑘) ⊆ (𝐹‘(𝑘 + 1))))
7548, 74mpbi 220 . . . . . . . 8 ((𝜑𝑘 ∈ ℕ) → (𝐹𝑘) ⊆ (𝐹‘(𝑘 + 1)))
76 ssequn1 3767 . . . . . . . 8 ((𝐹𝑘) ⊆ (𝐹‘(𝑘 + 1)) ↔ ((𝐹𝑘) ∪ (𝐹‘(𝑘 + 1))) = (𝐹‘(𝑘 + 1)))
7775, 76sylib 208 . . . . . . 7 ((𝜑𝑘 ∈ ℕ) → ((𝐹𝑘) ∪ (𝐹‘(𝑘 + 1))) = (𝐹‘(𝑘 + 1)))
7846, 31, 77syl2anc 692 . . . . . 6 (((𝑘 ∈ ℕ ∧ 𝜑) ∧ 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)) → ((𝐹𝑘) ∪ (𝐹‘(𝑘 + 1))) = (𝐹‘(𝑘 + 1)))
7943, 45, 783eqtrd 2659 . . . . 5 (((𝑘 ∈ ℕ ∧ 𝜑) ∧ 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)) → 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛) = (𝐹‘(𝑘 + 1)))
8079exp31 629 . . . 4 (𝑘 ∈ ℕ → (𝜑 → ( 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘) → 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛) = (𝐹‘(𝑘 + 1)))))
8180a2d 29 . . 3 (𝑘 ∈ ℕ → ((𝜑 𝑛 ∈ (1...𝑘)(𝐹𝑛) = (𝐹𝑘)) → (𝜑 𝑛 ∈ (1...(𝑘 + 1))(𝐹𝑛) = (𝐹‘(𝑘 + 1)))))
825, 10, 15, 20, 30, 81nnind 10998 . 2 (𝑖 ∈ ℕ → (𝜑 𝑛 ∈ (1...𝑖)(𝐹𝑛) = (𝐹𝑖)))
8382impcom 446 1 ((𝜑𝑖 ∈ ℕ) → 𝑛 ∈ (1...𝑖)(𝐹𝑛) = (𝐹𝑖))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1480  [wsb 1877   ∈ wcel 1987  Vcvv 3190  [wsbc 3422  ⦋csb 3519   ∪ cun 3558   ⊆ wss 3560  {csn 4155  ∪ ciun 4492   Fn wfn 5852  ‘cfv 5857  (class class class)co 6615  1c1 9897   + caddc 9899  ℕcn 10980  ℤcz 11337  ℤ≥cuz 11647  ...cfz 12284 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914  ax-cnex 9952  ax-resscn 9953  ax-1cn 9954  ax-icn 9955  ax-addcl 9956  ax-addrcl 9957  ax-mulcl 9958  ax-mulrcl 9959  ax-mulcom 9960  ax-addass 9961  ax-mulass 9962  ax-distr 9963  ax-i2m1 9964  ax-1ne0 9965  ax-1rid 9966  ax-rnegex 9967  ax-rrecex 9968  ax-cnre 9969  ax-pre-lttri 9970  ax-pre-lttrn 9971  ax-pre-ltadd 9972  ax-pre-mulgt0 9973 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-fal 1486  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2913  df-rex 2914  df-reu 2915  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-pss 3576  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-tp 4160  df-op 4162  df-uni 4410  df-iun 4494  df-br 4624  df-opab 4684  df-mpt 4685  df-tr 4723  df-eprel 4995  df-id 4999  df-po 5005  df-so 5006  df-fr 5043  df-we 5045  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-pred 5649  df-ord 5695  df-on 5696  df-lim 5697  df-suc 5698  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-riota 6576  df-ov 6618  df-oprab 6619  df-mpt2 6620  df-om 7028  df-1st 7128  df-2nd 7129  df-wrecs 7367  df-recs 7428  df-rdg 7466  df-er 7702  df-en 7916  df-dom 7917  df-sdom 7918  df-pnf 10036  df-mnf 10037  df-xr 10038  df-ltxr 10039  df-le 10040  df-sub 10228  df-neg 10229  df-nn 10981  df-n0 11253  df-z 11338  df-uz 11648  df-fz 12285 This theorem is referenced by:  meascnbl  30105
 Copyright terms: Public domain W3C validator