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

Theorem ntrk2imkb 44796
Description: If an interior function is contracting, the interiors of disjoint sets are disjoint. Kuratowski's K2 axiom implies KB. Interior version. (Contributed by RP, 9-Jun-2021.)
Assertion
Ref Expression
ntrk2imkb (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅))
Distinct variable groups:   𝐵,𝑠,𝑡   𝐼,𝑠,𝑡

Proof of Theorem ntrk2imkb
StepHypRef Expression
1 id 23 . . 3 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠)
2 fveq2 6885 . . . . . 6 (𝑠 = 𝑡 → (𝐼𝑠) = (𝐼𝑡))
3 id 23 . . . . . 6 (𝑠 = 𝑡𝑠 = 𝑡)
42, 3sseq12d 3971 . . . . 5 (𝑠 = 𝑡 → ((𝐼𝑠) ⊆ 𝑠 ↔ (𝐼𝑡) ⊆ 𝑡))
54cbvralvw 3245 . . . 4 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 ↔ ∀𝑡 ∈ 𝒫 𝐵(𝐼𝑡) ⊆ 𝑡)
65biimpi 219 . . 3 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑡 ∈ 𝒫 𝐵(𝐼𝑡) ⊆ 𝑡)
7 raaanv 4482 . . 3 (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ↔ (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 ∧ ∀𝑡 ∈ 𝒫 𝐵(𝐼𝑡) ⊆ 𝑡))
81, 6, 7sylanbrc 595 . 2 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡))
9 ss2in 4197 . . . . . . 7 (((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝑠𝑡))
109adantr 486 . . . . . 6 ((((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ∧ (𝑠𝑡) = ∅) → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝑠𝑡))
11 simpr 490 . . . . . 6 ((((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ∧ (𝑠𝑡) = ∅) → (𝑠𝑡) = ∅)
1210, 11sseqtrd 3974 . . . . 5 ((((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ∧ (𝑠𝑡) = ∅) → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ ∅)
13 ss0 4359 . . . . 5 (((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅)
1412, 13syl 18 . . . 4 ((((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ∧ (𝑠𝑡) = ∅) → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅)
1514ex 418 . . 3 (((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) → ((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅))
16152ralimi 3137 . 2 (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) → ∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅))
178, 16syl 18 1 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wral 3081  cin 3905  wss 3906  c0 4286  𝒫 cpw 4564  cfv 6540
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator