Theorem marypha2lem4 9339

Description: Lemma for marypha2 9340. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)

Hypothesis

Ref	Expression
marypha2lem.t	⊢ 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))

Assertion

Ref	Expression
marypha2lem4	⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑇 “ 𝑋) = ∪ (𝐹 “ 𝑋))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝑋

Allowed substitution hint:   𝑇(𝑥)

Proof of Theorem marypha2lem4

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		marypha2lem.t	. . . . . 6 ⊢ 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))
2	1	marypha2lem2 9337	. . . . 5 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
3	2	imaeq1i 6014	. . . 4 ⊢ (𝑇 “ 𝑋) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} “ 𝑋)
4		df-ima 5635	. . . 4 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} “ 𝑋) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋)
5	3, 4	eqtri 2757	. . 3 ⊢ (𝑇 “ 𝑋) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋)
6		resopab2 5993	. . . . . 6 ⊢ (𝑋 ⊆ 𝐴 → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))})
7	6	adantl 481	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))})
8	7	rneqd 5885	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋) = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))})
9		rnopab 5901	. . . . 5 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))}
10		df-rex 3059	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝑋 𝑦 ∈ (𝐹‘𝑥) ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥)))
11	10	bicomi 224	. . . . . . . 8 ⊢ (∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥)) ↔ ∃𝑥 ∈ 𝑋 𝑦 ∈ (𝐹‘𝑥))
12	11	abbii 2801	. . . . . . 7 ⊢ {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 ∈ (𝐹‘𝑥)}
13		df-iun 4946	. . . . . . 7 ⊢ ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 ∈ (𝐹‘𝑥)}
14	12, 13	eqtr4i 2760	. . . . . 6 ⊢ {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥)
15	14	a1i 11	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥))
16	9, 15	eqtrid 2781	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥))
17	8, 16	eqtrd 2769	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋) = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥))
18	5, 17	eqtrid 2781	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑇 “ 𝑋) = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥))
19		fnfun 6590	. . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
20	19	adantr 480	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → Fun 𝐹)
21		funiunfv 7192	. . 3 ⊢ (Fun 𝐹 → ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥) = ∪ (𝐹 “ 𝑋))
22	20, 21	syl 17	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥) = ∪ (𝐹 “ 𝑋))
23	18, 22	eqtrd 2769	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑇 “ 𝑋) = ∪ (𝐹 “ 𝑋))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2113  {cab 2712  ∃wrex 3058   ⊆ wss 3899  {csn 4578  ∪ cuni 4861  ∪ ciun 4944  {copab 5158   × cxp 5620  ran crn 5623   ↾ cres 5624   “ cima 5625  Fun wfun 6484   Fn wfn 6485  ‘cfv 6490

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-fv 6498

This theorem is referenced by:  marypha2  9340