Theorem xppreima 32569

Description: The preimage of a Cartesian product is the intersection of the preimages of each component function. (Contributed by Thierry Arnoux, 6-Jun-2017.)

Assertion

Ref	Expression
xppreima	⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) → (◡𝐹 “ (𝑌 × 𝑍)) = ((◡(1st ∘ 𝐹) “ 𝑌) ∩ (◡(2nd ∘ 𝐹) “ 𝑍)))

Proof of Theorem xppreima

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funfn 6546	. . . . 5 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2		fncnvima2 7033	. . . . 5 ⊢ (𝐹 Fn dom 𝐹 → (◡𝐹 “ (𝑌 × 𝑍)) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ∈ (𝑌 × 𝑍)})
3	1, 2	sylbi 217	. . . 4 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝑌 × 𝑍)) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ∈ (𝑌 × 𝑍)})
4	3	adantr 480	. . 3 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) → (◡𝐹 “ (𝑌 × 𝑍)) = {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ∈ (𝑌 × 𝑍)})
5		elxp6 8002	. . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ (𝑌 × 𝑍) ↔ ((𝐹‘𝑥) = ⟨(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))⟩ ∧ ((1st ‘(𝐹‘𝑥)) ∈ 𝑌 ∧ (2nd ‘(𝐹‘𝑥)) ∈ 𝑍)))
6		fvco 6959	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((1st ∘ 𝐹)‘𝑥) = (1st ‘(𝐹‘𝑥)))
7		fvco 6959	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((2nd ∘ 𝐹)‘𝑥) = (2nd ‘(𝐹‘𝑥)))
8	6, 7	opeq12d 4845	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ⟨((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)⟩ = ⟨(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))⟩)
9	8	eqeq2d 2740	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) = ⟨((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)⟩ ↔ (𝐹‘𝑥) = ⟨(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))⟩))
10	6	eleq1d 2813	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ↔ (1st ‘(𝐹‘𝑥)) ∈ 𝑌))
11	7	eleq1d 2813	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍 ↔ (2nd ‘(𝐹‘𝑥)) ∈ 𝑍))
12	10, 11	anbi12d 632	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ∧ ((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍) ↔ ((1st ‘(𝐹‘𝑥)) ∈ 𝑌 ∧ (2nd ‘(𝐹‘𝑥)) ∈ 𝑍)))
13	9, 12	anbi12d 632	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (((𝐹‘𝑥) = ⟨((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)⟩ ∧ (((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ∧ ((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍)) ↔ ((𝐹‘𝑥) = ⟨(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))⟩ ∧ ((1st ‘(𝐹‘𝑥)) ∈ 𝑌 ∧ (2nd ‘(𝐹‘𝑥)) ∈ 𝑍))))
14	5, 13	bitr4id 290	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) ∈ (𝑌 × 𝑍) ↔ ((𝐹‘𝑥) = ⟨((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)⟩ ∧ (((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ∧ ((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍))))
15	14	adantlr 715	. . . . 5 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) ∈ (𝑌 × 𝑍) ↔ ((𝐹‘𝑥) = ⟨((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)⟩ ∧ (((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ∧ ((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍))))
16		opfv 32568	. . . . . 6 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) = ⟨((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)⟩)
17	16	biantrurd 532	. . . . 5 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → ((((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ∧ ((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍) ↔ ((𝐹‘𝑥) = ⟨((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)⟩ ∧ (((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ∧ ((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍))))
18		fo1st 7988	. . . . . . . . . . 11 ⊢ 1st :V–onto→V
19		fofun 6773	. . . . . . . . . . 11 ⊢ (1st :V–onto→V → Fun 1st )
20	18, 19	ax-mp 5	. . . . . . . . . 10 ⊢ Fun 1st
21		funco 6556	. . . . . . . . . 10 ⊢ ((Fun 1st ∧ Fun 𝐹) → Fun (1st ∘ 𝐹))
22	20, 21	mpan 690	. . . . . . . . 9 ⊢ (Fun 𝐹 → Fun (1st ∘ 𝐹))
23	22	adantr 480	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → Fun (1st ∘ 𝐹))
24		ssv 3971	. . . . . . . . . . . 12 ⊢ (𝐹 “ dom 𝐹) ⊆ V
25		fof 6772	. . . . . . . . . . . . 13 ⊢ (1st :V–onto→V → 1st :V⟶V)
26		fdm 6697	. . . . . . . . . . . . 13 ⊢ (1st :V⟶V → dom 1st = V)
27	18, 25, 26	mp2b 10	. . . . . . . . . . . 12 ⊢ dom 1st = V
28	24, 27	sseqtrri 3996	. . . . . . . . . . 11 ⊢ (𝐹 “ dom 𝐹) ⊆ dom 1st
29		ssid 3969	. . . . . . . . . . . 12 ⊢ dom 𝐹 ⊆ dom 𝐹
30		funimass3 7026	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ dom 𝐹 ⊆ dom 𝐹) → ((𝐹 “ dom 𝐹) ⊆ dom 1st ↔ dom 𝐹 ⊆ (◡𝐹 “ dom 1st )))
31	29, 30	mpan2 691	. . . . . . . . . . 11 ⊢ (Fun 𝐹 → ((𝐹 “ dom 𝐹) ⊆ dom 1st ↔ dom 𝐹 ⊆ (◡𝐹 “ dom 1st )))
32	28, 31	mpbii 233	. . . . . . . . . 10 ⊢ (Fun 𝐹 → dom 𝐹 ⊆ (◡𝐹 “ dom 1st ))
33	32	sselda 3946	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ (◡𝐹 “ dom 1st ))
34		dmco 6227	. . . . . . . . 9 ⊢ dom (1st ∘ 𝐹) = (◡𝐹 “ dom 1st )
35	33, 34	eleqtrrdi 2839	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ dom (1st ∘ 𝐹))
36		fvimacnv 7025	. . . . . . . 8 ⊢ ((Fun (1st ∘ 𝐹) ∧ 𝑥 ∈ dom (1st ∘ 𝐹)) → (((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ↔ 𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌)))
37	23, 35, 36	syl2anc 584	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ↔ 𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌)))
38		fo2nd 7989	. . . . . . . . . . 11 ⊢ 2nd :V–onto→V
39		fofun 6773	. . . . . . . . . . 11 ⊢ (2nd :V–onto→V → Fun 2nd )
40	38, 39	ax-mp 5	. . . . . . . . . 10 ⊢ Fun 2nd
41		funco 6556	. . . . . . . . . 10 ⊢ ((Fun 2nd ∧ Fun 𝐹) → Fun (2nd ∘ 𝐹))
42	40, 41	mpan 690	. . . . . . . . 9 ⊢ (Fun 𝐹 → Fun (2nd ∘ 𝐹))
43	42	adantr 480	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → Fun (2nd ∘ 𝐹))
44		fof 6772	. . . . . . . . . . . . 13 ⊢ (2nd :V–onto→V → 2nd :V⟶V)
45		fdm 6697	. . . . . . . . . . . . 13 ⊢ (2nd :V⟶V → dom 2nd = V)
46	38, 44, 45	mp2b 10	. . . . . . . . . . . 12 ⊢ dom 2nd = V
47	24, 46	sseqtrri 3996	. . . . . . . . . . 11 ⊢ (𝐹 “ dom 𝐹) ⊆ dom 2nd
48		funimass3 7026	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ dom 𝐹 ⊆ dom 𝐹) → ((𝐹 “ dom 𝐹) ⊆ dom 2nd ↔ dom 𝐹 ⊆ (◡𝐹 “ dom 2nd )))
49	29, 48	mpan2 691	. . . . . . . . . . 11 ⊢ (Fun 𝐹 → ((𝐹 “ dom 𝐹) ⊆ dom 2nd ↔ dom 𝐹 ⊆ (◡𝐹 “ dom 2nd )))
50	47, 49	mpbii 233	. . . . . . . . . 10 ⊢ (Fun 𝐹 → dom 𝐹 ⊆ (◡𝐹 “ dom 2nd ))
51	50	sselda 3946	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ (◡𝐹 “ dom 2nd ))
52		dmco 6227	. . . . . . . . 9 ⊢ dom (2nd ∘ 𝐹) = (◡𝐹 “ dom 2nd )
53	51, 52	eleqtrrdi 2839	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → 𝑥 ∈ dom (2nd ∘ 𝐹))
54		fvimacnv 7025	. . . . . . . 8 ⊢ ((Fun (2nd ∘ 𝐹) ∧ 𝑥 ∈ dom (2nd ∘ 𝐹)) → (((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍 ↔ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍)))
55	43, 53, 54	syl2anc 584	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍 ↔ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍)))
56	37, 55	anbi12d 632	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ∧ ((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍) ↔ (𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌) ∧ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍))))
57	56	adantlr 715	. . . . 5 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → ((((1st ∘ 𝐹)‘𝑥) ∈ 𝑌 ∧ ((2nd ∘ 𝐹)‘𝑥) ∈ 𝑍) ↔ (𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌) ∧ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍))))
58	15, 17, 57	3bitr2d 307	. . . 4 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) ∈ (𝑌 × 𝑍) ↔ (𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌) ∧ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍))))
59	58	rabbidva 3412	. . 3 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) → {𝑥 ∈ dom 𝐹 ∣ (𝐹‘𝑥) ∈ (𝑌 × 𝑍)} = {𝑥 ∈ dom 𝐹 ∣ (𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌) ∧ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍))})
60	4, 59	eqtrd 2764	. 2 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) → (◡𝐹 “ (𝑌 × 𝑍)) = {𝑥 ∈ dom 𝐹 ∣ (𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌) ∧ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍))})
61		dfin5 3922	. . . 4 ⊢ (dom 𝐹 ∩ (◡(1st ∘ 𝐹) “ 𝑌)) = {𝑥 ∈ dom 𝐹 ∣ 𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌)}
62		dfin5 3922	. . . 4 ⊢ (dom 𝐹 ∩ (◡(2nd ∘ 𝐹) “ 𝑍)) = {𝑥 ∈ dom 𝐹 ∣ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍)}
63	61, 62	ineq12i 4181	. . 3 ⊢ ((dom 𝐹 ∩ (◡(1st ∘ 𝐹) “ 𝑌)) ∩ (dom 𝐹 ∩ (◡(2nd ∘ 𝐹) “ 𝑍))) = ({𝑥 ∈ dom 𝐹 ∣ 𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌)} ∩ {𝑥 ∈ dom 𝐹 ∣ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍)})
64		cnvimass 6053	. . . . . 6 ⊢ (◡(1st ∘ 𝐹) “ 𝑌) ⊆ dom (1st ∘ 𝐹)
65		dmcoss 5938	. . . . . 6 ⊢ dom (1st ∘ 𝐹) ⊆ dom 𝐹
66	64, 65	sstri 3956	. . . . 5 ⊢ (◡(1st ∘ 𝐹) “ 𝑌) ⊆ dom 𝐹
67		sseqin2 4186	. . . . 5 ⊢ ((◡(1st ∘ 𝐹) “ 𝑌) ⊆ dom 𝐹 ↔ (dom 𝐹 ∩ (◡(1st ∘ 𝐹) “ 𝑌)) = (◡(1st ∘ 𝐹) “ 𝑌))
68	66, 67	mpbi 230	. . . 4 ⊢ (dom 𝐹 ∩ (◡(1st ∘ 𝐹) “ 𝑌)) = (◡(1st ∘ 𝐹) “ 𝑌)
69		cnvimass 6053	. . . . . 6 ⊢ (◡(2nd ∘ 𝐹) “ 𝑍) ⊆ dom (2nd ∘ 𝐹)
70		dmcoss 5938	. . . . . 6 ⊢ dom (2nd ∘ 𝐹) ⊆ dom 𝐹
71	69, 70	sstri 3956	. . . . 5 ⊢ (◡(2nd ∘ 𝐹) “ 𝑍) ⊆ dom 𝐹
72		sseqin2 4186	. . . . 5 ⊢ ((◡(2nd ∘ 𝐹) “ 𝑍) ⊆ dom 𝐹 ↔ (dom 𝐹 ∩ (◡(2nd ∘ 𝐹) “ 𝑍)) = (◡(2nd ∘ 𝐹) “ 𝑍))
73	71, 72	mpbi 230	. . . 4 ⊢ (dom 𝐹 ∩ (◡(2nd ∘ 𝐹) “ 𝑍)) = (◡(2nd ∘ 𝐹) “ 𝑍)
74	68, 73	ineq12i 4181	. . 3 ⊢ ((dom 𝐹 ∩ (◡(1st ∘ 𝐹) “ 𝑌)) ∩ (dom 𝐹 ∩ (◡(2nd ∘ 𝐹) “ 𝑍))) = ((◡(1st ∘ 𝐹) “ 𝑌) ∩ (◡(2nd ∘ 𝐹) “ 𝑍))
75		inrab 4279	. . 3 ⊢ ({𝑥 ∈ dom 𝐹 ∣ 𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌)} ∩ {𝑥 ∈ dom 𝐹 ∣ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍)}) = {𝑥 ∈ dom 𝐹 ∣ (𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌) ∧ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍))}
76	63, 74, 75	3eqtr3ri 2761	. 2 ⊢ {𝑥 ∈ dom 𝐹 ∣ (𝑥 ∈ (◡(1st ∘ 𝐹) “ 𝑌) ∧ 𝑥 ∈ (◡(2nd ∘ 𝐹) “ 𝑍))} = ((◡(1st ∘ 𝐹) “ 𝑌) ∩ (◡(2nd ∘ 𝐹) “ 𝑍))
77	60, 76	eqtrdi 2780	1 ⊢ ((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) → (◡𝐹 “ (𝑌 × 𝑍)) = ((◡(1st ∘ 𝐹) “ 𝑌) ∩ (◡(2nd ∘ 𝐹) “ 𝑍)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {crab 3405  Vcvv 3447   ∩ cin 3913   ⊆ wss 3914  ⟨cop 4595   × cxp 5636  ^◡ccnv 5637  dom cdm 5638  ran crn 5639   “ cima 5641   ∘ ccom 5642  Fun wfun 6505   Fn wfn 6506  ⟶wf 6507  –onto→wfo 6509  ‘cfv 6511  1^st c1st 7966  2^nd c2nd 7967

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fo 6517  df-fv 6519  df-1st 7968  df-2nd 7969

This theorem is referenced by:  xppreima2  32575