Theorem neiptopuni 23441

Description: Lemma for neiptopreu 23444. (Contributed by Thierry Arnoux, 6-Jan-2018.)

Hypotheses

Ref	Expression
neiptop.o	⊢ 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)}
neiptop.0	⊢ (𝜑 → 𝑁:𝑋⟶𝒫 𝒫 𝑋)
neiptop.1	⊢ ((((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑏 ∈ (𝑁‘𝑝))
neiptop.2	⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝))
neiptop.3	⊢ (((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑝 ∈ 𝑎)
neiptop.4	⊢ (((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑏 ∈ (𝑁‘𝑝)∀𝑞 ∈ 𝑏 𝑎 ∈ (𝑁‘𝑞))
neiptop.5	⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → 𝑋 ∈ (𝑁‘𝑝))

Assertion

Ref	Expression
neiptopuni	⊢ (𝜑 → 𝑋 = ∪ 𝐽)

Distinct variable groups:   𝑝,𝑎   𝑁,𝑎   𝑋,𝑎   𝑎,𝑏,𝑝   𝐽,𝑎,𝑝   𝑋,𝑝   𝜑,𝑝

Allowed substitution hints:   𝜑(𝑞, 𝑎, 𝑏)   𝐽(𝑞, 𝑏)   𝑁(𝑞, 𝑝, 𝑏)   𝑋(𝑞, 𝑏)

Proof of Theorem neiptopuni

Step	Hyp	Ref	Expression
1		elpwi 4564	. . . . . . . 8 ⊢ (𝑎 ∈ 𝒫 𝑋 → 𝑎 ⊆ 𝑋)
2	1	ad2antlr 740	. . . . . . 7 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑎 ⊆ 𝑋)
3		simpr 490	. . . . . . 7 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑝 ∈ 𝑎)
4	2, 3	sseldd 3932	. . . . . 6 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑝 ∈ 𝑋)
5		neiptop.o	. . . . . . . . . 10 ⊢ 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)}
6	5	unieqi 4879	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)}
7	6	eleq2i 2853	. . . . . . . 8 ⊢ (𝑝 ∈ ∪ 𝐽 ↔ 𝑝 ∈ ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)})
8		elunirab 4882	. . . . . . . 8 ⊢ (𝑝 ∈ ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)} ↔ ∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)))
9	7, 8	bitri 278	. . . . . . 7 ⊢ (𝑝 ∈ ∪ 𝐽 ↔ ∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)))
10		simpl 488	. . . . . . . 8 ⊢ ((𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)) → 𝑝 ∈ 𝑎)
11	10	reximi 3101	. . . . . . 7 ⊢ (∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑎 ∈ 𝒫 𝑋𝑝 ∈ 𝑎)
12	9, 11	sylbi 220	. . . . . 6 ⊢ (𝑝 ∈ ∪ 𝐽 → ∃𝑎 ∈ 𝒫 𝑋𝑝 ∈ 𝑎)
13	4, 12	r19.29a 3171	. . . . 5 ⊢ (𝑝 ∈ ∪ 𝐽 → 𝑝 ∈ 𝑋)
14	13	a1i 11	. . . 4 ⊢ (𝜑 → (𝑝 ∈ ∪ 𝐽 → 𝑝 ∈ 𝑋))
15	14	ssrdv 3937	. . 3 ⊢ (𝜑 → ∪ 𝐽 ⊆ 𝑋)
16		ssidd 3954	. . . 4 ⊢ (𝜑 → 𝑋 ⊆ 𝑋)
17		neiptop.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → 𝑋 ∈ (𝑁‘𝑝))
18	17	ralrimiva 3155	. . . 4 ⊢ (𝜑 → ∀𝑝 ∈ 𝑋 𝑋 ∈ (𝑁‘𝑝))
19	5	neipeltop 23440	. . . 4 ⊢ (𝑋 ∈ 𝐽 ↔ (𝑋 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑋 𝑋 ∈ (𝑁‘𝑝)))
20	16, 18, 19	sylanbrc 595	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐽)
21		unissel 4900	. . 3 ⊢ ((∪ 𝐽 ⊆ 𝑋 ∧ 𝑋 ∈ 𝐽) → ∪ 𝐽 = 𝑋)
22	15, 20, 21	syl2anc 596	. 2 ⊢ (𝜑 → ∪ 𝐽 = 𝑋)
23	22	eqcomd 2767	1 ⊢ (𝜑 → 𝑋 = ∪ 𝐽)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  {crab 3413   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  ⟶wf 6533  ‘cfv 6537  ficfi 9395

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ss 3916  df-nul 4280  df-pw 4559  df-uni 4868

This theorem is used by:  neiptoptop  23442  neiptopnei  23443  neiptopreu  23444