Theorem unpreima 7062

Description: Preimage of a union. (Contributed by Jeff Madsen, 2-Sep-2009.)

Assertion

Ref	Expression
unpreima	⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))

Proof of Theorem unpreima

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funfn 6570	. 2 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2		elpreima 7057	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵))))
3		elun 4152	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵) ↔ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵))
4	3	anbi2i 635	. . . . . 6 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵)))
5		andi 1025	. . . . . 6 ⊢ ((𝑥 ∈ dom 𝐹 ∧ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
6	4, 5	bitri 278	. . . . 5 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
7		elun 4152	. . . . . 6 ⊢ (𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)) ↔ (𝑥 ∈ (◡𝐹 “ 𝐴) ∨ 𝑥 ∈ (◡𝐹 “ 𝐵)))
8		elpreima 7057	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴)))
9		elpreima 7057	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐵) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
10	8, 9	orbi12d 932	. . . . . 6 ⊢ (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (◡𝐹 “ 𝐴) ∨ 𝑥 ∈ (◡𝐹 “ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵))))
11	7, 10	bitrid 286	. . . . 5 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵))))
12	6, 11	bitr4id 293	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ 𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵))))
13	2, 12	bitrd 282	. . 3 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ (𝐴 ∪ 𝐵)) ↔ 𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵))))
14	13	eqrdv 2758	. 2 ⊢ (𝐹 Fn dom 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))
15	1, 14	sylbi 220	1 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144   ∪ cun 4149  ^◡ccnv 5649  dom cdm 5650   “ cima 5653  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546

This theorem is used by:  sibfof  35018