Table of ContentsTable of Contents Mathbox for Frédéric Liné < Previous   Next >
Related theorems
Unicode version

Theorem subsp2 14902
Description: The subspace topology induced by the topology J on the set A.
Assertion
Ref Expression
subsp2 |- ((J e. Top /\ A e. _V) -> (subSp` <.A, J>.) = {u | E.v e. J u = (v i^i A)})
Distinct variable groups:   u,A,v   u,J,v

Proof of Theorem subsp2
StepHypRef Expression
1 opeq2 3159 . . . 4 |- (J = if(J e. Top, J, {(/)}) -> <.A, J>. = <.A, if(J e. Top, J, {(/)})>.)
21fveq2d 4685 . . 3 |- (J = if(J e. Top, J, {(/)}) -> (subSp` <.A, J>.) = (subSp` <.A, if(J e. Top, J, {(/)})>.))
3 rexeq 2267 . . . 4 |- (J = if(J e. Top, J, {(/)}) -> (E.v e. J u = (v i^i A) <-> E.v e. if (J e. Top, J, {(/)})u = (v i^i A)))
43abbidv 2008 . . 3 |- (J = if(J e. Top, J, {(/)}) -> {u | E.v e. J u = (v i^i A)} = {u | E.v e. if (J e. Top, J, {(/)})u = (v i^i A)})
52, 4eqeq12d 1899 . 2 |- (J = if(J e. Top, J, {(/)}) -> ((subSp` <.A, J>.) = {u | E.v e. J u = (v i^i A)} <-> (subSp` <.A, if(J e. Top, J, {(/)})>.) = {u | E.v e. if (J e. Top, J, {(/)})u = (v i^i A)}))
6 opeq1 3158 . . . 4 |- (A = if(A e. _V, A, (/)) -> <.A, if(J e. Top, J, {(/)})>. = <.if(A e. _V, A, (/)), if(J e. Top, J, {(/)})>.)
76fveq2d 4685 . . 3 |- (A = if(A e. _V, A, (/)) -> (subSp` <.A, if(J e. Top, J, {(/)})>.) = (subSp` <.if(A e. _V, A, (/)), if(J e. Top, J, {(/)})>.))
8 ineq2 2790 . . . . . 6 |- (A = if(A e. _V, A, (/)) -> (v i^i A) = (v i^i if(A e. _V, A, (/))))
98eqeq2d 1895 . . . . 5 |- (A = if(A e. _V, A, (/)) -> (u = (v i^i A) <-> u = (v i^i if(A e. _V, A, (/)))))
109rexbidv 2124 . . . 4 |- (A = if(A e. _V, A, (/)) -> (E.v e. if (J e. Top, J, {(/)})u = (v i^i A) <-> E.v e. if (J e. Top, J, {(/)})u = (v i^i if(A e. _V, A, (/)))))
1110abbidv 2008 . . 3 |- (A = if(A e. _V, A, (/)) -> {u | E.v e. if (J e. Top, J, {(/)})u = (v i^i A)} = {u | E.v e. if (J e. Top, J, {(/)})u = (v i^i if(A e. _V, A, (/)))})
127, 11eqeq12d 1899 . 2 |- (A = if(A e. _V, A, (/)) -> ((subSp` <.A, if(J e. Top, J, {(/)})>.) = {u | E.v e. if (J e. Top, J, {(/)})u = (v i^i A)} <-> (subSp` <.if(A e. _V, A, (/)), if(J e. Top, J, {(/)})>.) = {u | E.v e. if (J e. Top, J, {(/)})u = (v i^i if(A e. _V, A, (/)))}))
13 sn0top 8917 . . . 4 |- {(/)} e. Top
1413elimel 3025 . . 3 |- if(J e. Top, J, {(/)}) e. Top
15 0ex 3446 . . . 4 |- (/) e. _V
1615elimel 3025 . . 3 |- if(A e. _V, A, (/)) e. _V
1714, 16subsp 10244 . 2 |- (subSp` <.if(A e. _V, A, (/)), if(J e. Top, J, {(/)})>.) = {u | E.v e. if (J e. Top, J, {(/)})u = (v i^i if(A e. _V, A, (/)))}
185, 12, 17dedth2h 3015 1 |- ((J e. Top /\ A e. _V) -> (subSp` <.A, J>.) = {u | E.v e. J u = (v i^i A)})
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 240   = wceq 1298   e. wcel 1300  {cab 1871  E.wrex 2106  _Vcvv 2292   i^i cin 2592  (/)c0 2875  ifcif 2982  {csn 3044  <.cop 3046  ` cfv 3998  Topctop 8857  subSpcsubsp 10242
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524  ax-un 3790
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-sbc 2454  df-csb 2541  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-if 2983  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-id 3586  df-xp 4000  df-rel 4001  df-cnv 4002  df-co 4003  df-dm 4004  df-rn 4005  df-res 4006  df-ima 4007  df-fun 4008  df-fv 4014  df-opr 4886  df-oprab 4887  df-top 8861  df-subsp 10243
Copyright terms: Public domain