Theorem fvun2 5575

Description: The value of a union when the argument is in the second domain. (Contributed by Scott Fenton, 29-Jun-2013.)

Assertion

Ref	Expression
fvun2	⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ 𝑋 ∈ 𝐵)) → ((𝐹 ∪ 𝐺)‘𝑋) = (𝐺‘𝑋))

Proof of Theorem fvun2

Step	Hyp	Ref	Expression
1		uncom 3277	. . 3 ⊢ (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹)
2	1	fveq1i 5508	. 2 ⊢ ((𝐹 ∪ 𝐺)‘𝑋) = ((𝐺 ∪ 𝐹)‘𝑋)
3		incom 3325	. . . . . 6 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
4	3	eqeq1i 2183	. . . . 5 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅)
5	4	anbi1i 458	. . . 4 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝑋 ∈ 𝐵) ↔ ((𝐵 ∩ 𝐴) = ∅ ∧ 𝑋 ∈ 𝐵))
6		fvun1 5574	. . . 4 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ ((𝐵 ∩ 𝐴) = ∅ ∧ 𝑋 ∈ 𝐵)) → ((𝐺 ∪ 𝐹)‘𝑋) = (𝐺‘𝑋))
7	5, 6	syl3an3b 1276	. . 3 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ 𝑋 ∈ 𝐵)) → ((𝐺 ∪ 𝐹)‘𝑋) = (𝐺‘𝑋))
8	7	3com12 1207	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ 𝑋 ∈ 𝐵)) → ((𝐺 ∪ 𝐹)‘𝑋) = (𝐺‘𝑋))
9	2, 8	eqtrid 2220	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ 𝑋 ∈ 𝐵)) → ((𝐹 ∪ 𝐺)‘𝑋) = (𝐺‘𝑋))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 978   = wceq 1353   ∈ wcel 2146   ∪ cun 3125   ∩ cin 3126  ∅c0 3420   Fn wfn 5203  ‘cfv 5208

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-v 2737  df-sbc 2961  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-nul 3421  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-br 3999  df-opab 4060  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-fv 5216

This theorem is referenced by:  caseinr  7081