Theorem ntrkbimka 37356

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 3784	. 2 ⊢ ((𝐼‘∅) ∩ (𝐼‘∅)) = (𝐼‘∅)
2		0elpw 4760	. . 3 ⊢ ∅ ∈ 𝒫 𝐵
3		ineq1 3769	. . . . . . 7 ⊢ (𝑠 = ∅ → (𝑠 ∩ 𝑡) = (∅ ∩ 𝑡))
4	3	eqeq1d 2612	. . . . . 6 ⊢ (𝑠 = ∅ → ((𝑠 ∩ 𝑡) = ∅ ↔ (∅ ∩ 𝑡) = ∅))
5		fveq2 6103	. . . . . . . 8 ⊢ (𝑠 = ∅ → (𝐼‘𝑠) = (𝐼‘∅))
6	5	ineq1d 3775	. . . . . . 7 ⊢ (𝑠 = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ((𝐼‘∅) ∩ (𝐼‘𝑡)))
7	6	eqeq1d 2612	. . . . . 6 ⊢ (𝑠 = ∅ → (((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅ ↔ ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅))
8	4, 7	imbi12d 333	. . . . 5 ⊢ (𝑠 = ∅ → (((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) ↔ ((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅)))
9		incom 3767	. . . . . . 7 ⊢ (∅ ∩ 𝑡) = (𝑡 ∩ ∅)
10		in0 3920	. . . . . . 7 ⊢ (𝑡 ∩ ∅) = ∅
11	9, 10	eqtri 2632	. . . . . 6 ⊢ (∅ ∩ 𝑡) = ∅
12		pm5.5 350	. . . . . 6 ⊢ ((∅ ∩ 𝑡) = ∅ → (((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅))
13	11, 12	ax-mp 5	. . . . 5 ⊢ (((∅ ∩ 𝑡) = ∅ → ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅)
14	8, 13	syl6bb 275	. . . 4 ⊢ (𝑠 = ∅ → (((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) ↔ ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅))
15		fveq2 6103	. . . . . 6 ⊢ (𝑡 = ∅ → (𝐼‘𝑡) = (𝐼‘∅))
16	15	ineq2d 3776	. . . . 5 ⊢ (𝑡 = ∅ → ((𝐼‘∅) ∩ (𝐼‘𝑡)) = ((𝐼‘∅) ∩ (𝐼‘∅)))
17	16	eqeq1d 2612	. . . 4 ⊢ (𝑡 = ∅ → (((𝐼‘∅) ∩ (𝐼‘𝑡)) = ∅ ↔ ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅))
18	14, 17	rspc2v 3293	. . 3 ⊢ ((∅ ∈ 𝒫 𝐵 ∧ ∅ ∈ 𝒫 𝐵) → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) → ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅))
19	2, 2, 18	mp2an 704	. 2 ⊢ (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) → ((𝐼‘∅) ∩ (𝐼‘∅)) = ∅)
20	1, 19	syl5eqr 2658	1 ⊢ (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∩ 𝑡) = ∅ → ((𝐼‘𝑠) ∩ (𝐼‘𝑡)) = ∅) → (𝐼‘∅) = ∅)

Syntax hints:   → wi 4   ↔ wb 195   = wceq 1475   ∈ wcel 1977  ∀wral 2896   ∩ cin 3539  ∅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  ax-nul 4717

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-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-pw 4110  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)