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 48638
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 48637 . . 3 (𝑀 ∈ ℕ → (𝑃 ∈ (RePart‘𝑀) ↔ (𝑃 ∈ (ℝ* ↑m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))))
2 fveq2 6893 . . . . . . 7 (𝑖 = 𝐼 → (𝑃‘𝑖) = (𝑃‘𝐼))
3 fvoveq1 7450 . . . . . . 7 (𝑖 = 𝐼 → (𝑃‘(𝑖 + 1)) = (𝑃‘(𝐼 + 1)))
42, 3breq12d 5118 . . . . . 6 (𝑖 = 𝐼 → ((𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) ↔ (𝑃‘𝐼) < (𝑃‘(𝐼 + 1))))
54rspccv 3576 . . . . 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 1569   ∈ wcel 2146  ∀wral 3079   class class class wbr 5105  ‘cfv 6546  (class class class)co 7427   ↑m cmap 8858  0cc0 11210  1c1 11211   + caddc 11213  ℝ*cxr 11352   < clt 11353  ℕcn 12345  ...cfz 13649  ..^cfzo 13798  RePartciccp 48634
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pr 5394
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-iota 6500  df-fun 6548  df-fv 6554  df-ov 7430  df-iccp 48635
This theorem is used by:  iccpartgtprec  48641  iccpartipre  48642  iccpartiltu  48643  iccpartigtl  48644  iccpartlt  48645  iccpartgt  48648
  Copyright terms: Public domain W3C validator