Theorem unpreima 7060

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 6568	. 2 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2		elpreima 7055	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵))))
3		elun 4108	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵) ↔ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵))
4	3	anbi2i 634	. . . . . 6 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵)))
5		andi 1025	. . . . . 6 ⊢ ((𝑥 ∈ dom 𝐹 ∧ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
6	4, 5	bitri 278	. . . . 5 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
7		elun 4108	. . . . . 6 ⊢ (𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)) ↔ (𝑥 ∈ (◡𝐹 “ 𝐴) ∨ 𝑥 ∈ (◡𝐹 “ 𝐵)))
8		elpreima 7055	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴)))
9		elpreima 7055	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐵) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
10	8, 9	orbi12d 931	. . . . . 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 2761	. 2 ⊢ (𝐹 Fn dom 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))
15	1, 14	sylbi 220	1 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 400   ∨ wo 860   = wceq 1570   ∈ wcel 2143   ∪ cun 3904  ^◡ccnv 5662  dom cdm 5663   “ cima 5666  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546

This theorem is referenced by:  sibfof  34708