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 48320
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 48319 . . 3 (𝑀 ∈ ℕ → (𝑃 ∈ (RePart‘𝑀) ↔ (𝑃 ∈ (ℝ*m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑃𝑖) < (𝑃‘(𝑖 + 1)))))
2 fveq2 6879 . . . . . . 7 (𝑖 = 𝐼 → (𝑃𝑖) = (𝑃𝐼))
3 fvoveq1 7437 . . . . . . 7 (𝑖 = 𝐼 → (𝑃‘(𝑖 + 1)) = (𝑃‘(𝐼 + 1)))
42, 3breq12d 5116 . . . . . 6 (𝑖 = 𝐼 → ((𝑃𝑖) < (𝑃‘(𝑖 + 1)) ↔ (𝑃𝐼) < (𝑃‘(𝐼 + 1))))
54rspccv 3573 . . . . 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 2145  wral 3076   class class class wbr 5103  cfv 6533  (class class class)co 7414  m cmap 8829  0cc0 11127  1c1 11128   + caddc 11130  *cxr 11269   < clt 11270  cn 12260  ...cfz 13564  ..^cfzo 13712  RePartciccp 48316
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417  df-iccp 48317
This theorem is used by:  iccpartgtprec  48323  iccpartipre  48324  iccpartiltu  48325  iccpartigtl  48326  iccpartlt  48327  iccpartgt  48330
  Copyright terms: Public domain W3C validator