gneispace - Mathbox for Richard Penner

	Mathbox for Richard Penner		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > gneispace		Structured version Visualization version GIF version

Theorem gneispace 45119

Description: The predicate that 𝐹 is a (generic) Seifert and Threlfall neighborhood space. (Contributed by RP, 14-Apr-2021.)

**Hypothesis**
Ref	Expression
gneispace.a	⊢ 𝐴 = {𝑓 ∣ (𝑓:dom 𝑓⟶(𝒫 (𝒫 dom 𝑓 ∖ {∅}) ∖ {∅}) ∧ ∀𝑝 ∈ dom 𝑓∀𝑛 ∈ (𝑓‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝑓(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝑓‘𝑝))))}

**Assertion**
Ref	Expression
gneispace	⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ 𝐴 ↔ (Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))))

Distinct variable groups: 𝑛,𝐹,𝑝,𝑓 𝐹,𝑠,𝑓 𝑓,𝑛,𝑝 𝑉,𝑝 Allowed substitution hints: 𝐴(𝑓, 𝑛, 𝑠, 𝑝) 𝑉(𝑓, 𝑛, 𝑠)

Proof of Theorem gneispace Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		gneispace.a	. . 3 ⊢ 𝐴 = {𝑓 ∣ (𝑓:dom 𝑓⟶(𝒫 (𝒫 dom 𝑓 ∖ {∅}) ∖ {∅}) ∧ ∀𝑝 ∈ dom 𝑓∀𝑛 ∈ (𝑓‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝑓(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝑓‘𝑝))))}
2	1	gneispace3 45118	. 2 ⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ 𝐴 ↔ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))))
3		simpll 779	. . . 4 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → Fun 𝐹)
4		simplr 781	. . . . 5 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}))
5		difss 4083	. . . . . 6 ⊢ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}) ⊆ 𝒫 (𝒫 dom 𝐹 ∖ {∅})
6		difss 4083	. . . . . . 7 ⊢ (𝒫 dom 𝐹 ∖ {∅}) ⊆ 𝒫 dom 𝐹
7	6	sspwi 4569	. . . . . 6 ⊢ 𝒫 (𝒫 dom 𝐹 ∖ {∅}) ⊆ 𝒫 𝒫 dom 𝐹
8	5, 7	sstri 3940	. . . . 5 ⊢ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}) ⊆ 𝒫 𝒫 dom 𝐹
9	4, 8	sstrdi 3943	. . . 4 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹)
10		simpr 490	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) → ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}))
11		simpl 488	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) → Fun 𝐹)
12		fvelrn 7074	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑝 ∈ dom 𝐹) → (𝐹‘𝑝) ∈ ran 𝐹)
13	11, 12	sylan 592	. . . . . . 7 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ 𝑝 ∈ dom 𝐹) → (𝐹‘𝑝) ∈ ran 𝐹)
14		ssel2 3926	. . . . . . . 8 ⊢ ((ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}) ∧ (𝐹‘𝑝) ∈ ran 𝐹) → (𝐹‘𝑝) ∈ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}))
15		eldifsni 4753	. . . . . . . 8 ⊢ ((𝐹‘𝑝) ∈ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}) → (𝐹‘𝑝) ≠ ∅)
16	14, 15	syl 18	. . . . . . 7 ⊢ ((ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}) ∧ (𝐹‘𝑝) ∈ ran 𝐹) → (𝐹‘𝑝) ≠ ∅)
17	10, 13, 16	syl2an2r 698	. . . . . 6 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ 𝑝 ∈ dom 𝐹) → (𝐹‘𝑝) ≠ ∅)
18	17	ralrimiva 3155	. . . . 5 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) → ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅)
19		r19.26 3123	. . . . . 6 ⊢ (∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) ↔ (∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅ ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))
20	19	biimpri 231	. . . . 5 ⊢ ((∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅ ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))
21	18, 20	sylan 592	. . . 4 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))
22	3, 9, 21	3jca 1146	. . 3 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → (Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))))
23		simp1 1154	. . . . 5 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → Fun 𝐹)
24		nfv 1947	. . . . . . . . . 10 ⊢ Ⅎ𝑝Fun 𝐹
25		nfv 1947	. . . . . . . . . 10 ⊢ Ⅎ𝑝ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹
26		nfra1 3287	. . . . . . . . . 10 ⊢ Ⅎ𝑝∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))
27	24, 25, 26	nf3an 1934	. . . . . . . . 9 ⊢ Ⅎ𝑝(Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))
28		simpr 490	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))
29		simpl 488	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))) → 𝑝 ∈ 𝑛)
30	29	19.8ad 2219	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))) → ∃𝑝 𝑝 ∈ 𝑛)
31	30	ralimi 3100	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))) → ∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛)
32	28, 31	syl 18	. . . . . . . . . . . . . . 15 ⊢ (((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛)
33	32	ralimi 3100	. . . . . . . . . . . . . 14 ⊢ (∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛)
34	33	3ad2ant3 1153	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛)
35		rsp 3251	. . . . . . . . . . . . 13 ⊢ (∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛 → (𝑝 ∈ dom 𝐹 → ∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛))
36	34, 35	syl 18	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (𝑝 ∈ dom 𝐹 → ∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛))
37		df-ex 1813	. . . . . . . . . . . . . . . . . . 19 ⊢ (∃𝑝 𝑝 ∈ 𝑛 ↔ ¬ ∀𝑝 ¬ 𝑝 ∈ 𝑛)
38	37	ralbii 3109	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛 ↔ ∀𝑛 ∈ (𝐹‘𝑝) ¬ ∀𝑝 ¬ 𝑝 ∈ 𝑛)
39		ralnex 3089	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑛 ∈ (𝐹‘𝑝) ¬ ∀𝑝 ¬ 𝑝 ∈ 𝑛 ↔ ¬ ∃𝑛 ∈ (𝐹‘𝑝)∀𝑝 ¬ 𝑝 ∈ 𝑛)
40	38, 39	bitri 278	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛 ↔ ¬ ∃𝑛 ∈ (𝐹‘𝑝)∀𝑝 ¬ 𝑝 ∈ 𝑛)
41		0el 4311	. . . . . . . . . . . . . . . . 17 ⊢ (∅ ∈ (𝐹‘𝑝) ↔ ∃𝑛 ∈ (𝐹‘𝑝)∀𝑝 ¬ 𝑝 ∈ 𝑛)
42	40, 41	xchbinxr 338	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛 ↔ ¬ ∅ ∈ (𝐹‘𝑝))
43	42	biimpi 219	. . . . . . . . . . . . . . 15 ⊢ (∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛 → ¬ ∅ ∈ (𝐹‘𝑝))
44		elinel1 4147	. . . . . . . . . . . . . . 15 ⊢ (∅ ∈ ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) → ∅ ∈ (𝐹‘𝑝))
45	43, 44	nsyl 141	. . . . . . . . . . . . . 14 ⊢ (∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛 → ¬ ∅ ∈ ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹))
46		disjsn 4672	. . . . . . . . . . . . . 14 ⊢ ((((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∩ {∅}) = ∅ ↔ ¬ ∅ ∈ ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹))
47	45, 46	sylibr 237	. . . . . . . . . . . . 13 ⊢ (∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛 → (((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∩ {∅}) = ∅)
48		disjdif2 4436	. . . . . . . . . . . . 13 ⊢ ((((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∩ {∅}) = ∅ → (((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹))
49	47, 48	syl 18	. . . . . . . . . . . 12 ⊢ (∀𝑛 ∈ (𝐹‘𝑝)∃𝑝 𝑝 ∈ 𝑛 → (((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹))
50	36, 49	syl6 36	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (𝑝 ∈ dom 𝐹 → (((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹)))
51		simp2 1155	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹)
52	12	ex 418	. . . . . . . . . . . . 13 ⊢ (Fun 𝐹 → (𝑝 ∈ dom 𝐹 → (𝐹‘𝑝) ∈ ran 𝐹))
53	23, 52	syl 18	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (𝑝 ∈ dom 𝐹 → (𝐹‘𝑝) ∈ ran 𝐹))
54		ssel2 3926	. . . . . . . . . . . . 13 ⊢ ((ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ (𝐹‘𝑝) ∈ ran 𝐹) → (𝐹‘𝑝) ∈ 𝒫 𝒫 dom 𝐹)
55		fvex 6896	. . . . . . . . . . . . . . 15 ⊢ (𝐹‘𝑝) ∈ V
56	55	elpw 4561	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑝) ∈ 𝒫 𝒫 dom 𝐹 ↔ (𝐹‘𝑝) ⊆ 𝒫 dom 𝐹)
57		dfss2 3917	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑝) ⊆ 𝒫 dom 𝐹 ↔ ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) = (𝐹‘𝑝))
58	56, 57	sylbb 222	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑝) ∈ 𝒫 𝒫 dom 𝐹 → ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) = (𝐹‘𝑝))
59	54, 58	syl 18	. . . . . . . . . . . 12 ⊢ ((ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ (𝐹‘𝑝) ∈ ran 𝐹) → ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) = (𝐹‘𝑝))
60	51, 53, 59	syl6an 697	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (𝑝 ∈ dom 𝐹 → ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) = (𝐹‘𝑝)))
61	50, 60	jcad 522	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (𝑝 ∈ dom 𝐹 → ((((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∧ ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) = (𝐹‘𝑝))))
62		eqtr 2781	. . . . . . . . . . 11 ⊢ (((((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∧ ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) = (𝐹‘𝑝)) → (((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = (𝐹‘𝑝))
63		dfss2 3917	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑝) ⊆ (𝒫 dom 𝐹 ∖ {∅}) ↔ ((𝐹‘𝑝) ∩ (𝒫 dom 𝐹 ∖ {∅})) = (𝐹‘𝑝))
64		indif2 4227	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑝) ∩ (𝒫 dom 𝐹 ∖ {∅})) = (((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅})
65	64	eqeq1i 2766	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝑝) ∩ (𝒫 dom 𝐹 ∖ {∅})) = (𝐹‘𝑝) ↔ (((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = (𝐹‘𝑝))
66	63, 65	bitri 278	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑝) ⊆ (𝒫 dom 𝐹 ∖ {∅}) ↔ (((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = (𝐹‘𝑝))
67	62, 66	sylibr 237	. . . . . . . . . 10 ⊢ (((((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∖ {∅}) = ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) ∧ ((𝐹‘𝑝) ∩ 𝒫 dom 𝐹) = (𝐹‘𝑝)) → (𝐹‘𝑝) ⊆ (𝒫 dom 𝐹 ∖ {∅}))
68	61, 67	syl6 36	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (𝑝 ∈ dom 𝐹 → (𝐹‘𝑝) ⊆ (𝒫 dom 𝐹 ∖ {∅})))
69	27, 68	ralrimi 3261	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ⊆ (𝒫 dom 𝐹 ∖ {∅}))
70	23	funfnd 6569	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → 𝐹 Fn dom 𝐹)
71		sseq1 3956	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹‘𝑝) → (𝑥 ⊆ (𝒫 dom 𝐹 ∖ {∅}) ↔ (𝐹‘𝑝) ⊆ (𝒫 dom 𝐹 ∖ {∅})))
72	71	ralrn 7086	. . . . . . . . 9 ⊢ (𝐹 Fn dom 𝐹 → (∀𝑥 ∈ ran 𝐹 𝑥 ⊆ (𝒫 dom 𝐹 ∖ {∅}) ↔ ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ⊆ (𝒫 dom 𝐹 ∖ {∅})))
73	70, 72	syl 18	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (∀𝑥 ∈ ran 𝐹 𝑥 ⊆ (𝒫 dom 𝐹 ∖ {∅}) ↔ ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ⊆ (𝒫 dom 𝐹 ∖ {∅})))
74	69, 73	mpbird 260	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ∀𝑥 ∈ ran 𝐹 𝑥 ⊆ (𝒫 dom 𝐹 ∖ {∅}))
75		pwssb 5061	. . . . . . 7 ⊢ (ran 𝐹 ⊆ 𝒫 (𝒫 dom 𝐹 ∖ {∅}) ↔ ∀𝑥 ∈ ran 𝐹 𝑥 ⊆ (𝒫 dom 𝐹 ∖ {∅}))
76	74, 75	sylibr 237	. . . . . 6 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ran 𝐹 ⊆ 𝒫 (𝒫 dom 𝐹 ∖ {∅}))
77		simpl 488	. . . . . . . . . 10 ⊢ (((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → (𝐹‘𝑝) ≠ ∅)
78	77	ralimi 3100	. . . . . . . . 9 ⊢ (∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅)
79	78	3ad2ant3 1153	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅)
80	23, 79	jca 521	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (Fun 𝐹 ∧ ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅))
81		elrnrexdm 7087	. . . . . . . . . 10 ⊢ (Fun 𝐹 → (∅ ∈ ran 𝐹 → ∃𝑝 ∈ dom 𝐹∅ = (𝐹‘𝑝)))
82		nesym 3012	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑝) ≠ ∅ ↔ ¬ ∅ = (𝐹‘𝑝))
83	82	ralbii 3109	. . . . . . . . . . 11 ⊢ (∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅ ↔ ∀𝑝 ∈ dom 𝐹 ¬ ∅ = (𝐹‘𝑝))
84		ralnex 3089	. . . . . . . . . . 11 ⊢ (∀𝑝 ∈ dom 𝐹 ¬ ∅ = (𝐹‘𝑝) ↔ ¬ ∃𝑝 ∈ dom 𝐹∅ = (𝐹‘𝑝))
85	83, 84	sylbb 222	. . . . . . . . . 10 ⊢ (∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅ → ¬ ∃𝑝 ∈ dom 𝐹∅ = (𝐹‘𝑝))
86	81, 85	nsyli 158	. . . . . . . . 9 ⊢ (Fun 𝐹 → (∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅ → ¬ ∅ ∈ ran 𝐹))
87	86	imp 412	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅) → ¬ ∅ ∈ ran 𝐹)
88		disjsn 4672	. . . . . . . 8 ⊢ ((ran 𝐹 ∩ {∅}) = ∅ ↔ ¬ ∅ ∈ ran 𝐹)
89	87, 88	sylibr 237	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ ∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅) → (ran 𝐹 ∩ {∅}) = ∅)
90	80, 89	syl 18	. . . . . 6 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (ran 𝐹 ∩ {∅}) = ∅)
91		reldisj 4406	. . . . . . 7 ⊢ (ran 𝐹 ⊆ 𝒫 (𝒫 dom 𝐹 ∖ {∅}) → ((ran 𝐹 ∩ {∅}) = ∅ ↔ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})))
92	91	biimpd 232	. . . . . 6 ⊢ (ran 𝐹 ⊆ 𝒫 (𝒫 dom 𝐹 ∖ {∅}) → ((ran 𝐹 ∩ {∅}) = ∅ → ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})))
93	76, 90, 92	sylc 66	. . . . 5 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅}))
94	23, 93	jca 521	. . . 4 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})))
95	19	biimpi 219	. . . . . 6 ⊢ (∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → (∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅ ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))
96	95	3ad2ant3 1153	. . . . 5 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → (∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅ ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))
97		simpr 490	. . . . 5 ⊢ ((∀𝑝 ∈ dom 𝐹(𝐹‘𝑝) ≠ ∅ ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) → ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))
98	96, 97	syl 18	. . . 4 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))
99	94, 98	jca 521	. . 3 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))) → ((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))
100	22, 99	impbii 212	. 2 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (𝒫 (𝒫 dom 𝐹 ∖ {∅}) ∖ {∅})) ∧ ∀𝑝 ∈ dom 𝐹∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))) ↔ (Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝))))))
101	2, 100	bitrdi 290	1 ⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ 𝐴 ↔ (Fun 𝐹 ∧ ran 𝐹 ⊆ 𝒫 𝒫 dom 𝐹 ∧ ∀𝑝 ∈ dom 𝐹((𝐹‘𝑝) ≠ ∅ ∧ ∀𝑛 ∈ (𝐹‘𝑝)(𝑝 ∈ 𝑛 ∧ ∀𝑠 ∈ 𝒫 dom 𝐹(𝑛 ⊆ 𝑠 → 𝑠 ∈ (𝐹‘𝑝)))))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∀wal 1568 = wceq 1570 ∃wex 1812 ∈ wcel 2145 {cab 2739 ≠ wne 2956 ∀wral 3077 ∃wrex 3087 ∖ cdif 3896 ∩ cin 3898 ⊆ wss 3899 ∅c0 4279 𝒫 cpw 4557 {csn 4584 dom cdm 5651 ran crn 5652 Fun wfun 6531 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537

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 ax-nul 5260 ax-pr 5391

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-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545

This theorem is used by: gneispacef2 45121 gneispacern2 45124 gneispace0nelrn 45125

W3C validator