Theorem fin23lem7 10394

Description: Lemma for isfin2-2 10397. The componentwise complement of a nonempty collection of sets is nonempty. (Contributed by Stefan O'Rear, 31-Oct-2014.) (Revised by Mario Carneiro, 16-May-2015.)

Assertion

Ref	Expression
fin23lem7	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴 ∧ 𝐵 ≠ ∅) → {𝑥 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑥) ∈ 𝐵} ≠ ∅)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem fin23lem7

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0 4300	. . . 4 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵)
2		difss 4083	. . . . . . . 8 ⊢ (𝐴 ∖ 𝑦) ⊆ 𝐴
3		elpw2g 5295	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ 𝑦) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ 𝑦) ⊆ 𝐴))
4	3	ad2antrr 739	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) ∧ 𝑦 ∈ 𝐵) → ((𝐴 ∖ 𝑦) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ 𝑦) ⊆ 𝐴))
5	2, 4	mpbiri 261	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝐴 ∖ 𝑦) ∈ 𝒫 𝐴)
6		simpr 490	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) → 𝐵 ⊆ 𝒫 𝐴)
7	6	sselda 3931	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝒫 𝐴)
8	7	elpwid 4566	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) ∧ 𝑦 ∈ 𝐵) → 𝑦 ⊆ 𝐴)
9		dfss4 4215	. . . . . . . . 9 ⊢ (𝑦 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦)
10	8, 9	sylib 221	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦)
11		simpr 490	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
12	10, 11	eqeltrd 2861	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝐴 ∖ (𝐴 ∖ 𝑦)) ∈ 𝐵)
13		difeq2 4068	. . . . . . . . 9 ⊢ (𝑥 = (𝐴 ∖ 𝑦) → (𝐴 ∖ 𝑥) = (𝐴 ∖ (𝐴 ∖ 𝑦)))
14	13	eleq1d 2846	. . . . . . . 8 ⊢ (𝑥 = (𝐴 ∖ 𝑦) → ((𝐴 ∖ 𝑥) ∈ 𝐵 ↔ (𝐴 ∖ (𝐴 ∖ 𝑦)) ∈ 𝐵))
15	14	rspcev 3577	. . . . . . 7 ⊢ (((𝐴 ∖ 𝑦) ∈ 𝒫 𝐴 ∧ (𝐴 ∖ (𝐴 ∖ 𝑦)) ∈ 𝐵) → ∃𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ 𝐵)
16	5, 12, 15	syl2anc 596	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ 𝐵)
17	16	ex 418	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) → (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ 𝐵))
18	17	exlimdv 1966	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) → (∃𝑦 𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ 𝐵))
19	1, 18	biimtrid 245	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴) → (𝐵 ≠ ∅ → ∃𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ 𝐵))
20	19	3impia 1135	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ 𝐵)
21		rabn0 4339	. 2 ⊢ ({𝑥 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑥) ∈ 𝐵} ≠ ∅ ↔ ∃𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ 𝐵)
22	20, 21	sylibr 237	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝒫 𝐴 ∧ 𝐵 ≠ ∅) → {𝑥 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑥) ∈ 𝐵} ≠ ∅)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956  ∃wrex 3087  {crab 3413   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249

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 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-in 3906  df-ss 3916  df-nul 4280  df-pw 4559

This theorem is used by:  fin2i2  10396  isfin2-2  10397