MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axcontlem1 Structured version   Visualization version   GIF version

Theorem axcontlem1 29551
Description: Lemma for axcont 29563. Change bound variables for later use. (Contributed by Scott Fenton, 20-Jun-2013.)
Hypothesis
Ref Expression
axcontlem1.1 𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥 ∈ 𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥‘𝑖) = (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖)))))}
Assertion
Ref Expression
axcontlem1 𝐹 = {⟨𝑦, 𝑠⟩ ∣ (𝑦 ∈ 𝐷 ∧ (𝑠 ∈ (0[,)+∞) ∧ ∀𝑗 ∈ (1...𝑁)(𝑦‘𝑗) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗)))))}
Distinct variable groups:   𝐷,𝑠,𝑡,𝑥,𝑦   𝑖,𝑗,𝑠,𝑡,𝑥,𝑦,𝑁   𝑈,𝑖,𝑗,𝑠,𝑡,𝑥,𝑦   𝑖,𝑍,𝑗,𝑠,𝑡,𝑥,𝑦
Allowed substitution hints:   𝐷(𝑖, 𝑗)   𝐹(𝑥, 𝑦, 𝑡, 𝑖, 𝑗, 𝑠)

Proof of Theorem axcontlem1
StepHypRef Expression
1 axcontlem1.1 . 2 𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥 ∈ 𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥‘𝑖) = (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖)))))}
2 eleq1w 2843 . . . . 5 (𝑥 = 𝑦 → (𝑥 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷))
32adantr 486 . . . 4 ((𝑥 = 𝑦 ∧ 𝑡 = 𝑠) → (𝑥 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷))
4 eleq1w 2843 . . . . . 6 (𝑡 = 𝑠 → (𝑡 ∈ (0[,)+∞) ↔ 𝑠 ∈ (0[,)+∞)))
54adantl 487 . . . . 5 ((𝑥 = 𝑦 ∧ 𝑡 = 𝑠) → (𝑡 ∈ (0[,)+∞) ↔ 𝑠 ∈ (0[,)+∞)))
6 fveq1 6889 . . . . . . . 8 (𝑥 = 𝑦 → (𝑥‘𝑖) = (𝑦‘𝑖))
7 oveq2 7432 . . . . . . . . . 10 (𝑡 = 𝑠 → (1 − 𝑡) = (1 − 𝑠))
87oveq1d 7439 . . . . . . . . 9 (𝑡 = 𝑠 → ((1 − 𝑡) · (𝑍‘𝑖)) = ((1 − 𝑠) · (𝑍‘𝑖)))
9 oveq1 7431 . . . . . . . . 9 (𝑡 = 𝑠 → (𝑡 · (𝑈‘𝑖)) = (𝑠 · (𝑈‘𝑖)))
108, 9oveq12d 7442 . . . . . . . 8 (𝑡 = 𝑠 → (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖))) = (((1 − 𝑠) · (𝑍‘𝑖)) + (𝑠 · (𝑈‘𝑖))))
116, 10eqeqan12d 2774 . . . . . . 7 ((𝑥 = 𝑦 ∧ 𝑡 = 𝑠) → ((𝑥‘𝑖) = (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖))) ↔ (𝑦‘𝑖) = (((1 − 𝑠) · (𝑍‘𝑖)) + (𝑠 · (𝑈‘𝑖)))))
1211ralbidv 3185 . . . . . 6 ((𝑥 = 𝑦 ∧ 𝑡 = 𝑠) → (∀𝑖 ∈ (1...𝑁)(𝑥‘𝑖) = (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖))) ↔ ∀𝑖 ∈ (1...𝑁)(𝑦‘𝑖) = (((1 − 𝑠) · (𝑍‘𝑖)) + (𝑠 · (𝑈‘𝑖)))))
13 fveq2 6890 . . . . . . . 8 (𝑖 = 𝑗 → (𝑦‘𝑖) = (𝑦‘𝑗))
14 fveq2 6890 . . . . . . . . . 10 (𝑖 = 𝑗 → (𝑍‘𝑖) = (𝑍‘𝑗))
1514oveq2d 7440 . . . . . . . . 9 (𝑖 = 𝑗 → ((1 − 𝑠) · (𝑍‘𝑖)) = ((1 − 𝑠) · (𝑍‘𝑗)))
16 fveq2 6890 . . . . . . . . . 10 (𝑖 = 𝑗 → (𝑈‘𝑖) = (𝑈‘𝑗))
1716oveq2d 7440 . . . . . . . . 9 (𝑖 = 𝑗 → (𝑠 · (𝑈‘𝑖)) = (𝑠 · (𝑈‘𝑗)))
1815, 17oveq12d 7442 . . . . . . . 8 (𝑖 = 𝑗 → (((1 − 𝑠) · (𝑍‘𝑖)) + (𝑠 · (𝑈‘𝑖))) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗))))
1913, 18eqeq12d 2776 . . . . . . 7 (𝑖 = 𝑗 → ((𝑦‘𝑖) = (((1 − 𝑠) · (𝑍‘𝑖)) + (𝑠 · (𝑈‘𝑖))) ↔ (𝑦‘𝑗) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗)))))
2019cbvralvw 3240 . . . . . 6 (∀𝑖 ∈ (1...𝑁)(𝑦‘𝑖) = (((1 − 𝑠) · (𝑍‘𝑖)) + (𝑠 · (𝑈‘𝑖))) ↔ ∀𝑗 ∈ (1...𝑁)(𝑦‘𝑗) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗))))
2112, 20bitrdi 290 . . . . 5 ((𝑥 = 𝑦 ∧ 𝑡 = 𝑠) → (∀𝑖 ∈ (1...𝑁)(𝑥‘𝑖) = (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖))) ↔ ∀𝑗 ∈ (1...𝑁)(𝑦‘𝑗) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗)))))
225, 21anbi12d 644 . . . 4 ((𝑥 = 𝑦 ∧ 𝑡 = 𝑠) → ((𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥‘𝑖) = (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖)))) ↔ (𝑠 ∈ (0[,)+∞) ∧ ∀𝑗 ∈ (1...𝑁)(𝑦‘𝑗) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗))))))
233, 22anbi12d 644 . . 3 ((𝑥 = 𝑦 ∧ 𝑡 = 𝑠) → ((𝑥 ∈ 𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥‘𝑖) = (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖))))) ↔ (𝑦 ∈ 𝐷 ∧ (𝑠 ∈ (0[,)+∞) ∧ ∀𝑗 ∈ (1...𝑁)(𝑦‘𝑗) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗)))))))
2423cbvopabv 5177 . 2 {⟨𝑥, 𝑡⟩ ∣ (𝑥 ∈ 𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥‘𝑖) = (((1 − 𝑡) · (𝑍‘𝑖)) + (𝑡 · (𝑈‘𝑖)))))} = {⟨𝑦, 𝑠⟩ ∣ (𝑦 ∈ 𝐷 ∧ (𝑠 ∈ (0[,)+∞) ∧ ∀𝑗 ∈ (1...𝑁)(𝑦‘𝑗) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗)))))}
251, 24eqtri 2783 1 𝐹 = {⟨𝑦, 𝑠⟩ ∣ (𝑦 ∈ 𝐷 ∧ (𝑠 ∈ (0[,)+∞) ∧ ∀𝑗 ∈ (1...𝑁)(𝑦‘𝑗) = (((1 − 𝑠) · (𝑍‘𝑗)) + (𝑠 · (𝑈‘𝑗)))))}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {copab 5166  ‘cfv 6543  (class class class)co 7424  0cc0 11207  1c1 11208   + caddc 11210   · cmul 11212  +∞cpnf 11347   − cmin 11548  [,)cico 13485  ...cfz 13646
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-iota 6497  df-fv 6551  df-ov 7427
This theorem is used by:  axcontlem6  29556  axcontlem11  29561
  Copyright terms: Public domain W3C validator