Theorem 1stconst 6236

Description: The mapping of a restriction of the 1^st function to a constant function. (Contributed by NM, 14-Dec-2008.)

Assertion

Ref	Expression
1stconst	⊢ (𝐵 ∈ 𝑉 → (1st ↾ (𝐴 × {𝐵})):(𝐴 × {𝐵})–1-1-onto→𝐴)

Proof of Theorem 1stconst

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		snmg 3722	. . 3 ⊢ (𝐵 ∈ 𝑉 → ∃𝑥 𝑥 ∈ {𝐵})
2		fo1stresm 6176	. . 3 ⊢ (∃𝑥 𝑥 ∈ {𝐵} → (1st ↾ (𝐴 × {𝐵})):(𝐴 × {𝐵})–onto→𝐴)
3	1, 2	syl 14	. 2 ⊢ (𝐵 ∈ 𝑉 → (1st ↾ (𝐴 × {𝐵})):(𝐴 × {𝐵})–onto→𝐴)
4		moeq 2924	. . . . . 6 ⊢ ∃*𝑥 𝑥 = ⟨𝑦, 𝐵⟩
5	4	moani 2106	. . . . 5 ⊢ ∃*𝑥(𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)
6		vex 2752	. . . . . . . 8 ⊢ 𝑦 ∈ V
7	6	brres 4925	. . . . . . 7 ⊢ (𝑥(1st ↾ (𝐴 × {𝐵}))𝑦 ↔ (𝑥1st 𝑦 ∧ 𝑥 ∈ (𝐴 × {𝐵})))
8		fo1st 6172	. . . . . . . . . . 11 ⊢ 1st :V–onto→V
9		fofn 5452	. . . . . . . . . . 11 ⊢ (1st :V–onto→V → 1st Fn V)
10	8, 9	ax-mp 5	. . . . . . . . . 10 ⊢ 1st Fn V
11		vex 2752	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
12		fnbrfvb 5569	. . . . . . . . . 10 ⊢ ((1st Fn V ∧ 𝑥 ∈ V) → ((1st ‘𝑥) = 𝑦 ↔ 𝑥1st 𝑦))
13	10, 11, 12	mp2an 426	. . . . . . . . 9 ⊢ ((1st ‘𝑥) = 𝑦 ↔ 𝑥1st 𝑦)
14	13	anbi1i 458	. . . . . . . 8 ⊢ (((1st ‘𝑥) = 𝑦 ∧ 𝑥 ∈ (𝐴 × {𝐵})) ↔ (𝑥1st 𝑦 ∧ 𝑥 ∈ (𝐴 × {𝐵})))
15		elxp7 6185	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 × {𝐵}) ↔ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ {𝐵})))
16		eleq1 2250	. . . . . . . . . . . . . . 15 ⊢ ((1st ‘𝑥) = 𝑦 → ((1st ‘𝑥) ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
17	16	biimpa 296	. . . . . . . . . . . . . 14 ⊢ (((1st ‘𝑥) = 𝑦 ∧ (1st ‘𝑥) ∈ 𝐴) → 𝑦 ∈ 𝐴)
18	17	adantrr 479	. . . . . . . . . . . . 13 ⊢ (((1st ‘𝑥) = 𝑦 ∧ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ {𝐵})) → 𝑦 ∈ 𝐴)
19	18	adantrl 478	. . . . . . . . . . . 12 ⊢ (((1st ‘𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ {𝐵}))) → 𝑦 ∈ 𝐴)
20		elsni 3622	. . . . . . . . . . . . . 14 ⊢ ((2nd ‘𝑥) ∈ {𝐵} → (2nd ‘𝑥) = 𝐵)
21		eqopi 6187	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) = 𝑦 ∧ (2nd ‘𝑥) = 𝐵)) → 𝑥 = ⟨𝑦, 𝐵⟩)
22	21	an12s 565	. . . . . . . . . . . . . 14 ⊢ (((1st ‘𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ (2nd ‘𝑥) = 𝐵)) → 𝑥 = ⟨𝑦, 𝐵⟩)
23	20, 22	sylanr2 405	. . . . . . . . . . . . 13 ⊢ (((1st ‘𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ (2nd ‘𝑥) ∈ {𝐵})) → 𝑥 = ⟨𝑦, 𝐵⟩)
24	23	adantrrl 486	. . . . . . . . . . . 12 ⊢ (((1st ‘𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ {𝐵}))) → 𝑥 = ⟨𝑦, 𝐵⟩)
25	19, 24	jca 306	. . . . . . . . . . 11 ⊢ (((1st ‘𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ 𝐴 ∧ (2nd ‘𝑥) ∈ {𝐵}))) → (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩))
26	15, 25	sylan2b 287	. . . . . . . . . 10 ⊢ (((1st ‘𝑥) = 𝑦 ∧ 𝑥 ∈ (𝐴 × {𝐵})) → (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩))
27	26	adantl 277	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑉 ∧ ((1st ‘𝑥) = 𝑦 ∧ 𝑥 ∈ (𝐴 × {𝐵}))) → (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩))
28		simprr 531	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → 𝑥 = ⟨𝑦, 𝐵⟩)
29	28	fveq2d 5531	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → (1st ‘𝑥) = (1st ‘⟨𝑦, 𝐵⟩))
30		simprl 529	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → 𝑦 ∈ 𝐴)
31		simpl 109	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → 𝐵 ∈ 𝑉)
32		op1stg 6165	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → (1st ‘⟨𝑦, 𝐵⟩) = 𝑦)
33	30, 31, 32	syl2anc 411	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → (1st ‘⟨𝑦, 𝐵⟩) = 𝑦)
34	29, 33	eqtrd 2220	. . . . . . . . . 10 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → (1st ‘𝑥) = 𝑦)
35		snidg 3633	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ {𝐵})
36	35	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → 𝐵 ∈ {𝐵})
37		opelxpi 4670	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝐵 ∈ {𝐵}) → ⟨𝑦, 𝐵⟩ ∈ (𝐴 × {𝐵}))
38	30, 36, 37	syl2anc 411	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → ⟨𝑦, 𝐵⟩ ∈ (𝐴 × {𝐵}))
39	28, 38	eqeltrd 2264	. . . . . . . . . 10 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → 𝑥 ∈ (𝐴 × {𝐵}))
40	34, 39	jca 306	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)) → ((1st ‘𝑥) = 𝑦 ∧ 𝑥 ∈ (𝐴 × {𝐵})))
41	27, 40	impbida 596	. . . . . . . 8 ⊢ (𝐵 ∈ 𝑉 → (((1st ‘𝑥) = 𝑦 ∧ 𝑥 ∈ (𝐴 × {𝐵})) ↔ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)))
42	14, 41	bitr3id 194	. . . . . . 7 ⊢ (𝐵 ∈ 𝑉 → ((𝑥1st 𝑦 ∧ 𝑥 ∈ (𝐴 × {𝐵})) ↔ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)))
43	7, 42	bitrid 192	. . . . . 6 ⊢ (𝐵 ∈ 𝑉 → (𝑥(1st ↾ (𝐴 × {𝐵}))𝑦 ↔ (𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)))
44	43	mobidv 2072	. . . . 5 ⊢ (𝐵 ∈ 𝑉 → (∃*𝑥 𝑥(1st ↾ (𝐴 × {𝐵}))𝑦 ↔ ∃*𝑥(𝑦 ∈ 𝐴 ∧ 𝑥 = ⟨𝑦, 𝐵⟩)))
45	5, 44	mpbiri 168	. . . 4 ⊢ (𝐵 ∈ 𝑉 → ∃*𝑥 𝑥(1st ↾ (𝐴 × {𝐵}))𝑦)
46	45	alrimiv 1884	. . 3 ⊢ (𝐵 ∈ 𝑉 → ∀𝑦∃*𝑥 𝑥(1st ↾ (𝐴 × {𝐵}))𝑦)
47		funcnv2 5288	. . 3 ⊢ (Fun ◡(1st ↾ (𝐴 × {𝐵})) ↔ ∀𝑦∃*𝑥 𝑥(1st ↾ (𝐴 × {𝐵}))𝑦)
48	46, 47	sylibr 134	. 2 ⊢ (𝐵 ∈ 𝑉 → Fun ◡(1st ↾ (𝐴 × {𝐵})))
49		dff1o3 5479	. 2 ⊢ ((1st ↾ (𝐴 × {𝐵})):(𝐴 × {𝐵})–1-1-onto→𝐴 ↔ ((1st ↾ (𝐴 × {𝐵})):(𝐴 × {𝐵})–onto→𝐴 ∧ Fun ◡(1st ↾ (𝐴 × {𝐵}))))
50	3, 48, 49	sylanbrc 417	1 ⊢ (𝐵 ∈ 𝑉 → (1st ↾ (𝐴 × {𝐵})):(𝐴 × {𝐵})–1-1-onto→𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1361   = wceq 1363  ∃wex 1502  ∃*wmo 2037   ∈ wcel 2158  Vcvv 2749  {csn 3604  ⟨cop 3607   class class class wbr 4015   × cxp 4636  ^◡ccnv 4637   ↾ cres 4640  Fun wfun 5222   Fn wfn 5223  –onto→wfo 5226  –1-1-onto→wf1o 5227  ‘cfv 5228  1^st c1st 6153  2^nd c2nd 6154

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445

This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-1st 6155  df-2nd 6156

This theorem is referenced by: (None)