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

Theorem phtpyi 25030
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 25027 . . . 4 (𝜑 → (𝐻 ∈ (𝐹(PHtpy‘𝐽)𝐺) ↔ (𝐻 ∈ (𝐹(II Htpy 𝐽)𝐺) ∧ ∀𝑠 ∈ (0[,]1)((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1)))))
51, 4mpbid 232 . . 3 (𝜑 → (𝐻 ∈ (𝐹(II Htpy 𝐽)𝐺) ∧ ∀𝑠 ∈ (0[,]1)((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1))))
65simprd 495 . 2 (𝜑 → ∀𝑠 ∈ (0[,]1)((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1)))
7 oveq2 7439 . . . . 5 (𝑠 = 𝐴 → (0𝐻𝑠) = (0𝐻𝐴))
87eqeq1d 2737 . . . 4 (𝑠 = 𝐴 → ((0𝐻𝑠) = (𝐹‘0) ↔ (0𝐻𝐴) = (𝐹‘0)))
9 oveq2 7439 . . . . 5 (𝑠 = 𝐴 → (1𝐻𝑠) = (1𝐻𝐴))
109eqeq1d 2737 . . . 4 (𝑠 = 𝐴 → ((1𝐻𝑠) = (𝐹‘1) ↔ (1𝐻𝐴) = (𝐹‘1)))
118, 10anbi12d 632 . . 3 (𝑠 = 𝐴 → (((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1)) ↔ ((0𝐻𝐴) = (𝐹‘0) ∧ (1𝐻𝐴) = (𝐹‘1))))
1211rspccva 3621 . 2 ((∀𝑠 ∈ (0[,]1)((0𝐻𝑠) = (𝐹‘0) ∧ (1𝐻𝑠) = (𝐹‘1)) ∧ 𝐴 ∈ (0[,]1)) → ((0𝐻𝐴) = (𝐹‘0) ∧ (1𝐻𝐴) = (𝐹‘1)))
136, 12sylan 580 1 ((𝜑𝐴 ∈ (0[,]1)) → ((0𝐻𝐴) = (𝐹‘0) ∧ (1𝐻𝐴) = (𝐹‘1)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  wral 3059  cfv 6563  (class class class)co 7431  0cc0 11153  1c1 11154  [,]cicc 13387   Cn ccn 23248  IIcii 24915   Htpy chtpy 25013  PHtpycphtpy 25014
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-map 8867  df-top 22916  df-topon 22933  df-cn 23251  df-phtpy 25017
This theorem is referenced by:  phtpy01  25031  phtpycom  25034  phtpyco2  25036  phtpycc  25037  pcohtpylem  25066  txsconnlem  35225  cvmliftphtlem  35302  cvmliftpht  35303
  Copyright terms: Public domain W3C validator