Theorem marypha2lem4 9408

Description: Lemma for marypha2 9409. 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 9406	. . . . 5 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
3	2	imaeq1i 6064	. . . 4 ⊢ (𝑇 “ 𝑋) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} “ 𝑋)
4		df-ima 5679	. . . 4 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} “ 𝑋) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋)
5	3, 4	eqtri 2789	. . 3 ⊢ (𝑇 “ 𝑋) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋)
6		resopab2 6043	. . . . . 6 ⊢ (𝑋 ⊆ 𝐴 → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))})
7	6	adantl 487	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))})
8	7	rneqd 5933	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋) = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))})
9		rnopab 5949	. . . . 5 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))}
10		df-rex 3093	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝑋 𝑦 ∈ (𝐹‘𝑥) ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥)))
11	10	bicomi 227	. . . . . . . 8 ⊢ (∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥)) ↔ ∃𝑥 ∈ 𝑋 𝑦 ∈ (𝐹‘𝑥))
12	11	abbii 2833	. . . . . . 7 ⊢ {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 ∈ (𝐹‘𝑥)}
13		df-iun 4963	. . . . . . 7 ⊢ ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥) = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 ∈ (𝐹‘𝑥)}
14	12, 13	eqtr4i 2792	. . . . . 6 ⊢ {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥)
15	14	a1i 11	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥))
16	9, 15	eqtrid 2813	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ (𝐹‘𝑥))} = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥))
17	8, 16	eqtrd 2801	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↾ 𝑋) = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥))
18	5, 17	eqtrid 2813	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑇 “ 𝑋) = ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥))
19		fnfun 6642	. . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
20	19	adantr 486	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → Fun 𝐹)
21		funiunfv 7253	. . 3 ⊢ (Fun 𝐹 → ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥) = ∪ (𝐹 “ 𝑋))
22	20, 21	syl 18	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ∪ 𝑥 ∈ 𝑋 (𝐹‘𝑥) = ∪ (𝐹 “ 𝑋))
23	18, 22	eqtrd 2801	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑇 “ 𝑋) = ∪ (𝐹 “ 𝑋))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2146  {cab 2744  ∃wrex 3092   ⊆ wss 3908  {csn 4594  ∪ cuni 4877  ∪ ciun 4961  {copab 5178   × cxp 5664  ran crn 5667   ↾ cres 5668   “ cima 5669  Fun wfun 6537   Fn wfn 6538  ‘cfv 6543

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-fv 6551

This theorem is used by:  marypha2  9409