Theorem xpima 6164

Description: Direct image by a Cartesian product. (Contributed by Thierry Arnoux, 4-Feb-2017.)

Assertion

Ref	Expression
xpima	⊢ ((𝐴 × 𝐵) “ 𝐶) = if((𝐴 ∩ 𝐶) = ∅, ∅, 𝐵)

Proof of Theorem xpima

Step	Hyp	Ref	Expression
1		exmid 905	. . 3 ⊢ ((𝐴 ∩ 𝐶) = ∅ ∨ ¬ (𝐴 ∩ 𝐶) = ∅)
2		df-ima 5658	. . . . . . . 8 ⊢ ((𝐴 × 𝐵) “ 𝐶) = ran ((𝐴 × 𝐵) ↾ 𝐶)
3		df-res 5657	. . . . . . . . 9 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 × 𝐵) ∩ (𝐶 × V))
4	3	rneqi 5911	. . . . . . . 8 ⊢ ran ((𝐴 × 𝐵) ↾ 𝐶) = ran ((𝐴 × 𝐵) ∩ (𝐶 × V))
5	2, 4	eqtri 2784	. . . . . . 7 ⊢ ((𝐴 × 𝐵) “ 𝐶) = ran ((𝐴 × 𝐵) ∩ (𝐶 × V))
6		inxp 5802	. . . . . . . 8 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ V))
7	6	rneqi 5911	. . . . . . 7 ⊢ ran ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ran ((𝐴 ∩ 𝐶) × (𝐵 ∩ V))
8		inv1 4351	. . . . . . . . 9 ⊢ (𝐵 ∩ V) = 𝐵
9	8	xpeq2i 5672	. . . . . . . 8 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ((𝐴 ∩ 𝐶) × 𝐵)
10	9	rneqi 5911	. . . . . . 7 ⊢ ran ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ran ((𝐴 ∩ 𝐶) × 𝐵)
11	5, 7, 10	3eqtri 2788	. . . . . 6 ⊢ ((𝐴 × 𝐵) “ 𝐶) = ran ((𝐴 ∩ 𝐶) × 𝐵)
12		xpeq1 5659	. . . . . . . . 9 ⊢ ((𝐴 ∩ 𝐶) = ∅ → ((𝐴 ∩ 𝐶) × 𝐵) = (∅ × 𝐵))
13		0xp 5744	. . . . . . . . 9 ⊢ (∅ × 𝐵) = ∅
14	12, 13	eqtrdi 2812	. . . . . . . 8 ⊢ ((𝐴 ∩ 𝐶) = ∅ → ((𝐴 ∩ 𝐶) × 𝐵) = ∅)
15	14	rneqd 5912	. . . . . . 7 ⊢ ((𝐴 ∩ 𝐶) = ∅ → ran ((𝐴 ∩ 𝐶) × 𝐵) = ran ∅)
16		rn0 5900	. . . . . . 7 ⊢ ran ∅ = ∅
17	15, 16	eqtrdi 2812	. . . . . 6 ⊢ ((𝐴 ∩ 𝐶) = ∅ → ran ((𝐴 ∩ 𝐶) × 𝐵) = ∅)
18	11, 17	eqtrid 2808	. . . . 5 ⊢ ((𝐴 ∩ 𝐶) = ∅ → ((𝐴 × 𝐵) “ 𝐶) = ∅)
19	18	ancli 556	. . . 4 ⊢ ((𝐴 ∩ 𝐶) = ∅ → ((𝐴 ∩ 𝐶) = ∅ ∧ ((𝐴 × 𝐵) “ 𝐶) = ∅))
20		df-ne 2957	. . . . . . 7 ⊢ ((𝐴 ∩ 𝐶) ≠ ∅ ↔ ¬ (𝐴 ∩ 𝐶) = ∅)
21		rnxp 6152	. . . . . . 7 ⊢ ((𝐴 ∩ 𝐶) ≠ ∅ → ran ((𝐴 ∩ 𝐶) × 𝐵) = 𝐵)
22	20, 21	sylbir 237	. . . . . 6 ⊢ (¬ (𝐴 ∩ 𝐶) = ∅ → ran ((𝐴 ∩ 𝐶) × 𝐵) = 𝐵)
23	11, 22	eqtrid 2808	. . . . 5 ⊢ (¬ (𝐴 ∩ 𝐶) = ∅ → ((𝐴 × 𝐵) “ 𝐶) = 𝐵)
24	23	ancli 556	. . . 4 ⊢ (¬ (𝐴 ∩ 𝐶) = ∅ → (¬ (𝐴 ∩ 𝐶) = ∅ ∧ ((𝐴 × 𝐵) “ 𝐶) = 𝐵))
25	19, 24	orim12i 919	. . 3 ⊢ (((𝐴 ∩ 𝐶) = ∅ ∨ ¬ (𝐴 ∩ 𝐶) = ∅) → (((𝐴 ∩ 𝐶) = ∅ ∧ ((𝐴 × 𝐵) “ 𝐶) = ∅) ∨ (¬ (𝐴 ∩ 𝐶) = ∅ ∧ ((𝐴 × 𝐵) “ 𝐶) = 𝐵)))
26	1, 25	ax-mp 5	. 2 ⊢ (((𝐴 ∩ 𝐶) = ∅ ∧ ((𝐴 × 𝐵) “ 𝐶) = ∅) ∨ (¬ (𝐴 ∩ 𝐶) = ∅ ∧ ((𝐴 × 𝐵) “ 𝐶) = 𝐵))
27		eqif 4521	. 2 ⊢ (((𝐴 × 𝐵) “ 𝐶) = if((𝐴 ∩ 𝐶) = ∅, ∅, 𝐵) ↔ (((𝐴 ∩ 𝐶) = ∅ ∧ ((𝐴 × 𝐵) “ 𝐶) = ∅) ∨ (¬ (𝐴 ∩ 𝐶) = ∅ ∧ ((𝐴 × 𝐵) “ 𝐶) = 𝐵)))
28	26, 27	mpbir 233	1 ⊢ ((𝐴 × 𝐵) “ 𝐶) = if((𝐴 ∩ 𝐶) = ∅, ∅, 𝐵)

Syntax hints:  ¬ wn 3   ∧ wa 399   ∨ wo 858   = wceq 1559   ≠ wne 2956  Vcvv 3453   ∩ cin 3903  ∅c0 4285  ifcif 4479   × cxp 5643  ran crn 5646   ↾ cres 5647   “ cima 5648

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-11 2190  ax-ext 2733  ax-sep 5245  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162  df-xp 5651  df-rel 5652  df-cnv 5653  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658

This theorem is referenced by:  xpima1  6165  xpima2  6166  imadifxp  32750  bj-xpimasn  37404  bj-imdirco  37646