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 34650

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 8072	. . . 4 ⊢ (𝐴 × 𝐵) = {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)}
2		xpss 5674	. . . . . 6 ⊢ (𝐸 × 𝐹) ⊆ (V × V)
3		rabss2 4005	. . . . . 6 ⊢ ((𝐸 × 𝐹) ⊆ (V × V) → {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)} ⊆ {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
4	2, 3	mp1i 14	. . . . 5 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)} ⊆ {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
5		simprl 783	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → 𝑟 ∈ (V × V))
6		simpll 779	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → 𝐴 ⊆ 𝐸)
7		simprrl 793	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → (1^st ‘𝑟) ∈ 𝐴)
8	6, 7	sseldd 3914	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → (1^st ‘𝑟) ∈ 𝐸)
9		simplr 781	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → 𝐵 ⊆ 𝐹)
10		simprrr 794	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → (2^nd ‘𝑟) ∈ 𝐵)
11	9, 10	sseldd 3914	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → (2^nd ‘𝑟) ∈ 𝐹)
12	8, 11	jca 521	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → ((1^st ‘𝑟) ∈ 𝐸 ∧ (2^nd ‘𝑟) ∈ 𝐹))
13		elxp7 8070	. . . . . . 7 ⊢ (𝑟 ∈ (𝐸 × 𝐹) ↔ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐸 ∧ (2^nd ‘𝑟) ∈ 𝐹)))
14	5, 12, 13	sylanbrc 595	. . . . . 6 ⊢ (((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) ∧ (𝑟 ∈ (V × V) ∧ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵))) → 𝑟 ∈ (𝐸 × 𝐹))
15	14	rabss3d 4009	. . . . 5 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)} ⊆ {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
16	4, 15	eqssd 3930	. . . 4 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)} = {𝑟 ∈ (V × V) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
17	1, 16	eqtr4id 2817	. . 3 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → (𝐴 × 𝐵) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)})
18		inrab 4264	. . 3 ⊢ ({𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴} ∩ {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵}) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ‘𝑟) ∈ 𝐴 ∧ (2^nd ‘𝑟) ∈ 𝐵)}
19	17, 18	eqtr4di 2816	. 2 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → (𝐴 × 𝐵) = ({𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴} ∩ {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵}))
20		f1stres 8059	. . . . 5 ⊢ (1^st ↾ (𝐸 × 𝐹)):(𝐸 × 𝐹)⟶𝐸
21		ffn 6739	. . . . 5 ⊢ ((1^st ↾ (𝐸 × 𝐹)):(𝐸 × 𝐹)⟶𝐸 → (1^st ↾ (𝐸 × 𝐹)) Fn (𝐸 × 𝐹))
22		fncnvima2 7092	. . . . 5 ⊢ ((1^st ↾ (𝐸 × 𝐹)) Fn (𝐸 × 𝐹) → (^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐴})
23	20, 21, 22	mp2b 10	. . . 4 ⊢ (^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐴}
24		fvres 6935	. . . . . 6 ⊢ (𝑟 ∈ (𝐸 × 𝐹) → ((1^st ↾ (𝐸 × 𝐹))‘𝑟) = (1^st ‘𝑟))
25	24	eleq1d 2849	. . . . 5 ⊢ (𝑟 ∈ (𝐸 × 𝐹) → (((1^st ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐴 ↔ (1^st ‘𝑟) ∈ 𝐴))
26	25	rabbiia 3420	. . . 4 ⊢ {𝑟 ∈ (𝐸 × 𝐹) ∣ ((1^st ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐴} = {𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴}
27	23, 26	eqtri 2786	. . 3 ⊢ (^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) = {𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴}
28		f2ndres 8060	. . . . 5 ⊢ (2^nd ↾ (𝐸 × 𝐹)):(𝐸 × 𝐹)⟶𝐹
29		ffn 6739	. . . . 5 ⊢ ((2^nd ↾ (𝐸 × 𝐹)):(𝐸 × 𝐹)⟶𝐹 → (2^nd ↾ (𝐸 × 𝐹)) Fn (𝐸 × 𝐹))
30		fncnvima2 7092	. . . . 5 ⊢ ((2^nd ↾ (𝐸 × 𝐹)) Fn (𝐸 × 𝐹) → (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((2^nd ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐵})
31	28, 29, 30	mp2b 10	. . . 4 ⊢ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵) = {𝑟 ∈ (𝐸 × 𝐹) ∣ ((2^nd ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐵}
32		fvres 6935	. . . . . 6 ⊢ (𝑟 ∈ (𝐸 × 𝐹) → ((2^nd ↾ (𝐸 × 𝐹))‘𝑟) = (2^nd ‘𝑟))
33	32	eleq1d 2849	. . . . 5 ⊢ (𝑟 ∈ (𝐸 × 𝐹) → (((2^nd ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐵 ↔ (2^nd ‘𝑟) ∈ 𝐵))
34	33	rabbiia 3420	. . . 4 ⊢ {𝑟 ∈ (𝐸 × 𝐹) ∣ ((2^nd ↾ (𝐸 × 𝐹))‘𝑟) ∈ 𝐵} = {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵}
35	31, 34	eqtri 2786	. . 3 ⊢ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵) = {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵}
36	27, 35	ineq12i 4118	. 2 ⊢ ((^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) ∩ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵)) = ({𝑟 ∈ (𝐸 × 𝐹) ∣ (1^st ‘𝑟) ∈ 𝐴} ∩ {𝑟 ∈ (𝐸 × 𝐹) ∣ (2^nd ‘𝑟) ∈ 𝐵})
37	19, 36	eqtr4di 2816	1 ⊢ ((𝐴 ⊆ 𝐸 ∧ 𝐵 ⊆ 𝐹) → (𝐴 × 𝐵) = ((^◡(1^st ↾ (𝐸 × 𝐹)) “ 𝐴) ∩ (^◡(2^nd ↾ (𝐸 × 𝐹)) “ 𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {crab 3416 Vcvv 3454 ⊆ wss 3900 ∩ cin 4092 × cxp 5656 ^◡ccnv 5657 ↾ cres 5660 “ cima 5661 Fn wfn 6561 ⟶wf 6562 ‘cfv 6566 1^st c1st 8033 2^nd c2nd 8034

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fv 6574 df-1st 8035 df-2nd 8036

This theorem is used by: cnre2csqima 34654 sxbrsigalem2 35029 sxbrsiga 35033

W3C validator