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

Theorem isphtpc 25039
Description: The relation "is path homotopic to". (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 5-Sep-2015.)
Assertion
Ref Expression
isphtpc (𝐹( ≃ph𝐽)𝐺 ↔ (𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅))

Proof of Theorem isphtpc
Dummy variables 𝑓 𝑔 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 5148 . . 3 (𝐹( ≃ph𝐽)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ ( ≃ph𝐽))
2 df-phtpc 25037 . . . 4 ph = (𝑗 ∈ Top ↦ {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ (II Cn 𝑗) ∧ (𝑓(PHtpy‘𝑗)𝑔) ≠ ∅)})
32mptrcl 7024 . . 3 (⟨𝐹, 𝐺⟩ ∈ ( ≃ph𝐽) → 𝐽 ∈ Top)
41, 3sylbi 217 . 2 (𝐹( ≃ph𝐽)𝐺𝐽 ∈ Top)
5 cntop2 23264 . . 3 (𝐹 ∈ (II Cn 𝐽) → 𝐽 ∈ Top)
653ad2ant1 1132 . 2 ((𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅) → 𝐽 ∈ Top)
7 oveq2 7438 . . . . . . . . 9 (𝑗 = 𝐽 → (II Cn 𝑗) = (II Cn 𝐽))
87sseq2d 4027 . . . . . . . 8 (𝑗 = 𝐽 → ({𝑓, 𝑔} ⊆ (II Cn 𝑗) ↔ {𝑓, 𝑔} ⊆ (II Cn 𝐽)))
9 vex 3481 . . . . . . . . 9 𝑓 ∈ V
10 vex 3481 . . . . . . . . 9 𝑔 ∈ V
119, 10prss 4824 . . . . . . . 8 ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ↔ {𝑓, 𝑔} ⊆ (II Cn 𝐽))
128, 11bitr4di 289 . . . . . . 7 (𝑗 = 𝐽 → ({𝑓, 𝑔} ⊆ (II Cn 𝑗) ↔ (𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽))))
13 fveq2 6906 . . . . . . . . 9 (𝑗 = 𝐽 → (PHtpy‘𝑗) = (PHtpy‘𝐽))
1413oveqd 7447 . . . . . . . 8 (𝑗 = 𝐽 → (𝑓(PHtpy‘𝑗)𝑔) = (𝑓(PHtpy‘𝐽)𝑔))
1514neeq1d 2997 . . . . . . 7 (𝑗 = 𝐽 → ((𝑓(PHtpy‘𝑗)𝑔) ≠ ∅ ↔ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅))
1612, 15anbi12d 632 . . . . . 6 (𝑗 = 𝐽 → (({𝑓, 𝑔} ⊆ (II Cn 𝑗) ∧ (𝑓(PHtpy‘𝑗)𝑔) ≠ ∅) ↔ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)))
1716opabbidv 5213 . . . . 5 (𝑗 = 𝐽 → {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ (II Cn 𝑗) ∧ (𝑓(PHtpy‘𝑗)𝑔) ≠ ∅)} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)})
18 ovex 7463 . . . . . . 7 (II Cn 𝐽) ∈ V
1918, 18xpex 7771 . . . . . 6 ((II Cn 𝐽) × (II Cn 𝐽)) ∈ V
20 opabssxp 5780 . . . . . 6 {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)} ⊆ ((II Cn 𝐽) × (II Cn 𝐽))
2119, 20ssexi 5327 . . . . 5 {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)} ∈ V
2217, 2, 21fvmpt 7015 . . . 4 (𝐽 ∈ Top → ( ≃ph𝐽) = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)})
2322breqd 5158 . . 3 (𝐽 ∈ Top → (𝐹( ≃ph𝐽)𝐺𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)}𝐺))
24 oveq12 7439 . . . . . 6 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓(PHtpy‘𝐽)𝑔) = (𝐹(PHtpy‘𝐽)𝐺))
2524neeq1d 2997 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑓(PHtpy‘𝐽)𝑔) ≠ ∅ ↔ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅))
26 eqid 2734 . . . . 5 {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)}
2725, 26brab2a 5781 . . . 4 (𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)}𝐺 ↔ ((𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽)) ∧ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅))
28 df-3an 1088 . . . 4 ((𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅) ↔ ((𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽)) ∧ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅))
2927, 28bitr4i 278 . . 3 (𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (II Cn 𝐽) ∧ 𝑔 ∈ (II Cn 𝐽)) ∧ (𝑓(PHtpy‘𝐽)𝑔) ≠ ∅)}𝐺 ↔ (𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅))
3023, 29bitrdi 287 . 2 (𝐽 ∈ Top → (𝐹( ≃ph𝐽)𝐺 ↔ (𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅)))
314, 6, 30pm5.21nii 378 1 (𝐹( ≃ph𝐽)𝐺 ↔ (𝐹 ∈ (II Cn 𝐽) ∧ 𝐺 ∈ (II Cn 𝐽) ∧ (𝐹(PHtpy‘𝐽)𝐺) ≠ ∅))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  w3a 1086   = wceq 1536  wcel 2105  wne 2937  wss 3962  c0 4338  {cpr 4632  cop 4636   class class class wbr 5147  {copab 5209   × cxp 5686  cfv 6562  (class class class)co 7430  Topctop 22914   Cn ccn 23247  IIcii 24914  PHtpycphtpy 25013  phcphtpc 25014
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-sbc 3791  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-fv 6570  df-ov 7433  df-oprab 7434  df-mpo 7435  df-map 8866  df-top 22915  df-topon 22932  df-cn 23250  df-phtpc 25037
This theorem is referenced by:  phtpcer  25040  phtpc01  25041  reparpht  25044  phtpcco2  25045  pcohtpylem  25065  pcohtpy  25066  pcorevlem  25072  pi1blem  25085  txsconnlem  35224  txsconn  35225  cvxsconn  35227  cvmliftpht  35302
  Copyright terms: Public domain W3C validator