MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mapsnd Structured version   Visualization version   GIF version

Theorem mapsnd 8863
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
StepHypRef Expression
1 mapsnd.1 . . . 4 (𝜑𝐴𝑉)
2 snex 5424 . . . . 5 {𝐵} ∈ V
32a1i 11 . . . 4 (𝜑 → {𝐵} ∈ V)
41, 3elmapd 8817 . . 3 (𝜑 → (𝑓 ∈ (𝐴m {𝐵}) ↔ 𝑓:{𝐵}⟶𝐴))
5 ffn 6704 . . . . . . . . 9 (𝑓:{𝐵}⟶𝐴𝑓 Fn {𝐵})
6 mapsnd.2 . . . . . . . . . 10 (𝜑𝐵𝑊)
7 snidg 4656 . . . . . . . . . 10 (𝐵𝑊𝐵 ∈ {𝐵})
86, 7syl 17 . . . . . . . . 9 (𝜑𝐵 ∈ {𝐵})
9 fneu 6648 . . . . . . . . 9 ((𝑓 Fn {𝐵} ∧ 𝐵 ∈ {𝐵}) → ∃!𝑦 𝐵𝑓𝑦)
105, 8, 9syl2anr 597 . . . . . . . 8 ((𝜑𝑓:{𝐵}⟶𝐴) → ∃!𝑦 𝐵𝑓𝑦)
11 euabsn 4723 . . . . . . . . . 10 (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦{𝑦𝐵𝑓𝑦} = {𝑦})
12 frel 6709 . . . . . . . . . . . . . 14 (𝑓:{𝐵}⟶𝐴 → Rel 𝑓)
13 relimasn 6072 . . . . . . . . . . . . . 14 (Rel 𝑓 → (𝑓 “ {𝐵}) = {𝑦𝐵𝑓𝑦})
1412, 13syl 17 . . . . . . . . . . . . 13 (𝑓:{𝐵}⟶𝐴 → (𝑓 “ {𝐵}) = {𝑦𝐵𝑓𝑦})
15 fdm 6713 . . . . . . . . . . . . . . 15 (𝑓:{𝐵}⟶𝐴 → dom 𝑓 = {𝐵})
1615imaeq2d 6049 . . . . . . . . . . . . . 14 (𝑓:{𝐵}⟶𝐴 → (𝑓 “ dom 𝑓) = (𝑓 “ {𝐵}))
17 imadmrn 6059 . . . . . . . . . . . . . 14 (𝑓 “ dom 𝑓) = ran 𝑓
1816, 17eqtr3di 2786 . . . . . . . . . . . . 13 (𝑓:{𝐵}⟶𝐴 → (𝑓 “ {𝐵}) = ran 𝑓)
1914, 18eqtr3d 2773 . . . . . . . . . . . 12 (𝑓:{𝐵}⟶𝐴 → {𝑦𝐵𝑓𝑦} = ran 𝑓)
2019eqeq1d 2733 . . . . . . . . . . 11 (𝑓:{𝐵}⟶𝐴 → ({𝑦𝐵𝑓𝑦} = {𝑦} ↔ ran 𝑓 = {𝑦}))
2120exbidv 1924 . . . . . . . . . 10 (𝑓:{𝐵}⟶𝐴 → (∃𝑦{𝑦𝐵𝑓𝑦} = {𝑦} ↔ ∃𝑦ran 𝑓 = {𝑦}))
2211, 21bitrid 282 . . . . . . . . 9 (𝑓:{𝐵}⟶𝐴 → (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦ran 𝑓 = {𝑦}))
2322adantl 482 . . . . . . . 8 ((𝜑𝑓:{𝐵}⟶𝐴) → (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦ran 𝑓 = {𝑦}))
2410, 23mpbid 231 . . . . . . 7 ((𝜑𝑓:{𝐵}⟶𝐴) → ∃𝑦ran 𝑓 = {𝑦})
25 frn 6711 . . . . . . . . . . . . 13 (𝑓:{𝐵}⟶𝐴 → ran 𝑓𝐴)
2625sseld 3977 . . . . . . . . . . . 12 (𝑓:{𝐵}⟶𝐴 → (𝑦 ∈ ran 𝑓𝑦𝐴))
27 vsnid 4659 . . . . . . . . . . . . 13 𝑦 ∈ {𝑦}
28 eleq2 2821 . . . . . . . . . . . . 13 (ran 𝑓 = {𝑦} → (𝑦 ∈ ran 𝑓𝑦 ∈ {𝑦}))
2927, 28mpbiri 257 . . . . . . . . . . . 12 (ran 𝑓 = {𝑦} → 𝑦 ∈ ran 𝑓)
3026, 29impel 506 . . . . . . . . . . 11 ((𝑓:{𝐵}⟶𝐴 ∧ ran 𝑓 = {𝑦}) → 𝑦𝐴)
3130adantll 712 . . . . . . . . . 10 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑦𝐴)
32 ffrn 6718 . . . . . . . . . . . . . 14 (𝑓:{𝐵}⟶𝐴𝑓:{𝐵}⟶ran 𝑓)
33 feq3 6687 . . . . . . . . . . . . . 14 (ran 𝑓 = {𝑦} → (𝑓:{𝐵}⟶ran 𝑓𝑓:{𝐵}⟶{𝑦}))
3432, 33syl5ibcom 244 . . . . . . . . . . . . 13 (𝑓:{𝐵}⟶𝐴 → (ran 𝑓 = {𝑦} → 𝑓:{𝐵}⟶{𝑦}))
3534imp 407 . . . . . . . . . . . 12 ((𝑓:{𝐵}⟶𝐴 ∧ ran 𝑓 = {𝑦}) → 𝑓:{𝐵}⟶{𝑦})
3635adantll 712 . . . . . . . . . . 11 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑓:{𝐵}⟶{𝑦})
376ad2antrr 724 . . . . . . . . . . . 12 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝐵𝑊)
38 vex 3477 . . . . . . . . . . . 12 𝑦 ∈ V
39 fsng 7119 . . . . . . . . . . . 12 ((𝐵𝑊𝑦 ∈ V) → (𝑓:{𝐵}⟶{𝑦} ↔ 𝑓 = {⟨𝐵, 𝑦⟩}))
4037, 38, 39sylancl 586 . . . . . . . . . . 11 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → (𝑓:{𝐵}⟶{𝑦} ↔ 𝑓 = {⟨𝐵, 𝑦⟩}))
4136, 40mpbid 231 . . . . . . . . . 10 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑓 = {⟨𝐵, 𝑦⟩})
4231, 41jca 512 . . . . . . . . 9 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → (𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}))
4342ex 413 . . . . . . . 8 ((𝜑𝑓:{𝐵}⟶𝐴) → (ran 𝑓 = {𝑦} → (𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩})))
4443eximdv 1920 . . . . . . 7 ((𝜑𝑓:{𝐵}⟶𝐴) → (∃𝑦ran 𝑓 = {𝑦} → ∃𝑦(𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩})))
4524, 44mpd 15 . . . . . 6 ((𝜑𝑓:{𝐵}⟶𝐴) → ∃𝑦(𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}))
46 df-rex 3070 . . . . . 6 (∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩} ↔ ∃𝑦(𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}))
4745, 46sylibr 233 . . . . 5 ((𝜑𝑓:{𝐵}⟶𝐴) → ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩})
4847ex 413 . . . 4 (𝜑 → (𝑓:{𝐵}⟶𝐴 → ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
49 f1osng 6861 . . . . . . . . . . 11 ((𝐵𝑊𝑦 ∈ V) → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
506, 38, 49sylancl 586 . . . . . . . . . 10 (𝜑 → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
5150adantr 481 . . . . . . . . 9 ((𝜑𝑓 = {⟨𝐵, 𝑦⟩}) → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
52 f1oeq1 6808 . . . . . . . . . . 11 (𝑓 = {⟨𝐵, 𝑦⟩} → (𝑓:{𝐵}–1-1-onto→{𝑦} ↔ {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦}))
5352bicomd 222 . . . . . . . . . 10 (𝑓 = {⟨𝐵, 𝑦⟩} → ({⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦} ↔ 𝑓:{𝐵}–1-1-onto→{𝑦}))
5453adantl 482 . . . . . . . . 9 ((𝜑𝑓 = {⟨𝐵, 𝑦⟩}) → ({⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦} ↔ 𝑓:{𝐵}–1-1-onto→{𝑦}))
5551, 54mpbid 231 . . . . . . . 8 ((𝜑𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}–1-1-onto→{𝑦})
56 f1of 6820 . . . . . . . 8 (𝑓:{𝐵}–1-1-onto→{𝑦} → 𝑓:{𝐵}⟶{𝑦})
5755, 56syl 17 . . . . . . 7 ((𝜑𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶{𝑦})
58573adant2 1131 . . . . . 6 ((𝜑𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶{𝑦})
59 snssi 4804 . . . . . . 7 (𝑦𝐴 → {𝑦} ⊆ 𝐴)
60593ad2ant2 1134 . . . . . 6 ((𝜑𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}) → {𝑦} ⊆ 𝐴)
6158, 60fssd 6722 . . . . 5 ((𝜑𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶𝐴)
6261rexlimdv3a 3158 . . . 4 (𝜑 → (∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩} → 𝑓:{𝐵}⟶𝐴))
6348, 62impbid 211 . . 3 (𝜑 → (𝑓:{𝐵}⟶𝐴 ↔ ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
644, 63bitrd 278 . 2 (𝜑 → (𝑓 ∈ (𝐴m {𝐵}) ↔ ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
6564eqabdv 2866 1 (𝜑 → (𝐴m {𝐵}) = {𝑓 ∣ ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩}})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wex 1781  wcel 2106  ∃!weu 2561  {cab 2708  wrex 3069  Vcvv 3473  wss 3944  {csn 4622  cop 4628   class class class wbr 5141  dom cdm 5669  ran crn 5670  cima 5672  Rel wrel 5674   Fn wfn 6527  wf 6528  1-1-ontowf1o 6531  (class class class)co 7393  m cmap 8803
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 2702  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7708
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 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3774  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4523  df-pw 4598  df-sn 4623  df-pr 4625  df-op 4629  df-uni 4902  df-br 5142  df-opab 5204  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6484  df-fun 6534  df-fn 6535  df-f 6536  df-f1 6537  df-fo 6538  df-f1o 6539  df-fv 6540  df-ov 7396  df-oprab 7397  df-mpo 7398  df-map 8805
This theorem is referenced by:  mapsn  8865  mapsnend  9019  iunmapsn  43687
  Copyright terms: Public domain W3C validator