Theorem kqffn 24037

Description: The topological indistinguishability map is a function on the base. (Contributed by Mario Carneiro, 25-Aug-2015.)

Hypothesis

Ref	Expression
kqval.2	⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})

Assertion

Ref	Expression
kqffn	⊢ (𝐽 ∈ 𝑉 → 𝐹 Fn 𝑋)

Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑋,𝑦   𝑥,𝑉

Allowed substitution hints:   𝐹(𝑥, 𝑦)   𝑉(𝑦)

Proof of Theorem kqffn

Step	Hyp	Ref	Expression
1		ssrab2 4028	. . . . 5 ⊢ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ⊆ 𝐽
2		elpw2g 5295	. . . . 5 ⊢ (𝐽 ∈ 𝑉 → ({𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ∈ 𝒫 𝐽 ↔ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ⊆ 𝐽))
3	1, 2	mpbiri 261	. . . 4 ⊢ (𝐽 ∈ 𝑉 → {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ∈ 𝒫 𝐽)
4	3	adantr 486	. . 3 ⊢ ((𝐽 ∈ 𝑉 ∧ 𝑥 ∈ 𝑋) → {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ∈ 𝒫 𝐽)
5		kqval.2	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
6	4, 5	fmptd 7112	. 2 ⊢ (𝐽 ∈ 𝑉 → 𝐹:𝑋⟶𝒫 𝐽)
7	6	ffnd 6708	1 ⊢ (𝐽 ∈ 𝑉 → 𝐹 Fn 𝑋)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413   ⊆ wss 3899  𝒫 cpw 4557   ↦ cmpt 5186   Fn wfn 6532

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-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-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-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-res 5663  df-ima 5664  df-fun 6539  df-fn 6540  df-f 6541

This theorem is used by:  kqtopon  24039  kqid  24040  ist0-4  24041  kqfvima  24042  kqsat  24043  kqdisj  24044  kqcldsat  24045  kqopn  24046  kqcld  24047  kqt0lem  24048  isr0  24049  r0cld  24050  regr1lem2  24052  kqreglem1  24053  kqreglem2  24054  kqnrmlem1  24055  kqnrmlem2  24056