Theorem fimaproj 29900

Description: Image of a cartesian product for a function on pairs, given two projections 𝐹 and 𝐺. (Contributed by Thierry Arnoux, 30-Dec-2019.)

Hypotheses

Ref	Expression
fvproj.h	⊢ 𝐻 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩)
fimaproj.f	⊢ (𝜑 → 𝐹 Fn 𝐴)
fimaproj.g	⊢ (𝜑 → 𝐺 Fn 𝐵)
fimaproj.x	⊢ (𝜑 → 𝑋 ⊆ 𝐴)
fimaproj.y	⊢ (𝜑 → 𝑌 ⊆ 𝐵)

Assertion

Ref	Expression
fimaproj	⊢ (𝜑 → (𝐻 “ (𝑋 × 𝑌)) = ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥,𝐻,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝑋(𝑥,𝑦)   𝑌(𝑥,𝑦)

Proof of Theorem fimaproj

Dummy variables 𝑎 𝑏 𝑧 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opex 4932	. . . . 5 ⊢ ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩ ∈ V
2		fvproj.h	. . . . . 6 ⊢ 𝐻 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩)
3		vex 3203	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
4		vex 3203	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
5	3, 4	op1std 7178	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (1st ‘𝑧) = 𝑥)
6	5	fveq2d 6195	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐹‘(1st ‘𝑧)) = (𝐹‘𝑥))
7	3, 4	op2ndd 7179	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (2nd ‘𝑧) = 𝑦)
8	7	fveq2d 6195	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐺‘(2nd ‘𝑧)) = (𝐺‘𝑦))
9	6, 8	opeq12d 4410	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩ = ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩)
10	9	mpt2mpt 6752	. . . . . 6 ⊢ (𝑧 ∈ (𝐴 × 𝐵) ↦ ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩)
11	2, 10	eqtr4i 2647	. . . . 5 ⊢ 𝐻 = (𝑧 ∈ (𝐴 × 𝐵) ↦ ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩)
12	1, 11	fnmpti 6022	. . . 4 ⊢ 𝐻 Fn (𝐴 × 𝐵)
13		fimaproj.x	. . . . 5 ⊢ (𝜑 → 𝑋 ⊆ 𝐴)
14		fimaproj.y	. . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝐵)
15		xpss12 5225	. . . . 5 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐵) → (𝑋 × 𝑌) ⊆ (𝐴 × 𝐵))
16	13, 14, 15	syl2anc 693	. . . 4 ⊢ (𝜑 → (𝑋 × 𝑌) ⊆ (𝐴 × 𝐵))
17		fvelimab 6253	. . . 4 ⊢ ((𝐻 Fn (𝐴 × 𝐵) ∧ (𝑋 × 𝑌) ⊆ (𝐴 × 𝐵)) → (𝑐 ∈ (𝐻 “ (𝑋 × 𝑌)) ↔ ∃𝑧 ∈ (𝑋 × 𝑌)(𝐻‘𝑧) = 𝑐))
18	12, 16, 17	sylancr 695	. . 3 ⊢ (𝜑 → (𝑐 ∈ (𝐻 “ (𝑋 × 𝑌)) ↔ ∃𝑧 ∈ (𝑋 × 𝑌)(𝐻‘𝑧) = 𝑐))
19		simp-4r 807	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → 𝑎 ∈ 𝑋)
20		simplr 792	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → 𝑏 ∈ 𝑌)
21		opelxpi 5148	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑌) → ⟨𝑎, 𝑏⟩ ∈ (𝑋 × 𝑌))
22	19, 20, 21	syl2anc 693	. . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → ⟨𝑎, 𝑏⟩ ∈ (𝑋 × 𝑌))
23		simpllr 799	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → (𝐹‘𝑎) = (1st ‘𝑐))
24		simpr 477	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → (𝐺‘𝑏) = (2nd ‘𝑐))
25	23, 24	opeq12d 4410	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → ⟨(𝐹‘𝑎), (𝐺‘𝑏)⟩ = ⟨(1st ‘𝑐), (2nd ‘𝑐)⟩)
26	13	ad5antr 770	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → 𝑋 ⊆ 𝐴)
27	26, 19	sseldd 3604	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → 𝑎 ∈ 𝐴)
28	14	ad5antr 770	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → 𝑌 ⊆ 𝐵)
29	28, 20	sseldd 3604	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → 𝑏 ∈ 𝐵)
30	2, 27, 29	fvproj 29899	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → (𝐻‘⟨𝑎, 𝑏⟩) = ⟨(𝐹‘𝑎), (𝐺‘𝑏)⟩)
31		1st2nd2 7205	. . . . . . . . 9 ⊢ (𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)) → 𝑐 = ⟨(1st ‘𝑐), (2nd ‘𝑐)⟩)
32	31	ad5antlr 771	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → 𝑐 = ⟨(1st ‘𝑐), (2nd ‘𝑐)⟩)
33	25, 30, 32	3eqtr4d 2666	. . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → (𝐻‘⟨𝑎, 𝑏⟩) = 𝑐)
34		fveq2 6191	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝑎, 𝑏⟩ → (𝐻‘𝑧) = (𝐻‘⟨𝑎, 𝑏⟩))
35	34	eqeq1d 2624	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑎, 𝑏⟩ → ((𝐻‘𝑧) = 𝑐 ↔ (𝐻‘⟨𝑎, 𝑏⟩) = 𝑐))
36	35	rspcev 3309	. . . . . . 7 ⊢ ((⟨𝑎, 𝑏⟩ ∈ (𝑋 × 𝑌) ∧ (𝐻‘⟨𝑎, 𝑏⟩) = 𝑐) → ∃𝑧 ∈ (𝑋 × 𝑌)(𝐻‘𝑧) = 𝑐)
37	22, 33, 36	syl2anc 693	. . . . . 6 ⊢ ((((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) ∧ 𝑏 ∈ 𝑌) ∧ (𝐺‘𝑏) = (2nd ‘𝑐)) → ∃𝑧 ∈ (𝑋 × 𝑌)(𝐻‘𝑧) = 𝑐)
38		fimaproj.g	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 Fn 𝐵)
39	38	ad3antrrr 766	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) → 𝐺 Fn 𝐵)
40		fnfun 5988	. . . . . . . 8 ⊢ (𝐺 Fn 𝐵 → Fun 𝐺)
41	39, 40	syl 17	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) → Fun 𝐺)
42		xp2nd 7199	. . . . . . . 8 ⊢ (𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)) → (2nd ‘𝑐) ∈ (𝐺 “ 𝑌))
43	42	ad3antlr 767	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) → (2nd ‘𝑐) ∈ (𝐺 “ 𝑌))
44		fvelima 6248	. . . . . . 7 ⊢ ((Fun 𝐺 ∧ (2nd ‘𝑐) ∈ (𝐺 “ 𝑌)) → ∃𝑏 ∈ 𝑌 (𝐺‘𝑏) = (2nd ‘𝑐))
45	41, 43, 44	syl2anc 693	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) → ∃𝑏 ∈ 𝑌 (𝐺‘𝑏) = (2nd ‘𝑐))
46	37, 45	r19.29a 3078	. . . . 5 ⊢ ((((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) ∧ 𝑎 ∈ 𝑋) ∧ (𝐹‘𝑎) = (1st ‘𝑐)) → ∃𝑧 ∈ (𝑋 × 𝑌)(𝐻‘𝑧) = 𝑐)
47		fimaproj.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹 Fn 𝐴)
48	47	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) → 𝐹 Fn 𝐴)
49		fnfun 5988	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
50	48, 49	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) → Fun 𝐹)
51		xp1st 7198	. . . . . . 7 ⊢ (𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)) → (1st ‘𝑐) ∈ (𝐹 “ 𝑋))
52	51	adantl 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) → (1st ‘𝑐) ∈ (𝐹 “ 𝑋))
53		fvelima 6248	. . . . . 6 ⊢ ((Fun 𝐹 ∧ (1st ‘𝑐) ∈ (𝐹 “ 𝑋)) → ∃𝑎 ∈ 𝑋 (𝐹‘𝑎) = (1st ‘𝑐))
54	50, 52, 53	syl2anc 693	. . . . 5 ⊢ ((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) → ∃𝑎 ∈ 𝑋 (𝐹‘𝑎) = (1st ‘𝑐))
55	46, 54	r19.29a 3078	. . . 4 ⊢ ((𝜑 ∧ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))) → ∃𝑧 ∈ (𝑋 × 𝑌)(𝐻‘𝑧) = 𝑐)
56		simpr 477	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → (𝐻‘𝑧) = 𝑐)
57	16	ad2antrr 762	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → (𝑋 × 𝑌) ⊆ (𝐴 × 𝐵))
58		simplr 792	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → 𝑧 ∈ (𝑋 × 𝑌))
59	57, 58	sseldd 3604	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → 𝑧 ∈ (𝐴 × 𝐵))
60	11	fvmpt2 6291	. . . . . . . 8 ⊢ ((𝑧 ∈ (𝐴 × 𝐵) ∧ ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩ ∈ V) → (𝐻‘𝑧) = ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩)
61	59, 1, 60	sylancl 694	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → (𝐻‘𝑧) = ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩)
62	47	ad2antrr 762	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → 𝐹 Fn 𝐴)
63	13	ad2antrr 762	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → 𝑋 ⊆ 𝐴)
64		xp1st 7198	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (1st ‘𝑧) ∈ 𝑋)
65	58, 64	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → (1st ‘𝑧) ∈ 𝑋)
66		fnfvima 6496	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴 ∧ (1st ‘𝑧) ∈ 𝑋) → (𝐹‘(1st ‘𝑧)) ∈ (𝐹 “ 𝑋))
67	62, 63, 65, 66	syl3anc 1326	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → (𝐹‘(1st ‘𝑧)) ∈ (𝐹 “ 𝑋))
68	38	ad2antrr 762	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → 𝐺 Fn 𝐵)
69	14	ad2antrr 762	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → 𝑌 ⊆ 𝐵)
70		xp2nd 7199	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝑋 × 𝑌) → (2nd ‘𝑧) ∈ 𝑌)
71	58, 70	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → (2nd ‘𝑧) ∈ 𝑌)
72		fnfvima 6496	. . . . . . . . 9 ⊢ ((𝐺 Fn 𝐵 ∧ 𝑌 ⊆ 𝐵 ∧ (2nd ‘𝑧) ∈ 𝑌) → (𝐺‘(2nd ‘𝑧)) ∈ (𝐺 “ 𝑌))
73	68, 69, 71, 72	syl3anc 1326	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → (𝐺‘(2nd ‘𝑧)) ∈ (𝐺 “ 𝑌))
74		opelxpi 5148	. . . . . . . 8 ⊢ (((𝐹‘(1st ‘𝑧)) ∈ (𝐹 “ 𝑋) ∧ (𝐺‘(2nd ‘𝑧)) ∈ (𝐺 “ 𝑌)) → ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩ ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)))
75	67, 73, 74	syl2anc 693	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → ⟨(𝐹‘(1st ‘𝑧)), (𝐺‘(2nd ‘𝑧))⟩ ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)))
76	61, 75	eqeltrd 2701	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → (𝐻‘𝑧) ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)))
77	56, 76	eqeltrrd 2702	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝑋 × 𝑌)) ∧ (𝐻‘𝑧) = 𝑐) → 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)))
78	77	r19.29an 3077	. . . 4 ⊢ ((𝜑 ∧ ∃𝑧 ∈ (𝑋 × 𝑌)(𝐻‘𝑧) = 𝑐) → 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)))
79	55, 78	impbida 877	. . 3 ⊢ (𝜑 → (𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)) ↔ ∃𝑧 ∈ (𝑋 × 𝑌)(𝐻‘𝑧) = 𝑐))
80	18, 79	bitr4d 271	. 2 ⊢ (𝜑 → (𝑐 ∈ (𝐻 “ (𝑋 × 𝑌)) ↔ 𝑐 ∈ ((𝐹 “ 𝑋) × (𝐺 “ 𝑌))))
81	80	eqrdv 2620	1 ⊢ (𝜑 → (𝐻 “ (𝑋 × 𝑌)) = ((𝐹 “ 𝑋) × (𝐺 “ 𝑌)))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ∃wrex 2913  Vcvv 3200   ⊆ wss 3574  ⟨cop 4183   ↦ cmpt 4729   × cxp 5112   “ cima 5117  Fun wfun 5882   Fn wfn 5883  ‘cfv 5888   ↦ cmpt2 6652  1^st c1st 7166  2^nd c2nd 7167

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169

This theorem is referenced by:  txomap  29901