Theorem unpreima 7054

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 6562	. 2 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2		elpreima 7049	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵))))
3		elun 4100	. . . . . . 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 4100	. . . . . 6 ⊢ (𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)) ↔ (𝑥 ∈ (◡𝐹 “ 𝐴) ∨ 𝑥 ∈ (◡𝐹 “ 𝐵)))
8		elpreima 7049	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴)))
9		elpreima 7049	. . . . . . 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 2759	. 2 ⊢ (𝐹 Fn dom 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))
15	1, 14	sylbi 220	1 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ∪ cun 3897  ^◡ccnv 5650  dom cdm 5651   “ cima 5654  Fun wfun 6525   Fn wfn 6526  ‘cfv 6531

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 2147  ax-9 2155  ax-10 2178  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539

This theorem is used by:  sibfof  34955