Table of ContentsTable of Contents Mathbox for Jeff Hankins < Previous   Next >
Related theorems
Unicode version

Theorem nrmsep 11615
Description: In a normal space, disjoint closed sets are separated by open sets.
Assertion
Ref Expression
nrmsep |- ((J e. Nrm /\ (C e. (Clsd` J) /\ D e. (Clsd` J) /\ (C i^i D) = (/))) -> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/)))
Distinct variable groups:   o,p,C   D,o,p   o,J,p

Proof of Theorem nrmsep
StepHypRef Expression
1 isnrm 11612 . . . 4 |- (J e. Nrm <-> (J e. Top /\ A.c e. (Clsd` J)A.d e. (Clsd` J)((c i^i d) = (/) -> E.o e. J E.p e. J (c (_ o /\ d (_ p /\ (o i^i p) = (/)))))
21pm3.27bi 324 . . 3 |- (J e. Nrm -> A.c e. (Clsd` J)A.d e. (Clsd` J)((c i^i d) = (/) -> E.o e. J E.p e. J (c (_ o /\ d (_ p /\ (o i^i p) = (/))))
3 ineq1 2262 . . . . . . . . 9 |- (c = C -> (c i^i d) = (C i^i d))
43eqeq1d 1526 . . . . . . . 8 |- (c = C -> ((c i^i d) = (/) <-> (C i^i d) = (/)))
5 sseq1 2134 . . . . . . . . . 10 |- (c = C -> (c (_ o <-> C (_ o))
653anbi1d 903 . . . . . . . . 9 |- (c = C -> ((c (_ o /\ d (_ p /\ (o i^i p) = (/)) <-> (C (_ o /\ d (_ p /\ (o i^i p) = (/))))
762rexbidv 1727 . . . . . . . 8 |- (c = C -> (E.o e. J E.p e. J (c (_ o /\ d (_ p /\ (o i^i p) = (/)) <-> E.o e. J E.p e. J (C (_ o /\ d (_ p /\ (o i^i p) = (/))))
84, 7imbi12d 629 . . . . . . 7 |- (c = C -> (((c i^i d) = (/) -> E.o e. J E.p e. J (c (_ o /\ d (_ p /\ (o i^i p) = (/))) <-> ((C i^i d) = (/) -> E.o e. J E.p e. J (C (_ o /\ d (_ p /\ (o i^i p) = (/)))))
9 ineq2 2263 . . . . . . . . 9 |- (d = D -> (C i^i d) = (C i^i D))
109eqeq1d 1526 . . . . . . . 8 |- (d = D -> ((C i^i d) = (/) <-> (C i^i D) = (/)))
11 sseq1 2134 . . . . . . . . . 10 |- (d = D -> (d (_ p <-> D (_ p))
12113anbi2d 904 . . . . . . . . 9 |- (d = D -> ((C (_ o /\ d (_ p /\ (o i^i p) = (/)) <-> (C (_ o /\ D (_ p /\ (o i^i p) = (/))))
13122rexbidv 1727 . . . . . . . 8 |- (d = D -> (E.o e. J E.p e. J (C (_ o /\ d (_ p /\ (o i^i p) = (/)) <-> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/))))
1410, 13imbi12d 629 . . . . . . 7 |- (d = D -> (((C i^i d) = (/) -> E.o e. J E.p e. J (C (_ o /\ d (_ p /\ (o i^i p) = (/))) <-> ((C i^i D) = (/) -> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/)))))
158, 14rcla42v 1926 . . . . . 6 |- ((C e. (Clsd` J) /\ D e. (Clsd` J)) -> (A.c e. (Clsd` J)A.d e. (Clsd` J)((c i^i d) = (/) -> E.o e. J E.p e. J (c (_ o /\ d (_ p /\ (o i^i p) = (/))) -> ((C i^i D) = (/) -> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/)))))
1615com12 11 . . . . 5 |- (A.c e. (Clsd` J)A.d e. (Clsd` J)((c i^i d) = (/) -> E.o e. J E.p e. J (c (_ o /\ d (_ p /\ (o i^i p) = (/))) -> ((C e. (Clsd` J) /\ D e. (Clsd` J)) -> ((C i^i D) = (/) -> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/)))))
1716exp3a 374 . . . 4 |- (A.c e. (Clsd` J)A.d e. (Clsd` J)((c i^i d) = (/) -> E.o e. J E.p e. J (c (_ o /\ d (_ p /\ (o i^i p) = (/))) -> (C e. (Clsd` J) -> (D e. (Clsd` J) -> ((C i^i D) = (/) -> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/))))))
18173impd 853 . . 3 |- (A.c e. (Clsd` J)A.d e. (Clsd` J)((c i^i d) = (/) -> E.o e. J E.p e. J (c (_ o /\ d (_ p /\ (o i^i p) = (/))) -> ((C e. (Clsd` J) /\ D e. (Clsd` J) /\ (C i^i D) = (/)) -> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/))))
192, 18syl 10 . 2 |- (J e. Nrm -> ((C e. (Clsd` J) /\ D e. (Clsd` J) /\ (C i^i D) = (/)) -> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/))))
2019imp 348 1 |- ((J e. Nrm /\ (C e. (Clsd` J) /\ D e. (Clsd` J) /\ (C i^i D) = (/))) -> E.o e. J E.p e. J (C (_ o /\ D (_ p /\ (o i^i p) = (/)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 221   /\ w3a 781   = wceq 992   e. wcel 994  A.wral 1691  E.wrex 1692   i^i cin 2098   (_ wss 2099  (/)c0 2332  ` cfv 3263  Topctop 7800  Clsdccld 7870  Nrmcnrm 11595
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 998  ax-gen 999  ax-8 1000  ax-10 1002  ax-11 1003  ax-12 1004  ax-13 1005  ax-14 1006  ax-17 1007  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159  ax-10o 1177  ax-16 1247  ax-11o 1255  ax-ext 1500  ax-sep 2777  ax-pow 2818  ax-pr 2855
This theorem depends on definitions:  df-bi 145  df-or 222  df-an 223  df-3an 783  df-ex 1017  df-sb 1209  df-eu 1421  df-mo 1422  df-clab 1506  df-cleq 1511  df-clel 1514  df-ne 1630  df-ral 1695  df-rex 1696  df-rab 1698  df-v 1858  df-dif 2101  df-un 2102  df-in 2103  df-ss 2105  df-nul 2333  df-pw 2459  df-sn 2470  df-pr 2471  df-op 2474  df-uni 2570  df-br 2693  df-opab 2741  df-xp 3265  df-cnv 3267  df-dm 3269  df-rn 3270  df-res 3271  df-ima 3272  df-fv 3279  df-nrm 11598
Copyright terms: Public domain