xpinpreima2 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > xpinpreima2		Structured version Visualization version GIF version

Theorem xpinpreima2 34064

Description: Rewrite the cartesian product of two sets as the intersection of their preimage by 1^st and 2^nd, the projections on the first and second elements. (Contributed by Thierry Arnoux, 22-Sep-2017.)

**Assertion**
Ref	Expression
xpinpreima2	⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → (𝐴 × 𝐵) = ((^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) ∩ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵)))

Proof of Theorem xpinpreima2 Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		xp2 7970	. . . 4 ⊢ (𝐴 × 𝐵) = {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)}
2		xpss 5640	. . . . . 6 ⊢ (𝐸 × 𝐹) ⊆ (V × V)
3		rabss2 4029	. . . . . 6 ⊢ ((𝐸 × 𝐹) ⊆ (V × V) → {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)} ⊆ {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
4	2, 3	mp1i 13	. . . . 5 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)} ⊆ {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
5		simprl 770	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → 𝑟 ∈ (V × V))
6		simpll 766	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → 𝐴 ⊆ 𝐸)
7		simprrl 780	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → (1^st ‘𝑟) ∈ 𝐴)
8	6, 7	sseldd 3934	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → (1^st ‘𝑟) ∈ 𝐸)
9		simplr 768	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → 𝐵 ⊆ 𝐹)
10		simprrr 781	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → (2^nd ‘𝑟) ∈ 𝐵)
11	9, 10	sseldd 3934	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → (2^nd ‘𝑟) ∈ 𝐹)
12	8, 11	jca 511	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → ((1^st ‘𝑟) ∈ 𝐸 ∧ (2^nd ‘𝑟) ∈ 𝐹))
13		elxp7 7968	. . . . . . 7 ⊢ (𝑟 ∈ (𝐸 × 𝐹) ↔ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐸 ∧ (2^nd ‘𝑟) ∈ 𝐹)))
14	5, 12, 13	sylanbrc 583	. . . . . 6 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → 𝑟 ∈ (𝐸 × 𝐹))
15	14	rabss3d 4033	. . . . 5 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)} ⊆ {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
16	4, 15	eqssd 3951	. . . 4 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)} = {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
17	1, 16	eqtr4id 2790	. . 3 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → (𝐴 × 𝐵) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
18		inrab 4268	. . 3 ⊢ ({𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴} ∩ {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵}) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)}
19	17, 18	eqtr4di 2789	. 2 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → (𝐴 × 𝐵) = ({𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴} ∩ {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵}))
20		f1stres 7957	. . . . 5 ⊢ (1^st ↾ (𝐸 × 𝐹)):(𝐸 × 𝐹)⟶𝐸
21		ffn 6662	. . . . 5 ⊢ ((1^st ↾ (𝐸 × 𝐹)):(𝐸 × 𝐹)⟶𝐸 → (1^st ↾ (𝐸 × 𝐹)) Fn (𝐸 × 𝐹))
22		fncnvima2 7006	. . . . 5 ⊢ ((1^st ↾ (𝐸 × 𝐹)) Fn (𝐸 × 𝐹) → (^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐴})
23	20, 21, 22	mp2b 10	. . . 4 ⊢ (^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐴}
24		fvres 6853	. . . . . 6 ⊢ (𝑟 ∈ (𝐸 × 𝐹) → ((1^st ↾ (𝐸 × 𝐹))‘𝑟) = (1^st ‘𝑟))
25	24	eleq1d 2821	. . . . 5 ⊢ (𝑟 ∈ (𝐸 × 𝐹) → (((1^st ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐴 ↔ (1^st ‘𝑟) ∈ 𝐴))
26	25	rabbiia 3403	. . . 4 ⊢ {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐴} = {𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴}
27	23, 26	eqtri 2759	. . 3 ⊢ (^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) = {𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴}
28		f2ndres 7958	. . . . 5 ⊢ (2^nd ↾ (𝐸 × 𝐹)):(𝐸 × 𝐹)⟶𝐹
29		ffn 6662	. . . . 5 ⊢ ((2^nd ↾ (𝐸 × 𝐹)):(𝐸 × 𝐹)⟶𝐹 → (2^nd ↾ (𝐸 × 𝐹)) Fn (𝐸 × 𝐹))
30		fncnvima2 7006	. . . . 5 ⊢ ((2^nd ↾ (𝐸 × 𝐹)) Fn (𝐸 × 𝐹) → (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((2^nd ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐵})
31	28, 29, 30	mp2b 10	. . . 4 ⊢ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((2^nd ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐵}
32		fvres 6853	. . . . . 6 ⊢ (𝑟 ∈ (𝐸 × 𝐹) → ((2^nd ↾ (𝐸 × 𝐹))‘𝑟) = (2^nd ‘𝑟))
33	32	eleq1d 2821	. . . . 5 ⊢ (𝑟 ∈ (𝐸 × 𝐹) → (((2^nd ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐵 ↔ (2^nd ‘𝑟) ∈ 𝐵))
34	33	rabbiia 3403	. . . 4 ⊢ {𝑟 ∈ (𝐸 × 𝐹) ∣ ((2^nd ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐵} = {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵}
35	31, 34	eqtri 2759	. . 3 ⊢ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵) = {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵}
36	27, 35	ineq12i 4170	. 2 ⊢ ((^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) ∩ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵)) = ({𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴} ∩ {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵})
37	19, 36	eqtr4di 2789	1 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → (𝐴 × 𝐵) = ((^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) ∩ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {crab 3399 Vcvv 3440 ∩ cin 3900 ⊆ wss 3901 × cxp 5622 ^◡ccnv 5623 ↾ cres 5626 “ cima 5627 Fn wfn 6487 ⟶wf 6488 ‘cfv 6492 1^st c1st 7931 2^nd c2nd 7932

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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-1st 7933 df-2nd 7934

This theorem is referenced by: cnre2csqima 34068 sxbrsigalem2 34443 sxbrsiga 34447

W3C validator