Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iccpartimp Structured version   Visualization version   GIF version

Theorem iccpartimp 48199
Description: Implications for a class being a partition. (Contributed by AV, 11-Jul-2020.)
Assertion
Ref Expression
iccpartimp ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 𝐼 ∈ (0..^𝑀)) → (𝑃 ∈ (ℝ*m (0...𝑀)) ∧ (𝑃𝐼) < (𝑃‘(𝐼 + 1))))

Proof of Theorem iccpartimp
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 iccpart 48198 . . 3 (𝑀 ∈ ℕ → (𝑃 ∈ (RePart‘𝑀) ↔ (𝑃 ∈ (ℝ*m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑃𝑖) < (𝑃‘(𝑖 + 1)))))
2 fveq2 6885 . . . . . . 7 (𝑖 = 𝐼 → (𝑃𝑖) = (𝑃𝐼))
3 fvoveq1 7439 . . . . . . 7 (𝑖 = 𝐼 → (𝑃‘(𝑖 + 1)) = (𝑃‘(𝐼 + 1)))
42, 3breq12d 5124 . . . . . 6 (𝑖 = 𝐼 → ((𝑃𝑖) < (𝑃‘(𝑖 + 1)) ↔ (𝑃𝐼) < (𝑃‘(𝐼 + 1))))
54rspccv 3580 . . . . 5 (∀𝑖 ∈ (0..^𝑀)(𝑃𝑖) < (𝑃‘(𝑖 + 1)) → (𝐼 ∈ (0..^𝑀) → (𝑃𝐼) < (𝑃‘(𝐼 + 1))))
65adantl 487 . . . 4 ((𝑃 ∈ (ℝ*m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑃𝑖) < (𝑃‘(𝑖 + 1))) → (𝐼 ∈ (0..^𝑀) → (𝑃𝐼) < (𝑃‘(𝐼 + 1))))
7 simpl 488 . . . 4 ((𝑃 ∈ (ℝ*m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑃𝑖) < (𝑃‘(𝑖 + 1))) → 𝑃 ∈ (ℝ*m (0...𝑀)))
86, 7jctild 535 . . 3 ((𝑃 ∈ (ℝ*m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑃𝑖) < (𝑃‘(𝑖 + 1))) → (𝐼 ∈ (0..^𝑀) → (𝑃 ∈ (ℝ*m (0...𝑀)) ∧ (𝑃𝐼) < (𝑃‘(𝐼 + 1)))))
91, 8biimtrdi 256 . 2 (𝑀 ∈ ℕ → (𝑃 ∈ (RePart‘𝑀) → (𝐼 ∈ (0..^𝑀) → (𝑃 ∈ (ℝ*m (0...𝑀)) ∧ (𝑃𝐼) < (𝑃‘(𝐼 + 1))))))
1093imp 1128 1 ((𝑀 ∈ ℕ ∧ 𝑃 ∈ (RePart‘𝑀) ∧ 𝐼 ∈ (0..^𝑀)) → (𝑃 ∈ (ℝ*m (0...𝑀)) ∧ (𝑃𝐼) < (𝑃‘(𝐼 + 1))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2146  wral 3081   class class class wbr 5111  cfv 6540  (class class class)co 7416  m cmap 8826  0cc0 11111  1c1 11112   + caddc 11114  *cxr 11253   < clt 11254  cn 12244  ...cfz 13547  ..^cfzo 13695  RePartciccp 48195
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7419  df-iccp 48196
This theorem is used by:  iccpartgtprec  48202  iccpartipre  48203  iccpartiltu  48204  iccpartigtl  48205  iccpartlt  48206  iccpartgt  48209
  Copyright terms: Public domain W3C validator