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

Theorem phtpyi 25194
Description: Membership in the class of path homotopies between two continuous functions. (Contributed by Mario Carneiro, 23-Feb-2015.)
Hypotheses
Ref Expression
isphtpy.2 (𝜑𝐹 ∈ (II Cn 𝐽))
isphtpy.3 (𝜑𝐺 ∈ (II Cn 𝐽))
phtpyi.1 (𝜑𝐻 ∈ (𝐹(PHtpy‘𝐽)𝐺))
Assertion
Ref Expression
phtpyi ((𝜑𝐴 ∈ (0[,]1)) → ((0𝐻𝐴) = (𝐹‘0) ∧ (1𝐻𝐴) = (𝐹‘1)))

Proof of Theorem phtpyi
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 phtpyi.1 . . . 4 (𝜑𝐻 ∈ (𝐹(PHtpy‘𝐽)𝐺))
2 isphtpy.2 . . . . 5 (𝜑𝐹 ∈ (II Cn 𝐽))
3 isphtpy.3 . . . . 5 (𝜑𝐺 ∈ (II Cn 𝐽))
42, 3isphtpy 25191 . . . 4 (𝜑 → (𝐻 ∈ (𝐹(PHtpy‘𝐽)𝐺) ↔ (𝐻 ∈ (𝐹(II Htpy 𝐽)𝐺) ∧ ∀𝑠 ∈ (0[,]1)((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1)))))
51, 4mpbid 235 . . 3 (𝜑 → (𝐻 ∈ (𝐹(II Htpy 𝐽)𝐺) ∧ ∀𝑠 ∈ (0[,]1)((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1))))
65simprd 501 . 2 (𝜑 → ∀𝑠 ∈ (0[,]1)((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1)))
7 oveq2 7427 . . . . 5 (𝑠 = 𝐴 → (0𝐻𝑠) = (0𝐻𝐴))
87eqeq1d 2767 . . . 4 (𝑠 = 𝐴 → ((0𝐻𝑠) = (𝐹‘0) ↔ (0𝐻𝐴) = (𝐹‘0)))
9 oveq2 7427 . . . . 5 (𝑠 = 𝐴 → (1𝐻𝑠) = (1𝐻𝐴))
109eqeq1d 2767 . . . 4 (𝑠 = 𝐴 → ((1𝐻𝑠) = (𝐹‘1) ↔ (1𝐻𝐴) = (𝐹‘1)))
118, 10anbi12d 644 . . 3 (𝑠 = 𝐴 → (((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1)) ↔ ((0𝐻𝐴) = (𝐹‘0) ∧ (1𝐻𝐴) = (𝐹‘1))))
1211rspccva 3582 . 2 ((∀𝑠 ∈ (0[,]1)((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1)) ∧ 𝐴 ∈ (0[,]1)) → ((0𝐻𝐴) = (𝐹‘0) ∧ (1𝐻𝐴) = (𝐹‘1)))
136, 12sylan 592 1 ((𝜑𝐴 ∈ (0[,]1)) → ((0𝐻𝐴) = (𝐹‘0) ∧ (1𝐻𝐴) = (𝐹‘1)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  wral 3081  cfv 6540  (class class class)co 7419  0cc0 11115  1c1 11116  [,]cicc 13391   Cn ccn 23431  IIcii 25085   Htpy chtpy 25177  PHtpycphtpy 25178
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-map 8832  df-top 23101  df-topon 23118  df-cn 23434  df-phtpy 25181
This theorem is used by:  phtpy01  25195  phtpycom  25198  phtpyco2  25200  phtpycc  25201  pcohtpylem  25229  txsconnlem  35769  cvmliftphtlem  35846  cvmliftpht  35847
  Copyright terms: Public domain W3C validator