Theorem unpreima 6835

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 6387	. 2 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2		elpreima 6830	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵))))
3		elun 4127	. . . . . 6 ⊢ (𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)) ↔ (𝑥 ∈ (◡𝐹 “ 𝐴) ∨ 𝑥 ∈ (◡𝐹 “ 𝐵)))
4		elpreima 6830	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴)))
5		elpreima 6830	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐵) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
6	4, 5	orbi12d 915	. . . . . 6 ⊢ (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (◡𝐹 “ 𝐴) ∨ 𝑥 ∈ (◡𝐹 “ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵))))
7	3, 6	syl5bb 285	. . . . 5 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵))))
8		elun 4127	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵) ↔ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵))
9	8	anbi2i 624	. . . . . 6 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵)))
10		andi 1004	. . . . . 6 ⊢ ((𝑥 ∈ dom 𝐹 ∧ ((𝐹‘𝑥) ∈ 𝐴 ∨ (𝐹‘𝑥) ∈ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
11	9, 10	bitri 277	. . . . 5 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐵)))
12	7, 11	syl6rbbr 292	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ (𝐴 ∪ 𝐵)) ↔ 𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵))))
13	2, 12	bitrd 281	. . 3 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ (𝐴 ∪ 𝐵)) ↔ 𝑥 ∈ ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵))))
14	13	eqrdv 2821	. 2 ⊢ (𝐹 Fn dom 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))
15	1, 14	sylbi 219	1 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∪ 𝐵)) = ((◡𝐹 “ 𝐴) ∪ (◡𝐹 “ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 398   ∨ wo 843   = wceq 1537   ∈ wcel 2114   ∪ cun 3936  ^◡ccnv 5556  dom cdm 5557   “ cima 5560  Fun wfun 6351   Fn wfn 6352  ‘cfv 6357

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-fv 6365

This theorem is referenced by:  sibfof  31600