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 48498
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 48497 . . 3 (𝑀 ∈ ℕ → (𝑃 ∈ (RePart‘𝑀) ↔ (𝑃 ∈ (ℝ* ↑m (0...𝑀)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑃‘𝑖) < (𝑃‘(𝑖 + 1)))))
2 fveq2 6885 . . . . . . 7 (𝑖 = 𝐼 → (𝑃‘𝑖) = (𝑃‘𝐼))
3 fvoveq1 7443 . . . . . . 7 (𝑖 = 𝐼 → (𝑃‘(𝑖 + 1)) = (𝑃‘(𝐼 + 1)))
42, 3breq12d 5116 . . . . . 6 (𝑖 = 𝐼 → ((𝑃‘𝑖) < (𝑃‘(𝑖 + 1)) ↔ (𝑃‘𝐼) < (𝑃‘(𝐼 + 1))))
54rspccv 3574 . . . . 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 3077   class class class wbr 5103  ‘cfv 6538  (class class class)co 7420   ↑m cmap 8847  0cc0 11200  1c1 11201   + caddc 11203  ℝ*cxr 11342   < clt 11343  ℕcn 12335  ...cfz 13639  ..^cfzo 13788  RePartciccp 48494
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-iccp 48495
This theorem is used by:  iccpartgtprec  48501  iccpartipre  48502  iccpartiltu  48503  iccpartigtl  48504  iccpartlt  48505  iccpartgt  48508
  Copyright terms: Public domain W3C validator