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 48772
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 48771 . . 3 (𝑀 ∈ ℕ → (𝑃 ∈ (RePart‘𝑀) ↔ (𝑃 ∈ (ℝ* ↑m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))))
2 fveq2 6916 . . . . . . 7 (𝑖 = 𝐼 → (𝑃‘𝑖) = (𝑃‘𝐼))
3 fvoveq1 7474 . . . . . . 7 (𝑖 = 𝐼 → (𝑃‘(𝑖 + 1)) = (𝑃‘(𝐼 + 1)))
42, 3breq12d 5121 . . . . . 6 (𝑖 = 𝐼 → ((𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) ↔ (𝑃‘𝐼) < (𝑃‘(𝐼 + 1))))
54rspccv 3577 . . . . 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 2147  ∀wral 3080   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451   ↑m cmap 8885  0cc0 11239  1c1 11240   + caddc 11242  ℝ*cxr 11381   < clt 11382  ℕcn 12375  ...cfz 13679  ..^cfzo 13828  RePartciccp 48768
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-iccp 48769
This theorem is used by:  iccpartgtprec  48775  iccpartipre  48776  iccpartiltu  48777  iccpartigtl  48778  iccpartlt  48779  iccpartgt  48782
  Copyright terms: Public domain W3C validator