ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mapsnen GIF version

Theorem mapsnen 6768
Description: Set exponentiation to a singleton exponent is equinumerous to its base. Exercise 4.43 of [Mendelson] p. 255. (Contributed by NM, 17-Dec-2003.) (Revised by Mario Carneiro, 15-Nov-2014.)
Hypotheses
Ref Expression
mapsnen.1 𝐴 ∈ V
mapsnen.2 𝐵 ∈ V
Assertion
Ref Expression
mapsnen (𝐴𝑚 {𝐵}) ≈ 𝐴

Proof of Theorem mapsnen
Dummy variables 𝑦 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fnmap 6612 . . 3 𝑚 Fn (V × V)
2 mapsnen.1 . . 3 𝐴 ∈ V
3 mapsnen.2 . . . 4 𝐵 ∈ V
43snex 4158 . . 3 {𝐵} ∈ V
5 fnovex 5866 . . 3 (( ↑𝑚 Fn (V × V) ∧ 𝐴 ∈ V ∧ {𝐵} ∈ V) → (𝐴𝑚 {𝐵}) ∈ V)
61, 2, 4, 5mp3an 1326 . 2 (𝐴𝑚 {𝐵}) ∈ V
7 vex 2724 . . . 4 𝑧 ∈ V
87, 3fvex 5500 . . 3 (𝑧𝐵) ∈ V
98a1i 9 . 2 (𝑧 ∈ (𝐴𝑚 {𝐵}) → (𝑧𝐵) ∈ V)
10 vex 2724 . . . . 5 𝑤 ∈ V
113, 10opex 4201 . . . 4 𝐵, 𝑤⟩ ∈ V
1211snex 4158 . . 3 {⟨𝐵, 𝑤⟩} ∈ V
1312a1i 9 . 2 (𝑤𝐴 → {⟨𝐵, 𝑤⟩} ∈ V)
142, 3mapsn 6647 . . . . . 6 (𝐴𝑚 {𝐵}) = {𝑧 ∣ ∃𝑦𝐴 𝑧 = {⟨𝐵, 𝑦⟩}}
1514abeq2i 2275 . . . . 5 (𝑧 ∈ (𝐴𝑚 {𝐵}) ↔ ∃𝑦𝐴 𝑧 = {⟨𝐵, 𝑦⟩})
1615anbi1i 454 . . . 4 ((𝑧 ∈ (𝐴𝑚 {𝐵}) ∧ 𝑤 = (𝑧𝐵)) ↔ (∃𝑦𝐴 𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵)))
17 r19.41v 2620 . . . 4 (∃𝑦𝐴 (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵)) ↔ (∃𝑦𝐴 𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵)))
18 df-rex 2448 . . . 4 (∃𝑦𝐴 (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵)) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵))))
1916, 17, 183bitr2i 207 . . 3 ((𝑧 ∈ (𝐴𝑚 {𝐵}) ∧ 𝑤 = (𝑧𝐵)) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵))))
20 fveq1 5479 . . . . . . . . . 10 (𝑧 = {⟨𝐵, 𝑦⟩} → (𝑧𝐵) = ({⟨𝐵, 𝑦⟩}‘𝐵))
21 vex 2724 . . . . . . . . . . 11 𝑦 ∈ V
223, 21fvsn 5674 . . . . . . . . . 10 ({⟨𝐵, 𝑦⟩}‘𝐵) = 𝑦
2320, 22eqtrdi 2213 . . . . . . . . 9 (𝑧 = {⟨𝐵, 𝑦⟩} → (𝑧𝐵) = 𝑦)
2423eqeq2d 2176 . . . . . . . 8 (𝑧 = {⟨𝐵, 𝑦⟩} → (𝑤 = (𝑧𝐵) ↔ 𝑤 = 𝑦))
25 equcom 1693 . . . . . . . 8 (𝑤 = 𝑦𝑦 = 𝑤)
2624, 25bitrdi 195 . . . . . . 7 (𝑧 = {⟨𝐵, 𝑦⟩} → (𝑤 = (𝑧𝐵) ↔ 𝑦 = 𝑤))
2726pm5.32i 450 . . . . . 6 ((𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵)) ↔ (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑦 = 𝑤))
2827anbi2i 453 . . . . 5 ((𝑦𝐴 ∧ (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵))) ↔ (𝑦𝐴 ∧ (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑦 = 𝑤)))
29 anass 399 . . . . 5 (((𝑦𝐴𝑧 = {⟨𝐵, 𝑦⟩}) ∧ 𝑦 = 𝑤) ↔ (𝑦𝐴 ∧ (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑦 = 𝑤)))
30 ancom 264 . . . . 5 (((𝑦𝐴𝑧 = {⟨𝐵, 𝑦⟩}) ∧ 𝑦 = 𝑤) ↔ (𝑦 = 𝑤 ∧ (𝑦𝐴𝑧 = {⟨𝐵, 𝑦⟩})))
3128, 29, 303bitr2i 207 . . . 4 ((𝑦𝐴 ∧ (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵))) ↔ (𝑦 = 𝑤 ∧ (𝑦𝐴𝑧 = {⟨𝐵, 𝑦⟩})))
3231exbii 1592 . . 3 (∃𝑦(𝑦𝐴 ∧ (𝑧 = {⟨𝐵, 𝑦⟩} ∧ 𝑤 = (𝑧𝐵))) ↔ ∃𝑦(𝑦 = 𝑤 ∧ (𝑦𝐴𝑧 = {⟨𝐵, 𝑦⟩})))
33 eleq1w 2225 . . . . 5 (𝑦 = 𝑤 → (𝑦𝐴𝑤𝐴))
34 opeq2 3753 . . . . . . 7 (𝑦 = 𝑤 → ⟨𝐵, 𝑦⟩ = ⟨𝐵, 𝑤⟩)
3534sneqd 3583 . . . . . 6 (𝑦 = 𝑤 → {⟨𝐵, 𝑦⟩} = {⟨𝐵, 𝑤⟩})
3635eqeq2d 2176 . . . . 5 (𝑦 = 𝑤 → (𝑧 = {⟨𝐵, 𝑦⟩} ↔ 𝑧 = {⟨𝐵, 𝑤⟩}))
3733, 36anbi12d 465 . . . 4 (𝑦 = 𝑤 → ((𝑦𝐴𝑧 = {⟨𝐵, 𝑦⟩}) ↔ (𝑤𝐴𝑧 = {⟨𝐵, 𝑤⟩})))
3810, 37ceqsexv 2760 . . 3 (∃𝑦(𝑦 = 𝑤 ∧ (𝑦𝐴𝑧 = {⟨𝐵, 𝑦⟩})) ↔ (𝑤𝐴𝑧 = {⟨𝐵, 𝑤⟩}))
3919, 32, 383bitri 205 . 2 ((𝑧 ∈ (𝐴𝑚 {𝐵}) ∧ 𝑤 = (𝑧𝐵)) ↔ (𝑤𝐴𝑧 = {⟨𝐵, 𝑤⟩}))
406, 2, 9, 13, 39en2i 6727 1 (𝐴𝑚 {𝐵}) ≈ 𝐴
Colors of variables: wff set class
Syntax hints:  wa 103   = wceq 1342  wex 1479  wcel 2135  wrex 2443  Vcvv 2721  {csn 3570  cop 3573   class class class wbr 3976   × cxp 4596   Fn wfn 5177  cfv 5182  (class class class)co 5836  𝑚 cmap 6605  cen 6695
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181  ax-un 4405  ax-setind 4508
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-ral 2447  df-rex 2448  df-reu 2449  df-rab 2451  df-v 2723  df-sbc 2947  df-csb 3041  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-iun 3862  df-br 3977  df-opab 4038  df-mpt 4039  df-id 4265  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-res 4610  df-ima 4611  df-iota 5147  df-fun 5184  df-fn 5185  df-f 5186  df-f1 5187  df-fo 5188  df-f1o 5189  df-fv 5190  df-ov 5839  df-oprab 5840  df-mpo 5841  df-1st 6100  df-2nd 6101  df-map 6607  df-en 6698
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator