Theorem neiptopuni 23159

Description: Lemma for neiptopreu 23162. (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 4629	. . . . . . . 8 ⊢ (𝑎 ∈ 𝒫 𝑋 → 𝑎 ⊆ 𝑋)
2	1	ad2antlr 726	. . . . . . 7 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑎 ⊆ 𝑋)
3		simpr 484	. . . . . . 7 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑝 ∈ 𝑎)
4	2, 3	sseldd 4009	. . . . . 6 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑝 ∈ 𝑋)
5		neiptop.o	. . . . . . . . . 10 ⊢ 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)}
6	5	unieqi 4943	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)}
7	6	eleq2i 2836	. . . . . . . 8 ⊢ (𝑝 ∈ ∪ 𝐽 ↔ 𝑝 ∈ ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)})
8		elunirab 4946	. . . . . . . 8 ⊢ (𝑝 ∈ ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)} ↔ ∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)))
9	7, 8	bitri 275	. . . . . . 7 ⊢ (𝑝 ∈ ∪ 𝐽 ↔ ∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)))
10		simpl 482	. . . . . . . 8 ⊢ ((𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)) → 𝑝 ∈ 𝑎)
11	10	reximi 3090	. . . . . . 7 ⊢ (∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑎 ∈ 𝒫 𝑋𝑝 ∈ 𝑎)
12	9, 11	sylbi 217	. . . . . 6 ⊢ (𝑝 ∈ ∪ 𝐽 → ∃𝑎 ∈ 𝒫 𝑋𝑝 ∈ 𝑎)
13	4, 12	r19.29a 3168	. . . . 5 ⊢ (𝑝 ∈ ∪ 𝐽 → 𝑝 ∈ 𝑋)
14	13	a1i 11	. . . 4 ⊢ (𝜑 → (𝑝 ∈ ∪ 𝐽 → 𝑝 ∈ 𝑋))
15	14	ssrdv 4014	. . 3 ⊢ (𝜑 → ∪ 𝐽 ⊆ 𝑋)
16		ssidd 4032	. . . 4 ⊢ (𝜑 → 𝑋 ⊆ 𝑋)
17		neiptop.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → 𝑋 ∈ (𝑁‘𝑝))
18	17	ralrimiva 3152	. . . 4 ⊢ (𝜑 → ∀𝑝 ∈ 𝑋 𝑋 ∈ (𝑁‘𝑝))
19	5	neipeltop 23158	. . . 4 ⊢ (𝑋 ∈ 𝐽 ↔ (𝑋 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑋 𝑋 ∈ (𝑁‘𝑝)))
20	16, 18, 19	sylanbrc 582	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐽)
21		unissel 4962	. . 3 ⊢ ((∪ 𝐽 ⊆ 𝑋 ∧ 𝑋 ∈ 𝐽) → ∪ 𝐽 = 𝑋)
22	15, 20, 21	syl2anc 583	. 2 ⊢ (𝜑 → ∪ 𝐽 = 𝑋)
23	22	eqcomd 2746	1 ⊢ (𝜑 → 𝑋 = ∪ 𝐽)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ∀wral 3067  ∃wrex 3076  {crab 3443   ⊆ wss 3976  𝒫 cpw 4622  ∪ cuni 4931  ⟶wf 6569  ‘cfv 6573  ficfi 9479

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-nul 5324

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-ss 3993  df-nul 4353  df-pw 4624  df-uni 4932

This theorem is referenced by:  neiptoptop  23160  neiptopnei  23161  neiptopreu  23162