Theorem ixpf 8932

Description: A member of an infinite Cartesian product maps to the indexed union of the product argument. Remark in [Enderton] p. 54. (Contributed by NM, 28-Sep-2006.)

Assertion

Ref	Expression
ixpf	⊢ (𝐹 ∈ X𝑥 ∈ 𝐴 𝐵 → 𝐹:𝐴⟶∪ 𝑥 ∈ 𝐴 𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem ixpf

Step	Hyp	Ref	Expression
1		elixp2 8913	. 2 ⊢ (𝐹 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ (𝐹 ∈ V ∧ 𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵))
2		ssiun2 5006	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
3	2	sseld 3930	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ((𝐹‘𝑥) ∈ 𝐵 → (𝐹‘𝑥) ∈ ∪ 𝑥 ∈ 𝐴 𝐵))
4	3	ralimia 3097	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
5	4	anim2i 629	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ ∪ 𝑥 ∈ 𝐴 𝐵))
6		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑥𝐴
7		nfiu1 4986	. . . . 5 ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 𝐵
8		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑥𝐹
9	6, 7, 8	ffnfvf 7112	. . . 4 ⊢ (𝐹:𝐴⟶∪ 𝑥 ∈ 𝐴 𝐵 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ ∪ 𝑥 ∈ 𝐴 𝐵))
10	5, 9	sylibr 237	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → 𝐹:𝐴⟶∪ 𝑥 ∈ 𝐴 𝐵)
11	10	3adant1 1148	. 2 ⊢ ((𝐹 ∈ V ∧ 𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐵) → 𝐹:𝐴⟶∪ 𝑥 ∈ 𝐴 𝐵)
12	1, 11	sylbi 220	1 ⊢ (𝐹 ∈ X𝑥 ∈ 𝐴 𝐵 → 𝐹:𝐴⟶∪ 𝑥 ∈ 𝐴 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ∀wral 3077  Vcvv 3451  ∪ ciun 4951   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  Xcixp 8909

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-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  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 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-ixp 8910

This theorem is used by:  uniixp  8933  ixpssmap2g  8939  ioorrnopnlem  47258  iunhoiioolem  47629