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 37355
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 22 . . 3 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠)
2 fveq2 6103 . . . . . 6 (𝑠 = 𝑡 → (𝐼𝑠) = (𝐼𝑡))
3 id 22 . . . . . 6 (𝑠 = 𝑡𝑠 = 𝑡)
42, 3sseq12d 3597 . . . . 5 (𝑠 = 𝑡 → ((𝐼𝑠) ⊆ 𝑠 ↔ (𝐼𝑡) ⊆ 𝑡))
54cbvralv 3147 . . . 4 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 ↔ ∀𝑡 ∈ 𝒫 𝐵(𝐼𝑡) ⊆ 𝑡)
65biimpi 205 . . 3 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑡 ∈ 𝒫 𝐵(𝐼𝑡) ⊆ 𝑡)
7 raaanv 4033 . . 3 (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ↔ (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 ∧ ∀𝑡 ∈ 𝒫 𝐵(𝐼𝑡) ⊆ 𝑡))
81, 6, 7sylanbrc 695 . 2 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡))
9 ss2in 3802 . . . . . . . 8 (((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝑠𝑡))
109adantr 480 . . . . . . 7 ((((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ∧ (𝑠𝑡) = ∅) → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ (𝑠𝑡))
11 simpr 476 . . . . . . 7 ((((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ∧ (𝑠𝑡) = ∅) → (𝑠𝑡) = ∅)
1210, 11sseqtrd 3604 . . . . . 6 ((((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ∧ (𝑠𝑡) = ∅) → ((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ ∅)
13 ss0 3926 . . . . . 6 (((𝐼𝑠) ∩ (𝐼𝑡)) ⊆ ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅)
1412, 13syl 17 . . . . 5 ((((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) ∧ (𝑠𝑡) = ∅) → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅)
1514ex 449 . . . 4 (((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) → ((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅))
1615ralimi 2936 . . 3 (∀𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) → ∀𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅))
1716ralimi 2936 . 2 (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝐼𝑠) ⊆ 𝑠 ∧ (𝐼𝑡) ⊆ 𝑡) → ∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅))
188, 17syl 17 1 (∀𝑠 ∈ 𝒫 𝐵(𝐼𝑠) ⊆ 𝑠 → ∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) = ∅ → ((𝐼𝑠) ∩ (𝐼𝑡)) = ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wral 2896  cin 3539  wss 3540  c0 3874  𝒫 cpw 4108  cfv 5804
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-iota 5768  df-fv 5812
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator