Theorem unpreima 6810

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 6354	. 2 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2		elpreima 6805	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵))))
3		elun 4076	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵) ↔ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵))
4	3	anbi2i 625	. . . . . 6 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵)))
5		andi 1005	. . . . . 6 ⊢ ((𝑥 ∈ dom 𝐹 ∧ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
6	4, 5	bitri 278	. . . . 5 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
7		elun 4076	. . . . . 6 ⊢ (𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)) ↔ (𝑥 ∈ (◡𝐹 “ 𝐴) ∨ 𝑥 ∈ (◡𝐹 “ 𝐵)))
8		elpreima 6805	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴)))
9		elpreima 6805	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐵) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
10	8, 9	orbi12d 916	. . . . . 6 ⊢ (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (◡𝐹 “ 𝐴) ∨ 𝑥 ∈ (◡𝐹 “ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵))))
11	7, 10	syl5bb 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 2796	. 2 ⊢ (𝐹 Fn dom 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))
15	1, 14	sylbi 220	1 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 399   ∨ wo 844   = wceq 1538   ∈ wcel 2111   ∪ cun 3879  ^◡ccnv 5518  dom cdm 5519   “ cima 5522  Fun wfun 6318   Fn wfn 6319  ‘cfv 6324

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-fv 6332

This theorem is referenced by:  sibfof  31708