Theorem ntrkbimka 40395

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

Step	Hyp	Ref	Expression
1		inidm 4197	. 2 ⊢ ((𝐼‘∅) ∩ (𝐼‘∅)) = (𝐼‘∅)
2		0elpw 5258	. . 3 ⊢ ∅ ∈ 𝒫 𝐵
3		ineq1 4183	. . . . . . 7 ⊢ (𝑠 = ∅ → (𝑠 ∩ 𝑡) = (∅ ∩ 𝑡))
4	3	eqeq1d 2825	. . . . . 6 ⊢ (𝑠 = ∅ → ((𝑠 ∩ 𝑡) = ∅ ↔ (∅ ∩ 𝑡) = ∅))
5		fveq2 6672	. . . . . . . 8 ⊢ (𝑠 = ∅ → (𝐼‘𝑠) = (𝐼‘∅))
6	5	ineq1d 4190	. . . . . . 7 ⊢ (𝑠 = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ((𝐼‘∅) ∩ (𝐼‘𝑡)))
7	6	eqeq1d 2825	. . . . . 6 ⊢ (𝑠 = ∅ → (((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅ ↔ ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅))
8	4, 7	imbi12d 347	. . . . 5 ⊢ (𝑠 = ∅ → (((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) ↔ ((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅)))
9		0in 4349	. . . . . 6 ⊢ (∅ ∩ 𝑡) = ∅
10		pm5.5 364	. . . . . 6 ⊢ ((∅ ∩ 𝑡) = ∅ → (((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅))
11	9, 10	ax-mp 5	. . . . 5 ⊢ (((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅)
12	8, 11	syl6bb 289	. . . 4 ⊢ (𝑠 = ∅ → (((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅))
13		fveq2 6672	. . . . . 6 ⊢ (𝑡 = ∅ → (𝐼‘𝑡) = (𝐼‘∅))
14	13	ineq2d 4191	. . . . 5 ⊢ (𝑡 = ∅ → ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ((𝐼‘∅) ∩ (𝐼‘∅)))
15	14	eqeq1d 2825	. . . 4 ⊢ (𝑡 = ∅ → (((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅ ↔ ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅))
16	12, 15	rspc2v 3635	. . 3 ⊢ ((∅ ∈ 𝒫 𝐵 ∧ ∅ ∈ 𝒫 𝐵) → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) → ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅))
17	2, 2, 16	mp2an 690	. 2 ⊢ (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) → ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅)
18	1, 17	syl5eqr 2872	1 ⊢ (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) → (𝐼‘∅) = ∅)

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1537   ∈ wcel 2114  ∀wral 3140   ∩ cin 3937  ∅c0 4293  𝒫 cpw 4541  ‘cfv 6357

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-nul 5212

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-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rab 3149  df-v 3498  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-br 5069  df-iota 6316  df-fv 6365

This theorem is referenced by: (None)