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

Theorem mapsncnv 8958
Description: Expression for the inverse of the canonical map between a set and its set of singleton functions. (Contributed by Stefan O'Rear, 21-Mar-2015.)
Hypotheses
Ref Expression
mapsncnv.s 𝑆 = {𝑋}
mapsncnv.b 𝐵 ∈ V
mapsncnv.x 𝑋 ∈ V
mapsncnv.f 𝐹 = (𝑥 ∈ (𝐵 ↑m 𝑆) ↦ (𝑥‘𝑋))
Assertion
Ref Expression
mapsncnv ◡𝐹 = (𝑦 ∈ 𝐵 ↦ (𝑆 × {𝑦}))
Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝑆,𝑦   𝑦,𝑋
Allowed substitution hints:   𝐹(𝑥, 𝑦)   𝑋(𝑥)

Proof of Theorem mapsncnv
StepHypRef Expression
1 elmapi 8906 . . . . . . . . 9 (𝑥 ∈ (𝐵 ↑m {𝑋}) → 𝑥:{𝑋}⟶𝐵)
2 mapsncnv.x . . . . . . . . . 10 𝑋 ∈ V
32snid 4623 . . . . . . . . 9 𝑋 ∈ {𝑋}
4 ffvelcdm 7112 . . . . . . . . 9 ((𝑥:{𝑋}⟶𝐵 ∧ 𝑋 ∈ {𝑋}) → (𝑥‘𝑋) ∈ 𝐵)
51, 3, 4sylancl 598 . . . . . . . 8 (𝑥 ∈ (𝐵 ↑m {𝑋}) → (𝑥‘𝑋) ∈ 𝐵)
6 eqid 2766 . . . . . . . . 9 {𝑋} = {𝑋}
7 mapsncnv.b . . . . . . . . 9 𝐵 ∈ V
86, 7, 2mapsnconst 8957 . . . . . . . 8 (𝑥 ∈ (𝐵 ↑m {𝑋}) → 𝑥 = ({𝑋} × {(𝑥‘𝑋)}))
95, 8jca 521 . . . . . . 7 (𝑥 ∈ (𝐵 ↑m {𝑋}) → ((𝑥‘𝑋) ∈ 𝐵 ∧ 𝑥 = ({𝑋} × {(𝑥‘𝑋)})))
10 eleq1 2855 . . . . . . . 8 (𝑦 = (𝑥‘𝑋) → (𝑦 ∈ 𝐵 ↔ (𝑥‘𝑋) ∈ 𝐵))
11 sneq 4593 . . . . . . . . . 10 (𝑦 = (𝑥‘𝑋) → {𝑦} = {(𝑥‘𝑋)})
1211xpeq2d 5687 . . . . . . . . 9 (𝑦 = (𝑥‘𝑋) → ({𝑋} × {𝑦}) = ({𝑋} × {(𝑥‘𝑋)}))
1312eqeq2d 2777 . . . . . . . 8 (𝑦 = (𝑥‘𝑋) → (𝑥 = ({𝑋} × {𝑦}) ↔ 𝑥 = ({𝑋} × {(𝑥‘𝑋)})))
1410, 13anbi12d 644 . . . . . . 7 (𝑦 = (𝑥‘𝑋) → ((𝑦 ∈ 𝐵 ∧ 𝑥 = ({𝑋} × {𝑦})) ↔ ((𝑥‘𝑋) ∈ 𝐵 ∧ 𝑥 = ({𝑋} × {(𝑥‘𝑋)}))))
159, 14syl5ibrcom 250 . . . . . 6 (𝑥 ∈ (𝐵 ↑m {𝑋}) → (𝑦 = (𝑥‘𝑋) → (𝑦 ∈ 𝐵 ∧ 𝑥 = ({𝑋} × {𝑦}))))
1615imp 412 . . . . 5 ((𝑥 ∈ (𝐵 ↑m {𝑋}) ∧ 𝑦 = (𝑥‘𝑋)) → (𝑦 ∈ 𝐵 ∧ 𝑥 = ({𝑋} × {𝑦})))
17 fconst6g 6800 . . . . . . . . 9 (𝑦 ∈ 𝐵 → ({𝑋} × {𝑦}):{𝑋}⟶𝐵)
18 snex 5403 . . . . . . . . . 10 {𝑋} ∈ V
197, 18elmap 8936 . . . . . . . . 9 (({𝑋} × {𝑦}) ∈ (𝐵 ↑m {𝑋}) ↔ ({𝑋} × {𝑦}):{𝑋}⟶𝐵)
2017, 19sylibr 237 . . . . . . . 8 (𝑦 ∈ 𝐵 → ({𝑋} × {𝑦}) ∈ (𝐵 ↑m {𝑋}))
21 vex 3457 . . . . . . . . . . 11 𝑦 ∈ V
2221fvconst2 7240 . . . . . . . . . 10 (𝑋 ∈ {𝑋} → (({𝑋} × {𝑦})‘𝑋) = 𝑦)
233, 22mp1i 14 . . . . . . . . 9 (𝑦 ∈ 𝐵 → (({𝑋} × {𝑦})‘𝑋) = 𝑦)
2423eqcomd 2772 . . . . . . . 8 (𝑦 ∈ 𝐵 → 𝑦 = (({𝑋} × {𝑦})‘𝑋))
2520, 24jca 521 . . . . . . 7 (𝑦 ∈ 𝐵 → (({𝑋} × {𝑦}) ∈ (𝐵 ↑m {𝑋}) ∧ 𝑦 = (({𝑋} × {𝑦})‘𝑋)))
26 eleq1 2855 . . . . . . . 8 (𝑥 = ({𝑋} × {𝑦}) → (𝑥 ∈ (𝐵 ↑m {𝑋}) ↔ ({𝑋} × {𝑦}) ∈ (𝐵 ↑m {𝑋})))
27 fveq1 6914 . . . . . . . . 9 (𝑥 = ({𝑋} × {𝑦}) → (𝑥‘𝑋) = (({𝑋} × {𝑦})‘𝑋))
2827eqeq2d 2777 . . . . . . . 8 (𝑥 = ({𝑋} × {𝑦}) → (𝑦 = (𝑥‘𝑋) ↔ 𝑦 = (({𝑋} × {𝑦})‘𝑋)))
2926, 28anbi12d 644 . . . . . . 7 (𝑥 = ({𝑋} × {𝑦}) → ((𝑥 ∈ (𝐵 ↑m {𝑋}) ∧ 𝑦 = (𝑥‘𝑋)) ↔ (({𝑋} × {𝑦}) ∈ (𝐵 ↑m {𝑋}) ∧ 𝑦 = (({𝑋} × {𝑦})‘𝑋))))
3025, 29syl5ibrcom 250 . . . . . 6 (𝑦 ∈ 𝐵 → (𝑥 = ({𝑋} × {𝑦}) → (𝑥 ∈ (𝐵 ↑m {𝑋}) ∧ 𝑦 = (𝑥‘𝑋))))
3130imp 412 . . . . 5 ((𝑦 ∈ 𝐵 ∧ 𝑥 = ({𝑋} × {𝑦})) → (𝑥 ∈ (𝐵 ↑m {𝑋}) ∧ 𝑦 = (𝑥‘𝑋)))
3216, 31impbii 212 . . . 4 ((𝑥 ∈ (𝐵 ↑m {𝑋}) ∧ 𝑦 = (𝑥‘𝑋)) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = ({𝑋} × {𝑦})))
33 mapsncnv.s . . . . . . 7 𝑆 = {𝑋}
3433oveq2i 7461 . . . . . 6 (𝐵 ↑m 𝑆) = (𝐵 ↑m {𝑋})
3534eleq2i 2859 . . . . 5 (𝑥 ∈ (𝐵 ↑m 𝑆) ↔ 𝑥 ∈ (𝐵 ↑m {𝑋}))
3635anbi1i 636 . . . 4 ((𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋)) ↔ (𝑥 ∈ (𝐵 ↑m {𝑋}) ∧ 𝑦 = (𝑥‘𝑋)))
3733xpeq1i 5683 . . . . . 6 (𝑆 × {𝑦}) = ({𝑋} × {𝑦})
3837eqeq2i 2779 . . . . 5 (𝑥 = (𝑆 × {𝑦}) ↔ 𝑥 = ({𝑋} × {𝑦}))
3938anbi2i 635 . . . 4 ((𝑦 ∈ 𝐵 ∧ 𝑥 = (𝑆 × {𝑦})) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = ({𝑋} × {𝑦})))
4032, 36, 393bitr4i 306 . . 3 ((𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋)) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = (𝑆 × {𝑦})))
4140opabbii 5177 . 2 {⟨𝑦, 𝑥⟩ ∣ (𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋))} = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝐵 ∧ 𝑥 = (𝑆 × {𝑦}))}
42 mapsncnv.f . . . . 5 𝐹 = (𝑥 ∈ (𝐵 ↑m 𝑆) ↦ (𝑥‘𝑋))
43 df-mpt 5192 . . . . 5 (𝑥 ∈ (𝐵 ↑m 𝑆) ↦ (𝑥‘𝑋)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋))}
4442, 43eqtri 2789 . . . 4 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋))}
4544cnveqi 5863 . . 3 ◡𝐹 = ◡{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋))}
46 cnvopab 6148 . . 3 ◡{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋))} = {⟨𝑦, 𝑥⟩ ∣ (𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋))}
4745, 46eqtri 2789 . 2 ◡𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑥 ∈ (𝐵 ↑m 𝑆) ∧ 𝑦 = (𝑥‘𝑋))}
48 df-mpt 5192 . 2 (𝑦 ∈ 𝐵 ↦ (𝑆 × {𝑦})) = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝐵 ∧ 𝑥 = (𝑆 × {𝑦}))}
4941, 47, 483eqtr4i 2799 1 ◡𝐹 = (𝑦 ∈ 𝐵 ↦ (𝑆 × {𝑦}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1572   ∈ wcel 2150  Vcvv 3453  {csn 4587  {copab 5172   ↦ cmpt 5191   × cxp 5655  ◡ccnv 5656  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450   ↑m cmap 8884
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-map 8886
This theorem is used by:  mapsnf1o2  8959  mapsnf1o3  8960  coe1sfi  22588  evl1var  22711  pf1mpf  22727  pf1ind  22730  deg1val  26471
  Copyright terms: Public domain W3C validator