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

Theorem txindis 22244
Description: The topological product of indiscrete spaces is indiscrete. (Contributed by Mario Carneiro, 14-Aug-2015.)
Assertion
Ref Expression
txindis ({∅, 𝐴} ×t {∅, 𝐵}) = {∅, (𝐴 × 𝐵)}

Proof of Theorem txindis
Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 neq0 4311 . . . . . . 7 𝑥 = ∅ ↔ ∃𝑦 𝑦𝑥)
2 indistop 21612 . . . . . . . . . . 11 {∅, 𝐴} ∈ Top
3 indistop 21612 . . . . . . . . . . 11 {∅, 𝐵} ∈ Top
4 eltx 22178 . . . . . . . . . . 11 (({∅, 𝐴} ∈ Top ∧ {∅, 𝐵} ∈ Top) → (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) ↔ ∀𝑦𝑥𝑧 ∈ {∅, 𝐴}∃𝑤 ∈ {∅, 𝐵} (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)))
52, 3, 4mp2an 690 . . . . . . . . . 10 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) ↔ ∀𝑦𝑥𝑧 ∈ {∅, 𝐴}∃𝑤 ∈ {∅, 𝐵} (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥))
6 rsp 3207 . . . . . . . . . 10 (∀𝑦𝑥𝑧 ∈ {∅, 𝐴}∃𝑤 ∈ {∅, 𝐵} (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥) → (𝑦𝑥 → ∃𝑧 ∈ {∅, 𝐴}∃𝑤 ∈ {∅, 𝐵} (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)))
75, 6sylbi 219 . . . . . . . . 9 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → (𝑦𝑥 → ∃𝑧 ∈ {∅, 𝐴}∃𝑤 ∈ {∅, 𝐵} (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)))
8 elssuni 4870 . . . . . . . . . . . . . 14 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → 𝑥 ({∅, 𝐴} ×t {∅, 𝐵}))
9 indisuni 21613 . . . . . . . . . . . . . . 15 ( I ‘𝐴) = {∅, 𝐴}
10 indisuni 21613 . . . . . . . . . . . . . . 15 ( I ‘𝐵) = {∅, 𝐵}
112, 3, 9, 10txunii 22203 . . . . . . . . . . . . . 14 (( I ‘𝐴) × ( I ‘𝐵)) = ({∅, 𝐴} ×t {∅, 𝐵})
128, 11sseqtrrdi 4020 . . . . . . . . . . . . 13 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → 𝑥 ⊆ (( I ‘𝐴) × ( I ‘𝐵)))
1312ad2antrr 724 . . . . . . . . . . . 12 (((𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) ∧ (𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵})) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑥 ⊆ (( I ‘𝐴) × ( I ‘𝐵)))
14 ne0i 4302 . . . . . . . . . . . . . . . . . . . 20 (𝑦 ∈ (𝑧 × 𝑤) → (𝑧 × 𝑤) ≠ ∅)
1514ad2antrl 726 . . . . . . . . . . . . . . . . . . 19 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (𝑧 × 𝑤) ≠ ∅)
16 xpnz 6018 . . . . . . . . . . . . . . . . . . 19 ((𝑧 ≠ ∅ ∧ 𝑤 ≠ ∅) ↔ (𝑧 × 𝑤) ≠ ∅)
1715, 16sylibr 236 . . . . . . . . . . . . . . . . . 18 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (𝑧 ≠ ∅ ∧ 𝑤 ≠ ∅))
1817simpld 497 . . . . . . . . . . . . . . . . 17 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑧 ≠ ∅)
1918neneqd 3023 . . . . . . . . . . . . . . . 16 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → ¬ 𝑧 = ∅)
20 simpll 765 . . . . . . . . . . . . . . . . . . 19 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑧 ∈ {∅, 𝐴})
21 indislem 21610 . . . . . . . . . . . . . . . . . . 19 {∅, ( I ‘𝐴)} = {∅, 𝐴}
2220, 21eleqtrrdi 2926 . . . . . . . . . . . . . . . . . 18 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑧 ∈ {∅, ( I ‘𝐴)})
23 elpri 4591 . . . . . . . . . . . . . . . . . 18 (𝑧 ∈ {∅, ( I ‘𝐴)} → (𝑧 = ∅ ∨ 𝑧 = ( I ‘𝐴)))
2422, 23syl 17 . . . . . . . . . . . . . . . . 17 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (𝑧 = ∅ ∨ 𝑧 = ( I ‘𝐴)))
2524ord 860 . . . . . . . . . . . . . . . 16 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (¬ 𝑧 = ∅ → 𝑧 = ( I ‘𝐴)))
2619, 25mpd 15 . . . . . . . . . . . . . . 15 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑧 = ( I ‘𝐴))
2717simprd 498 . . . . . . . . . . . . . . . . 17 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑤 ≠ ∅)
2827neneqd 3023 . . . . . . . . . . . . . . . 16 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → ¬ 𝑤 = ∅)
29 simplr 767 . . . . . . . . . . . . . . . . . . 19 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑤 ∈ {∅, 𝐵})
30 indislem 21610 . . . . . . . . . . . . . . . . . . 19 {∅, ( I ‘𝐵)} = {∅, 𝐵}
3129, 30eleqtrrdi 2926 . . . . . . . . . . . . . . . . . 18 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑤 ∈ {∅, ( I ‘𝐵)})
32 elpri 4591 . . . . . . . . . . . . . . . . . 18 (𝑤 ∈ {∅, ( I ‘𝐵)} → (𝑤 = ∅ ∨ 𝑤 = ( I ‘𝐵)))
3331, 32syl 17 . . . . . . . . . . . . . . . . 17 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (𝑤 = ∅ ∨ 𝑤 = ( I ‘𝐵)))
3433ord 860 . . . . . . . . . . . . . . . 16 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (¬ 𝑤 = ∅ → 𝑤 = ( I ‘𝐵)))
3528, 34mpd 15 . . . . . . . . . . . . . . 15 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑤 = ( I ‘𝐵))
3626, 35xpeq12d 5588 . . . . . . . . . . . . . 14 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (𝑧 × 𝑤) = (( I ‘𝐴) × ( I ‘𝐵)))
37 simprr 771 . . . . . . . . . . . . . 14 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (𝑧 × 𝑤) ⊆ 𝑥)
3836, 37eqsstrrd 4008 . . . . . . . . . . . . 13 (((𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵}) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (( I ‘𝐴) × ( I ‘𝐵)) ⊆ 𝑥)
3938adantll 712 . . . . . . . . . . . 12 (((𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) ∧ (𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵})) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → (( I ‘𝐴) × ( I ‘𝐵)) ⊆ 𝑥)
4013, 39eqssd 3986 . . . . . . . . . . 11 (((𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) ∧ (𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵})) ∧ (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥)) → 𝑥 = (( I ‘𝐴) × ( I ‘𝐵)))
4140ex 415 . . . . . . . . . 10 ((𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) ∧ (𝑧 ∈ {∅, 𝐴} ∧ 𝑤 ∈ {∅, 𝐵})) → ((𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥) → 𝑥 = (( I ‘𝐴) × ( I ‘𝐵))))
4241rexlimdvva 3296 . . . . . . . . 9 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → (∃𝑧 ∈ {∅, 𝐴}∃𝑤 ∈ {∅, 𝐵} (𝑦 ∈ (𝑧 × 𝑤) ∧ (𝑧 × 𝑤) ⊆ 𝑥) → 𝑥 = (( I ‘𝐴) × ( I ‘𝐵))))
437, 42syld 47 . . . . . . . 8 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → (𝑦𝑥𝑥 = (( I ‘𝐴) × ( I ‘𝐵))))
4443exlimdv 1934 . . . . . . 7 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → (∃𝑦 𝑦𝑥𝑥 = (( I ‘𝐴) × ( I ‘𝐵))))
451, 44syl5bi 244 . . . . . 6 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → (¬ 𝑥 = ∅ → 𝑥 = (( I ‘𝐴) × ( I ‘𝐵))))
4645orrd 859 . . . . 5 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → (𝑥 = ∅ ∨ 𝑥 = (( I ‘𝐴) × ( I ‘𝐵))))
47 vex 3499 . . . . . 6 𝑥 ∈ V
4847elpr 4592 . . . . 5 (𝑥 ∈ {∅, (( I ‘𝐴) × ( I ‘𝐵))} ↔ (𝑥 = ∅ ∨ 𝑥 = (( I ‘𝐴) × ( I ‘𝐵))))
4946, 48sylibr 236 . . . 4 (𝑥 ∈ ({∅, 𝐴} ×t {∅, 𝐵}) → 𝑥 ∈ {∅, (( I ‘𝐴) × ( I ‘𝐵))})
5049ssriv 3973 . . 3 ({∅, 𝐴} ×t {∅, 𝐵}) ⊆ {∅, (( I ‘𝐴) × ( I ‘𝐵))}
519toptopon 21527 . . . . . . 7 ({∅, 𝐴} ∈ Top ↔ {∅, 𝐴} ∈ (TopOn‘( I ‘𝐴)))
522, 51mpbi 232 . . . . . 6 {∅, 𝐴} ∈ (TopOn‘( I ‘𝐴))
5310toptopon 21527 . . . . . . 7 ({∅, 𝐵} ∈ Top ↔ {∅, 𝐵} ∈ (TopOn‘( I ‘𝐵)))
543, 53mpbi 232 . . . . . 6 {∅, 𝐵} ∈ (TopOn‘( I ‘𝐵))
55 txtopon 22201 . . . . . 6 (({∅, 𝐴} ∈ (TopOn‘( I ‘𝐴)) ∧ {∅, 𝐵} ∈ (TopOn‘( I ‘𝐵))) → ({∅, 𝐴} ×t {∅, 𝐵}) ∈ (TopOn‘(( I ‘𝐴) × ( I ‘𝐵))))
5652, 54, 55mp2an 690 . . . . 5 ({∅, 𝐴} ×t {∅, 𝐵}) ∈ (TopOn‘(( I ‘𝐴) × ( I ‘𝐵)))
57 topgele 21540 . . . . 5 (({∅, 𝐴} ×t {∅, 𝐵}) ∈ (TopOn‘(( I ‘𝐴) × ( I ‘𝐵))) → ({∅, (( I ‘𝐴) × ( I ‘𝐵))} ⊆ ({∅, 𝐴} ×t {∅, 𝐵}) ∧ ({∅, 𝐴} ×t {∅, 𝐵}) ⊆ 𝒫 (( I ‘𝐴) × ( I ‘𝐵))))
5856, 57ax-mp 5 . . . 4 ({∅, (( I ‘𝐴) × ( I ‘𝐵))} ⊆ ({∅, 𝐴} ×t {∅, 𝐵}) ∧ ({∅, 𝐴} ×t {∅, 𝐵}) ⊆ 𝒫 (( I ‘𝐴) × ( I ‘𝐵)))
5958simpli 486 . . 3 {∅, (( I ‘𝐴) × ( I ‘𝐵))} ⊆ ({∅, 𝐴} ×t {∅, 𝐵})
6050, 59eqssi 3985 . 2 ({∅, 𝐴} ×t {∅, 𝐵}) = {∅, (( I ‘𝐴) × ( I ‘𝐵))}
61 txindislem 22243 . . 3 (( I ‘𝐴) × ( I ‘𝐵)) = ( I ‘(𝐴 × 𝐵))
6261preq2i 4675 . 2 {∅, (( I ‘𝐴) × ( I ‘𝐵))} = {∅, ( I ‘(𝐴 × 𝐵))}
63 indislem 21610 . 2 {∅, ( I ‘(𝐴 × 𝐵))} = {∅, (𝐴 × 𝐵)}
6460, 62, 633eqtri 2850 1 ({∅, 𝐴} ×t {∅, 𝐵}) = {∅, (𝐴 × 𝐵)}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843   = wceq 1537  wex 1780  wcel 2114  wne 3018  wral 3140  wrex 3141  wss 3938  c0 4293  𝒫 cpw 4541  {cpr 4571   cuni 4840   I cid 5461   × cxp 5555  cfv 6357  (class class class)co 7158  Topctop 21503  TopOnctopon 21520   ×t ctx 22170
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-1st 7691  df-2nd 7692  df-topgen 16719  df-top 21504  df-topon 21521  df-bases 21556  df-tx 22172
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator