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 44562
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 4173 . 2 ((𝐼‘∅) ∩ (𝐼‘∅)) = (𝐼‘∅)
2 0elpw 5306 . . 3 ∅ ∈ 𝒫 𝐵
3 ineq1 4160 . . . . . . 7 (𝑠 = ∅ → (𝑠𝑡) = (∅ ∩ 𝑡))
43eqeq1d 2758 . . . . . 6 (𝑠 = ∅ → ((𝑠𝑡) = ∅ ↔ (∅ ∩ 𝑡) = ∅))
5 fveq2 6856 . . . . . . . 8 (𝑠 = ∅ → (𝐼𝑠) = (𝐼‘∅))
65ineq1d 4166 . . . . . . 7 (𝑠 = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ((𝐼‘∅) ∩ (𝐼𝑡)))
76eqeq1d 2758 . . . . . 6 (𝑠 = ∅ → (((𝐼𝑠) ∩ (𝐼𝑡)) = ∅ ↔ ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅))
84, 7imbi12d 346 . . . . 5 (𝑠 = ∅ → (((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) ↔ ((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅)))
9 0in 4345 . . . . . 6 (∅ ∩ 𝑡) = ∅
10 pm5.5 363 . . . . . 6 ((∅ ∩ 𝑡) = ∅ → (((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅))
119, 10ax-mp 5 . . . . 5 (((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅)
128, 11bitrdi 289 . . . 4 (𝑠 = ∅ → (((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼𝑡)) = ∅))
13 fveq2 6856 . . . . . 6 (𝑡 = ∅ → (𝐼𝑡) = (𝐼‘∅))
1413ineq2d 4167 . . . . 5 (𝑡 = ∅ → ((𝐼‘∅) ∩ (𝐼𝑡)) = ((𝐼‘∅) ∩ (𝐼‘∅)))
1514eqeq1d 2758 . . . 4 (𝑡 = ∅ → (((𝐼‘∅) ∩ (𝐼𝑡)) = ∅ ↔ ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅))
1612, 15rspc2v 3587 . . 3 ((∅ ∈ 𝒫 𝐵 ∧ ∅ ∈ 𝒫 𝐵) → (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) → ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅))
172, 2, 16mp2an 700 . 2 (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) → ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅)
181, 17eqtr3id 2805 1 (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅) → (𝐼‘∅) = ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1554  wcel 2136  wral 3070  cin 3898  c0 4280  𝒫 cpw 4549  cfv 6510
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-ext 2728  ax-nul 5250
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-sb 2085  df-clab 2735  df-cleq 2748  df-clel 2831  df-ral 3071  df-rab 3409  df-v 3450  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5095  df-iota 6466  df-fv 6518
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator