Theorem neicvgf1o 45058

Description: If neighborhood and convergent functions are related by operator 𝐻, it is a one-to-one onto relation. (Contributed by RP, 11-Jun-2021.)

Hypotheses

Ref	Expression
neicvg.o	⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
neicvg.p	⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜))))))
neicvg.d	⊢ 𝐷 = (𝑃‘𝐵)
neicvg.f	⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
neicvg.g	⊢ 𝐺 = (𝐵𝑂𝒫 𝐵)
neicvg.h	⊢ 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺))
neicvg.r	⊢ (𝜑 → 𝑁𝐻𝑀)

Assertion

Ref	Expression
neicvgf1o	⊢ (𝜑 → 𝐻:(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵))

Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚   𝐵,𝑛,𝑜,𝑝   𝜑,𝑖,𝑗,𝑘,𝑙   𝜑,𝑛,𝑜,𝑝

Allowed substitution hints:   𝜑(𝑚)   𝐷(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑃(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝐹(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝐺(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝐻(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑀(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑁(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)   𝑂(𝑖, 𝑗, 𝑘, 𝑚, 𝑛, 𝑜, 𝑝, 𝑙)

Proof of Theorem neicvgf1o

Step	Hyp	Ref	Expression
1		neicvg.o	. . . 4 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
2		neicvg.d	. . . . . 6 ⊢ 𝐷 = (𝑃‘𝐵)
3		neicvg.h	. . . . . 6 ⊢ 𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺))
4		neicvg.r	. . . . . 6 ⊢ (𝜑 → 𝑁𝐻𝑀)
5	2, 3, 4	neicvgbex 45056	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
6	5	pwexd 5340	. . . 4 ⊢ (𝜑 → 𝒫 𝐵 ∈ V)
7		neicvg.f	. . . 4 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵)
8	1, 6, 5, 7	fsovf1od 44960	. . 3 ⊢ (𝜑 → 𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵))
9		neicvg.p	. . . . 5 ⊢ 𝑃 = (𝑛 ∈ V ↦ (𝑝 ∈ (𝒫 𝑛 ↑m 𝒫 𝑛) ↦ (𝑜 ∈ 𝒫 𝑛 ↦ (𝑛 ∖ (𝑝‘(𝑛 ∖ 𝑜))))))
10	9, 2, 5	dssmapf1od 44965	. . . 4 ⊢ (𝜑 → 𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵))
11		neicvg.g	. . . . 5 ⊢ 𝐺 = (𝐵𝑂𝒫 𝐵)
12	1, 5, 6, 11	fsovf1od 44960	. . . 4 ⊢ (𝜑 → 𝐺:(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵))
13		f1oco 6836	. . . 4 ⊢ ((𝐷:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵) ∧ 𝐺:(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵)) → (𝐷 ∘ 𝐺):(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵))
14	10, 12, 13	syl2anc 596	. . 3 ⊢ (𝜑 → (𝐷 ∘ 𝐺):(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵))
15		f1oco 6836	. . 3 ⊢ ((𝐹:(𝒫 𝐵 ↑m 𝒫 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ∧ (𝐷 ∘ 𝐺):(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝐵 ↑m 𝒫 𝐵)) → (𝐹 ∘ (𝐷 ∘ 𝐺)):(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵))
16	8, 14, 15	syl2anc 596	. 2 ⊢ (𝜑 → (𝐹 ∘ (𝐷 ∘ 𝐺)):(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵))
17		f1oeq1 6800	. . 3 ⊢ (𝐻 = (𝐹 ∘ (𝐷 ∘ 𝐺)) → (𝐻:(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ↔ (𝐹 ∘ (𝐷 ∘ 𝐺)):(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵)))
18	3, 17	ax-mp 5	. 2 ⊢ (𝐻:(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵) ↔ (𝐹 ∘ (𝐷 ∘ 𝐺)):(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵))
19	16, 18	sylibr 237	1 ⊢ (𝜑 → 𝐻:(𝒫 𝒫 𝐵 ↑m 𝐵)–1-1-onto→(𝒫 𝒫 𝐵 ↑m 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  {crab 3412  Vcvv 3450   ∖ cdif 3895  𝒫 cpw 4556   class class class wbr 5102   ↦ cmpt 5185   ∘ ccom 5651  –1-1-onto→wf1o 6526  ‘cfv 6527  (class class class)co 7408   ∈ cmpo 7410   ↑_m cmap 8825

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 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-map 8827

This theorem is used by: (None)