Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ntrkbimka Structured version   Visualization version   GIF version

Theorem ntrkbimka 44619
Description: If the interiors of disjoint sets are disjoint, then the interior of the empty set is the empty set. (Contributed by RP, 14-Jun-2021.)
Assertion
Ref Expression
ntrkbimka (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) → (𝐼‘∅) = ∅)
Distinct variable groups:   𝐵,𝑠,𝑡   𝐼,𝑠,𝑡

Proof of Theorem ntrkbimka
StepHypRef Expression
1 inidm 4180 . 2 ((𝐼‘∅) ∩ (𝐼‘∅)) = (𝐼‘∅)
2 0elpw 5314 . . 3 ∅ ∈ 𝒫 𝐵
3 ineq1 4167 . . . . . . 7 (𝑠 = ∅ → (𝑠𝑡) = (∅ ∩ 𝑡))
43eqeq1d 2766 . . . . . 6 (𝑠 = ∅ → ((𝑠𝑡) = ∅ ↔ (∅ ∩ 𝑡) = ∅))
5 fveq2 6869 . . . . . . . 8 (𝑠 = ∅ → (𝐼𝑠) = (𝐼‘∅))
65ineq1d 4173 . . . . . . 7 (𝑠 = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ((𝐼‘∅) ∩ (𝐼𝑡)))
76eqeq1d 2766 . . . . . 6 (𝑠 = ∅ → (((𝐼𝑠) ∩ (𝐼𝑡)) = ∅ ↔ ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅))
84, 7imbi12d 346 . . . . 5 (𝑠 = ∅ → (((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) ↔ ((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅)))
9 0in 4353 . . . . . 6 (∅ ∩ 𝑡) = ∅
10 pm5.5 363 . . . . . 6 ((∅ ∩ 𝑡) = ∅ → (((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅))
119, 10ax-mp 5 . . . . 5 (((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅)
128, 11bitrdi 289 . . . 4 (𝑠 = ∅ → (((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅))
13 fveq2 6869 . . . . . 6 (𝑡 = ∅ → (𝐼𝑡) = (𝐼‘∅))
1413ineq2d 4174 . . . . 5 (𝑡 = ∅ → ((𝐼‘∅) ∩ (𝐼𝑡)) = ((𝐼‘∅) ∩ (𝐼‘∅)))
1514eqeq1d 2766 . . . 4 (𝑡 = ∅ → (((𝐼‘∅) ∩ (𝐼𝑡)) = ∅ ↔ ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅))
1612, 15rspc2v 3594 . . 3 ((∅ ∈ 𝒫 𝐵 ∧ ∅ ∈ 𝒫 𝐵) → (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) → ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅))
172, 2, 16mp2an 702 . 2 (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) → ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅)
181, 17eqtr3id 2813 1 (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) → (𝐼‘∅) = ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1562  wcel 2144  wral 3078  cin 3905  c0 4287  𝒫 cpw 4557  cfv 6523
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-nul 5258
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-iota 6479  df-fv 6531
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator