Theorem mapsnd 8882

Description: The value of set exponentiation with a singleton exponent. Theorem 98 of [Suppes] p. 89. (Contributed by NM, 10-Dec-2003.) (Revised by Glauco Siliprandi, 24-Dec-2020.)

Hypotheses

Ref	Expression
mapsnd.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
mapsnd.2	⊢ (𝜑 → 𝐵 ∈ 𝑊)

Assertion

Ref	Expression
mapsnd	⊢ (𝜑 → (𝐴 ↑m {𝐵}) = {𝑓 ∣ ∃𝑦 ∈ 𝐴 𝑓 = {⟨𝐵, 𝑦⟩}})

Distinct variable groups:   𝐴,𝑓,𝑦   𝐵,𝑓,𝑦   𝜑,𝑓,𝑦

Allowed substitution hints:   𝑉(𝑦,𝑓)   𝑊(𝑦,𝑓)

Proof of Theorem mapsnd

Step	Hyp	Ref	Expression
1		mapsnd.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		snex 5431	. . . . 5 ⊢ {𝐵} ∈ V
3	2	a1i 11	. . . 4 ⊢ (𝜑 → {𝐵} ∈ V)
4	1, 3	elmapd 8836	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝐴 ↑m {𝐵}) ↔ 𝑓:{𝐵}⟶𝐴))
5		ffn 6717	. . . . . . . . 9 ⊢ (𝑓:{𝐵}⟶𝐴 → 𝑓 Fn {𝐵})
6		mapsnd.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
7		snidg 4662	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ {𝐵})
8	6, 7	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ {𝐵})
9		fneu 6659	. . . . . . . . 9 ⊢ ((𝑓 Fn {𝐵} ∧ 𝐵 ∈ {𝐵}) → ∃!𝑦 𝐵𝑓𝑦)
10	5, 8, 9	syl2anr 597	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) → ∃!𝑦 𝐵𝑓𝑦)
11		euabsn 4730	. . . . . . . . . 10 ⊢ (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦{𝑦 ∣ 𝐵𝑓𝑦} = {𝑦})
12		frel 6722	. . . . . . . . . . . . . 14 ⊢ (𝑓:{𝐵}⟶𝐴 → Rel 𝑓)
13		relimasn 6083	. . . . . . . . . . . . . 14 ⊢ (Rel 𝑓 → (𝑓 “ {𝐵}) = {𝑦 ∣ 𝐵𝑓𝑦})
14	12, 13	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑓:{𝐵}⟶𝐴 → (𝑓 “ {𝐵}) = {𝑦 ∣ 𝐵𝑓𝑦})
15		fdm 6726	. . . . . . . . . . . . . . 15 ⊢ (𝑓:{𝐵}⟶𝐴 → dom 𝑓 = {𝐵})
16	15	imaeq2d 6059	. . . . . . . . . . . . . 14 ⊢ (𝑓:{𝐵}⟶𝐴 → (𝑓 “ dom 𝑓) = (𝑓 “ {𝐵}))
17		imadmrn 6069	. . . . . . . . . . . . . 14 ⊢ (𝑓 “ dom 𝑓) = ran 𝑓
18	16, 17	eqtr3di 2787	. . . . . . . . . . . . 13 ⊢ (𝑓:{𝐵}⟶𝐴 → (𝑓 “ {𝐵}) = ran 𝑓)
19	14, 18	eqtr3d 2774	. . . . . . . . . . . 12 ⊢ (𝑓:{𝐵}⟶𝐴 → {𝑦 ∣ 𝐵𝑓𝑦} = ran 𝑓)
20	19	eqeq1d 2734	. . . . . . . . . . 11 ⊢ (𝑓:{𝐵}⟶𝐴 → ({𝑦 ∣ 𝐵𝑓𝑦} = {𝑦} ↔ ran 𝑓 = {𝑦}))
21	20	exbidv 1924	. . . . . . . . . 10 ⊢ (𝑓:{𝐵}⟶𝐴 → (∃𝑦{𝑦 ∣ 𝐵𝑓𝑦} = {𝑦} ↔ ∃𝑦ran 𝑓 = {𝑦}))
22	11, 21	bitrid 282	. . . . . . . . 9 ⊢ (𝑓:{𝐵}⟶𝐴 → (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦ran 𝑓 = {𝑦}))
23	22	adantl 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) → (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦ran 𝑓 = {𝑦}))
24	10, 23	mpbid 231	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) → ∃𝑦ran 𝑓 = {𝑦})
25		frn 6724	. . . . . . . . . . . . 13 ⊢ (𝑓:{𝐵}⟶𝐴 → ran 𝑓 ⊆ 𝐴)
26	25	sseld 3981	. . . . . . . . . . . 12 ⊢ (𝑓:{𝐵}⟶𝐴 → (𝑦 ∈ ran 𝑓 → 𝑦 ∈ 𝐴))
27		vsnid 4665	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ {𝑦}
28		eleq2 2822	. . . . . . . . . . . . 13 ⊢ (ran 𝑓 = {𝑦} → (𝑦 ∈ ran 𝑓 ↔ 𝑦 ∈ {𝑦}))
29	27, 28	mpbiri 257	. . . . . . . . . . . 12 ⊢ (ran 𝑓 = {𝑦} → 𝑦 ∈ ran 𝑓)
30	26, 29	impel 506	. . . . . . . . . . 11 ⊢ ((𝑓:{𝐵}⟶𝐴 ∧ ran 𝑓 = {𝑦}) → 𝑦 ∈ 𝐴)
31	30	adantll 712	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑦 ∈ 𝐴)
32		ffrn 6731	. . . . . . . . . . . . . 14 ⊢ (𝑓:{𝐵}⟶𝐴 → 𝑓:{𝐵}⟶ran 𝑓)
33		feq3 6700	. . . . . . . . . . . . . 14 ⊢ (ran 𝑓 = {𝑦} → (𝑓:{𝐵}⟶ran 𝑓 ↔ 𝑓:{𝐵}⟶{𝑦}))
34	32, 33	syl5ibcom 244	. . . . . . . . . . . . 13 ⊢ (𝑓:{𝐵}⟶𝐴 → (ran 𝑓 = {𝑦} → 𝑓:{𝐵}⟶{𝑦}))
35	34	imp 407	. . . . . . . . . . . 12 ⊢ ((𝑓:{𝐵}⟶𝐴 ∧ ran 𝑓 = {𝑦}) → 𝑓:{𝐵}⟶{𝑦})
36	35	adantll 712	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑓:{𝐵}⟶{𝑦})
37	6	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝐵 ∈ 𝑊)
38		vex 3478	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
39		fsng 7137	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝑦 ∈ V) → (𝑓:{𝐵}⟶{𝑦} ↔ 𝑓 = {⟨𝐵, 𝑦⟩}))
40	37, 38, 39	sylancl 586	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → (𝑓:{𝐵}⟶{𝑦} ↔ 𝑓 = {⟨𝐵, 𝑦⟩}))
41	36, 40	mpbid 231	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑓 = {⟨𝐵, 𝑦⟩})
42	31, 41	jca 512	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → (𝑦 ∈ 𝐴 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}))
43	42	ex 413	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) → (ran 𝑓 = {𝑦} → (𝑦 ∈ 𝐴 ∧ 𝑓 = {⟨𝐵, 𝑦⟩})))
44	43	eximdv 1920	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) → (∃𝑦ran 𝑓 = {𝑦} → ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑓 = {⟨𝐵, 𝑦⟩})))
45	24, 44	mpd 15	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) → ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}))
46		df-rex 3071	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐴 𝑓 = {⟨𝐵, 𝑦⟩} ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}))
47	45, 46	sylibr 233	. . . . 5 ⊢ ((𝜑 ∧ 𝑓:{𝐵}⟶𝐴) → ∃𝑦 ∈ 𝐴 𝑓 = {⟨𝐵, 𝑦⟩})
48	47	ex 413	. . . 4 ⊢ (𝜑 → (𝑓:{𝐵}⟶𝐴 → ∃𝑦 ∈ 𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
49		f1osng 6874	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝑦 ∈ V) → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
50	6, 38, 49	sylancl 586	. . . . . . . . . 10 ⊢ (𝜑 → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
51	50	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}) → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
52		f1oeq1 6821	. . . . . . . . . . 11 ⊢ (𝑓 = {⟨𝐵, 𝑦⟩} → (𝑓:{𝐵}–1-1-onto→{𝑦} ↔ {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦}))
53	52	bicomd 222	. . . . . . . . . 10 ⊢ (𝑓 = {⟨𝐵, 𝑦⟩} → ({⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦} ↔ 𝑓:{𝐵}–1-1-onto→{𝑦}))
54	53	adantl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}) → ({⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦} ↔ 𝑓:{𝐵}–1-1-onto→{𝑦}))
55	51, 54	mpbid 231	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}–1-1-onto→{𝑦})
56		f1of 6833	. . . . . . . 8 ⊢ (𝑓:{𝐵}–1-1-onto→{𝑦} → 𝑓:{𝐵}⟶{𝑦})
57	55, 56	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶{𝑦})
58	57	3adant2 1131	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶{𝑦})
59		snssi 4811	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → {𝑦} ⊆ 𝐴)
60	59	3ad2ant2 1134	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}) → {𝑦} ⊆ 𝐴)
61	58, 60	fssd 6735	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ 𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶𝐴)
62	61	rexlimdv3a 3159	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ 𝐴 𝑓 = {⟨𝐵, 𝑦⟩} → 𝑓:{𝐵}⟶𝐴))
63	48, 62	impbid 211	. . 3 ⊢ (𝜑 → (𝑓:{𝐵}⟶𝐴 ↔ ∃𝑦 ∈ 𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
64	4, 63	bitrd 278	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝐴 ↑m {𝐵}) ↔ ∃𝑦 ∈ 𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
65	64	eqabdv 2867	1 ⊢ (𝜑 → (𝐴 ↑m {𝐵}) = {𝑓 ∣ ∃𝑦 ∈ 𝐴 𝑓 = {⟨𝐵, 𝑦⟩}})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∃!weu 2562  {cab 2709  ∃wrex 3070  Vcvv 3474   ⊆ wss 3948  {csn 4628  ⟨cop 4634   class class class wbr 5148  dom cdm 5676  ran crn 5677   “ cima 5679  Rel wrel 5681   Fn wfn 6538  ⟶wf 6539  –1-1-onto→wf1o 6542  (class class class)co 7411   ↑_m cmap 8822

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7414  df-oprab 7415  df-mpo 7416  df-map 8824

This theorem is referenced by:  mapsn  8884  mapsnend  9038  iunmapsn  44215