Theorem opndisj 49814

Description: Two ways of saying that two open sets are disjoint, if 𝐽 is a topology and 𝑋 is an open set. (Contributed by Zhi Wang, 6-Sep-2024.)

Assertion

Ref	Expression
opndisj	⊢ (𝑍 = (∪ 𝐽 ∖ 𝑋) → (𝑌 ∈ (𝐽 ∩ 𝒫 𝑍) ↔ (𝑌 ∈ 𝐽 ∧ (𝑋 ∩ 𝑌) = ∅)))

Proof of Theorem opndisj

Step	Hyp	Ref	Expression
1		elpwg 4563	. . . 4 ⊢ (𝑌 ∈ 𝐽 → (𝑌 ∈ 𝒫 𝑍 ↔ 𝑌 ⊆ 𝑍))
2		sseq2 3960	. . . 4 ⊢ (𝑍 = (∪ 𝐽 ∖ 𝑋) → (𝑌 ⊆ 𝑍 ↔ 𝑌 ⊆ (∪ 𝐽 ∖ 𝑋)))
3	1, 2	sylan9bbr 520	. . 3 ⊢ ((𝑍 = (∪ 𝐽 ∖ 𝑋) ∧ 𝑌 ∈ 𝐽) → (𝑌 ∈ 𝒫 𝑍 ↔ 𝑌 ⊆ (∪ 𝐽 ∖ 𝑋)))
4	3	pm5.32da 590	. 2 ⊢ (𝑍 = (∪ 𝐽 ∖ 𝑋) → ((𝑌 ∈ 𝐽 ∧ 𝑌 ∈ 𝒫 𝑍) ↔ (𝑌 ∈ 𝐽 ∧ 𝑌 ⊆ (∪ 𝐽 ∖ 𝑋))))
5		elin 3918	. 2 ⊢ (𝑌 ∈ (𝐽 ∩ 𝒫 𝑍) ↔ (𝑌 ∈ 𝐽 ∧ 𝑌 ∈ 𝒫 𝑍))
6		elssuni 4902	. . . 4 ⊢ (𝑌 ∈ 𝐽 → 𝑌 ⊆ ∪ 𝐽)
7		incom 4158	. . . . . 6 ⊢ (𝑋 ∩ 𝑌) = (𝑌 ∩ 𝑋)
8	7	eqeq1i 2767	. . . . 5 ⊢ ((𝑋 ∩ 𝑌) = ∅ ↔ (𝑌 ∩ 𝑋) = ∅)
9		reldisj 4409	. . . . 5 ⊢ (𝑌 ⊆ ∪ 𝐽 → ((𝑌 ∩ 𝑋) = ∅ ↔ 𝑌 ⊆ (∪ 𝐽 ∖ 𝑋)))
10	8, 9	bitrid 286	. . . 4 ⊢ (𝑌 ⊆ ∪ 𝐽 → ((𝑋 ∩ 𝑌) = ∅ ↔ 𝑌 ⊆ (∪ 𝐽 ∖ 𝑋)))
11	6, 10	syl 18	. . 3 ⊢ (𝑌 ∈ 𝐽 → ((𝑋 ∩ 𝑌) = ∅ ↔ 𝑌 ⊆ (∪ 𝐽 ∖ 𝑋)))
12	11	pm5.32i 585	. 2 ⊢ ((𝑌 ∈ 𝐽 ∧ (𝑋 ∩ 𝑌) = ∅) ↔ (𝑌 ∈ 𝐽 ∧ 𝑌 ⊆ (∪ 𝐽 ∖ 𝑋)))
13	4, 5, 12	3bitr4g 317	1 ⊢ (𝑍 = (∪ 𝐽 ∖ 𝑋) → (𝑌 ∈ (𝐽 ∩ 𝒫 𝑍) ↔ (𝑌 ∈ 𝐽 ∧ (𝑋 ∩ 𝑌) = ∅)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ∖ cdif 3899   ∩ cin 3901   ⊆ wss 3902  ∅c0 4282  𝒫 cpw 4560  ∪ cuni 4870

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 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rab 3415  df-v 3455  df-dif 3905  df-in 3909  df-ss 3919  df-nul 4283  df-pw 4562  df-uni 4871

This theorem is used by:  clddisj  49815