Theorem kqffn 24099

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 4008	. . . . 5 ⊢ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ⊆ 𝐽
2		elpw2g 5302	. . . . 5 ⊢ (𝐽 ∈ 𝑉 → ({𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ∈ 𝒫 𝐽 ↔ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ⊆ 𝐽))
3	1, 2	mpbiri 261	. . . 4 ⊢ (𝐽 ∈ 𝑉 → {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ∈ 𝒫 𝐽)
4	3	adantr 486	. . 3 ⊢ ((𝐽 ∈ 𝑉 ∧ 𝑥 ∈ 𝑋) → {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦} ∈ 𝒫 𝐽)
5		kqval.2	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
6	4, 5	fmptd 7146	. 2 ⊢ (𝐽 ∈ 𝑉 → 𝐹:𝑋⟶𝒫 𝐽)
7	6	ffnd 6740	1 ⊢ (𝐽 ∈ 𝑉 → 𝐹 Fn 𝑋)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900  𝒫 cpw 4560   ↦ cmpt 5192   Fn wfn 6561

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-fun 6568  df-fn 6569  df-f 6570

This theorem is used by:  kqtopon  24101  kqid  24102  ist0-4  24103  kqfvima  24104  kqsat  24105  kqdisj  24106  kqcldsat  24107  kqopn  24108  kqcld  24109  kqt0lem  24110  isr0  24111  r0cld  24112  regr1lem2  24114  kqreglem1  24115  kqreglem2  24116  kqnrmlem1  24117  kqnrmlem2  24118