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

Theorem mapsnd 8926
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 5436 . . . . 5 {𝐵} ∈ V
32a1i 11 . . . 4 (𝜑 → {𝐵} ∈ V)
41, 3elmapd 8880 . . 3 (𝜑 → (𝑓 ∈ (𝐴m {𝐵}) ↔ 𝑓:{𝐵}⟶𝐴))
5 ffn 6736 . . . . . . . . 9 (𝑓:{𝐵}⟶𝐴𝑓 Fn {𝐵})
6 mapsnd.2 . . . . . . . . . 10 (𝜑𝐵𝑊)
7 snidg 4660 . . . . . . . . . 10 (𝐵𝑊𝐵 ∈ {𝐵})
86, 7syl 17 . . . . . . . . 9 (𝜑𝐵 ∈ {𝐵})
9 fneu 6678 . . . . . . . . 9 ((𝑓 Fn {𝐵} ∧ 𝐵 ∈ {𝐵}) → ∃!𝑦 𝐵𝑓𝑦)
105, 8, 9syl2anr 597 . . . . . . . 8 ((𝜑𝑓:{𝐵}⟶𝐴) → ∃!𝑦 𝐵𝑓𝑦)
11 euabsn 4726 . . . . . . . . . 10 (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦{𝑦𝐵𝑓𝑦} = {𝑦})
12 frel 6741 . . . . . . . . . . . . . 14 (𝑓:{𝐵}⟶𝐴 → Rel 𝑓)
13 relimasn 6103 . . . . . . . . . . . . . 14 (Rel 𝑓 → (𝑓 “ {𝐵}) = {𝑦𝐵𝑓𝑦})
1412, 13syl 17 . . . . . . . . . . . . 13 (𝑓:{𝐵}⟶𝐴 → (𝑓 “ {𝐵}) = {𝑦𝐵𝑓𝑦})
15 fdm 6745 . . . . . . . . . . . . . . 15 (𝑓:{𝐵}⟶𝐴 → dom 𝑓 = {𝐵})
1615imaeq2d 6078 . . . . . . . . . . . . . 14 (𝑓:{𝐵}⟶𝐴 → (𝑓 “ dom 𝑓) = (𝑓 “ {𝐵}))
17 imadmrn 6088 . . . . . . . . . . . . . 14 (𝑓 “ dom 𝑓) = ran 𝑓
1816, 17eqtr3di 2792 . . . . . . . . . . . . 13 (𝑓:{𝐵}⟶𝐴 → (𝑓 “ {𝐵}) = ran 𝑓)
1914, 18eqtr3d 2779 . . . . . . . . . . . 12 (𝑓:{𝐵}⟶𝐴 → {𝑦𝐵𝑓𝑦} = ran 𝑓)
2019eqeq1d 2739 . . . . . . . . . . 11 (𝑓:{𝐵}⟶𝐴 → ({𝑦𝐵𝑓𝑦} = {𝑦} ↔ ran 𝑓 = {𝑦}))
2120exbidv 1921 . . . . . . . . . 10 (𝑓:{𝐵}⟶𝐴 → (∃𝑦{𝑦𝐵𝑓𝑦} = {𝑦} ↔ ∃𝑦ran 𝑓 = {𝑦}))
2211, 21bitrid 283 . . . . . . . . 9 (𝑓:{𝐵}⟶𝐴 → (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦ran 𝑓 = {𝑦}))
2322adantl 481 . . . . . . . 8 ((𝜑𝑓:{𝐵}⟶𝐴) → (∃!𝑦 𝐵𝑓𝑦 ↔ ∃𝑦ran 𝑓 = {𝑦}))
2410, 23mpbid 232 . . . . . . 7 ((𝜑𝑓:{𝐵}⟶𝐴) → ∃𝑦ran 𝑓 = {𝑦})
25 frn 6743 . . . . . . . . . . . . 13 (𝑓:{𝐵}⟶𝐴 → ran 𝑓𝐴)
2625sseld 3982 . . . . . . . . . . . 12 (𝑓:{𝐵}⟶𝐴 → (𝑦 ∈ ran 𝑓𝑦𝐴))
27 vsnid 4663 . . . . . . . . . . . . 13 𝑦 ∈ {𝑦}
28 eleq2 2830 . . . . . . . . . . . . 13 (ran 𝑓 = {𝑦} → (𝑦 ∈ ran 𝑓𝑦 ∈ {𝑦}))
2927, 28mpbiri 258 . . . . . . . . . . . 12 (ran 𝑓 = {𝑦} → 𝑦 ∈ ran 𝑓)
3026, 29impel 505 . . . . . . . . . . 11 ((𝑓:{𝐵}⟶𝐴 ∧ ran 𝑓 = {𝑦}) → 𝑦𝐴)
3130adantll 714 . . . . . . . . . 10 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑦𝐴)
32 ffrn 6749 . . . . . . . . . . . . . 14 (𝑓:{𝐵}⟶𝐴𝑓:{𝐵}⟶ran 𝑓)
33 feq3 6718 . . . . . . . . . . . . . 14 (ran 𝑓 = {𝑦} → (𝑓:{𝐵}⟶ran 𝑓𝑓:{𝐵}⟶{𝑦}))
3432, 33syl5ibcom 245 . . . . . . . . . . . . 13 (𝑓:{𝐵}⟶𝐴 → (ran 𝑓 = {𝑦} → 𝑓:{𝐵}⟶{𝑦}))
3534imp 406 . . . . . . . . . . . 12 ((𝑓:{𝐵}⟶𝐴 ∧ ran 𝑓 = {𝑦}) → 𝑓:{𝐵}⟶{𝑦})
3635adantll 714 . . . . . . . . . . 11 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑓:{𝐵}⟶{𝑦})
376ad2antrr 726 . . . . . . . . . . . 12 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝐵𝑊)
38 vex 3484 . . . . . . . . . . . 12 𝑦 ∈ V
39 fsng 7157 . . . . . . . . . . . 12 ((𝐵𝑊𝑦 ∈ V) → (𝑓:{𝐵}⟶{𝑦} ↔ 𝑓 = {⟨𝐵, 𝑦⟩}))
4037, 38, 39sylancl 586 . . . . . . . . . . 11 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → (𝑓:{𝐵}⟶{𝑦} ↔ 𝑓 = {⟨𝐵, 𝑦⟩}))
4136, 40mpbid 232 . . . . . . . . . 10 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → 𝑓 = {⟨𝐵, 𝑦⟩})
4231, 41jca 511 . . . . . . . . 9 (((𝜑𝑓:{𝐵}⟶𝐴) ∧ ran 𝑓 = {𝑦}) → (𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}))
4342ex 412 . . . . . . . 8 ((𝜑𝑓:{𝐵}⟶𝐴) → (ran 𝑓 = {𝑦} → (𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩})))
4443eximdv 1917 . . . . . . 7 ((𝜑𝑓:{𝐵}⟶𝐴) → (∃𝑦ran 𝑓 = {𝑦} → ∃𝑦(𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩})))
4524, 44mpd 15 . . . . . 6 ((𝜑𝑓:{𝐵}⟶𝐴) → ∃𝑦(𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}))
46 df-rex 3071 . . . . . 6 (∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩} ↔ ∃𝑦(𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}))
4745, 46sylibr 234 . . . . 5 ((𝜑𝑓:{𝐵}⟶𝐴) → ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩})
4847ex 412 . . . 4 (𝜑 → (𝑓:{𝐵}⟶𝐴 → ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
49 f1osng 6889 . . . . . . . . . . 11 ((𝐵𝑊𝑦 ∈ V) → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
506, 38, 49sylancl 586 . . . . . . . . . 10 (𝜑 → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
5150adantr 480 . . . . . . . . 9 ((𝜑𝑓 = {⟨𝐵, 𝑦⟩}) → {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦})
52 f1oeq1 6836 . . . . . . . . . . 11 (𝑓 = {⟨𝐵, 𝑦⟩} → (𝑓:{𝐵}–1-1-onto→{𝑦} ↔ {⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦}))
5352bicomd 223 . . . . . . . . . 10 (𝑓 = {⟨𝐵, 𝑦⟩} → ({⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦} ↔ 𝑓:{𝐵}–1-1-onto→{𝑦}))
5453adantl 481 . . . . . . . . 9 ((𝜑𝑓 = {⟨𝐵, 𝑦⟩}) → ({⟨𝐵, 𝑦⟩}:{𝐵}–1-1-onto→{𝑦} ↔ 𝑓:{𝐵}–1-1-onto→{𝑦}))
5551, 54mpbid 232 . . . . . . . 8 ((𝜑𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}–1-1-onto→{𝑦})
56 f1of 6848 . . . . . . . 8 (𝑓:{𝐵}–1-1-onto→{𝑦} → 𝑓:{𝐵}⟶{𝑦})
5755, 56syl 17 . . . . . . 7 ((𝜑𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶{𝑦})
58573adant2 1132 . . . . . 6 ((𝜑𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶{𝑦})
59 snssi 4808 . . . . . . 7 (𝑦𝐴 → {𝑦} ⊆ 𝐴)
60593ad2ant2 1135 . . . . . 6 ((𝜑𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}) → {𝑦} ⊆ 𝐴)
6158, 60fssd 6753 . . . . 5 ((𝜑𝑦𝐴𝑓 = {⟨𝐵, 𝑦⟩}) → 𝑓:{𝐵}⟶𝐴)
6261rexlimdv3a 3159 . . . 4 (𝜑 → (∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩} → 𝑓:{𝐵}⟶𝐴))
6348, 62impbid 212 . . 3 (𝜑 → (𝑓:{𝐵}⟶𝐴 ↔ ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
644, 63bitrd 279 . 2 (𝜑 → (𝑓 ∈ (𝐴m {𝐵}) ↔ ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩}))
6564eqabdv 2875 1 (𝜑 → (𝐴m {𝐵}) = {𝑓 ∣ ∃𝑦𝐴 𝑓 = {⟨𝐵, 𝑦⟩}})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1540  wex 1779  wcel 2108  ∃!weu 2568  {cab 2714  wrex 3070  Vcvv 3480  wss 3951  {csn 4626  cop 4632   class class class wbr 5143  dom cdm 5685  ran crn 5686  cima 5688  Rel wrel 5690   Fn wfn 6556  wf 6557  1-1-ontowf1o 6560  (class class class)co 7431  m cmap 8866
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-map 8868
This theorem is referenced by:  mapsn  8928  mapsnend  9076  iunmapsn  45222
  Copyright terms: Public domain W3C validator