        {"id":2395,"date":"2024-04-17T12:17:04","date_gmt":"2024-04-17T10:17:04","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/?p=2395"},"modified":"2024-04-18T12:20:02","modified_gmt":"2024-04-18T10:20:02","slug":"17-abr-24","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/17-abr-24\/","title":{"rendered":"f[s] \u2229 t = f[s \u2229 f\u207b\u00b9[t]]"},"content":{"rendered":"\n<p>Demostrar con Lean4 que<br \/>\n&#92;[ f[s] \u2229 t = f[s \u2229 f\u207b\u00b9[t]] &#92;]<\/p>\n<p>Para ello, completar la siguiente teor\u00eda de Lean4:<\/p>\n<pre lang=\"lean\">\nimport Mathlib.Data.Set.Function\nimport Mathlib.Tactic\n\nopen Set\n\nvariable {\u03b1 \u03b2 : Type _}\nvariable (f : \u03b1 \u2192 \u03b2)\nvariable (s : Set \u03b1)\nvariable (t : Set \u03b2)\n\nexample : (f '' s) \u2229 t = f '' (s \u2229 f \u207b\u00b9' t) :=\nby sorry\n<\/pre>\n<p><!--more--><\/p>\n<h2>1. Demostraci\u00f3n en lenguaje natural<\/h2>\n<p>Tenemos que demostrar que, para toda &#92;(y&#92;),<br \/>\n&#92;[ y \u2208 f[s] \u2229 t \u2194 y \u2208 f[s \u2229 f\u207b\u00b9[t]] &#92;]<br \/>\nLo haremos probando las dos implicaciones.<\/p>\n<p>(\u27f9) Supongamos que &#92;(y \u2208 f[s] \u2229 t&#92;). Entonces, se tiene que<br \/>\n&#92;begin{align}<br \/>\n   &amp;y \u2208 f[s] &#92;tag{1} &#92;&#92;<br \/>\n   &amp;y \u2208 t    &#92;tag{2}<br \/>\n&#92;end{align}<br \/>\nPor (1), existe un &#92;(x&#92;) tal que<br \/>\n&#92;begin{align}<br \/>\n   &amp;x \u2208 s     &#92;tag{3} &#92;&#92;<br \/>\n   &amp;f(x) = y  &#92;tag{4}<br \/>\n&#92;end{align}<br \/>\nPor (2) y (4),<br \/>\n&#92;[ f(x) \u2208 t &#92;]<br \/>\ny, por tanto,<br \/>\n&#92;[ x \u2208 f\u207b\u00b9[t] &#92;]<br \/>\nque, junto con (3), da<br \/>\n&#92;{ x \u2208 s \u2229 f\u207b\u00b9[t] &#92;]<br \/>\ny, por tanto,<br \/>\n&#92;[ f(x) \u2208 f[s \u2229 f\u207b\u00b9[t]] &#92;]<br \/>\nque, junto con (4), da<br \/>\n&#92;[ y \u2208 f[s \u2229 f\u207b\u00b9[t]] &#92;]<\/p>\n<p>(\u27f8) Supongamos que &#92;(y \u2208 f[s \u2229 f\u207b\u00b9[t]]&#92;). Entonces, existe un &#92;(x&#92;) tal que<br \/>\n&#92;begin{align}<br \/>\n   &amp;x \u2208 s \u2229 f\u207b\u00b9[t] &#92;tag{5} &#92;&#92;<br \/>\n   &amp;f(x) = y       &#92;tag{6}<br \/>\n&#92;end{align}<br \/>\nPor (1), se tiene que<br \/>\n&#92;begin{align}<br \/>\n   &amp;x \u2208 s      &#92;tag{7} &#92;&#92;<br \/>\n   &amp;x \u2208 f\u207b\u00b9[t] &#92;tag{8}<br \/>\n&#92;end{align}<br \/>\nPor (7) se tiene que<br \/>\n&#92;[ f(x) \u2208 f[s] &#92;]<br \/>\ny, junto con (6), se tiene que<br \/>\n&#92;[ y \u2208 f[s] &#92;tag{9} &#92;]<br \/>\nPor (8), se tiene que<br \/>\n&#92;[ f(x) \u2208 t &#92;]<br \/>\ny, junto con (6), se tiene que<br \/>\n&#92;[ y \u2208 t &#92;tag{10} &#92;]<br \/>\nPor (9) y (19), se tiene que<br \/>\n&#92;[ y \u2208 f[s] \u2229 t &#92;]<\/p>\n<h2>2. Demostraciones con Lean4<\/h2>\n<pre lang=\"lean\">\nimport Mathlib.Data.Set.Function\nimport Mathlib.Tactic\n\nopen Set\n\nvariable {\u03b1 \u03b2 : Type _}\nvariable (f : \u03b1 \u2192 \u03b2)\nvariable (s : Set \u03b1)\nvariable (t : Set \u03b2)\n\n-- 1\u00aa demostraci\u00f3n\n-- ===============\n\nexample : (f '' s) \u2229 t = f '' (s \u2229 f \u207b\u00b9' t) :=\nby\n  ext y\n  -- y : \u03b2\n  -- \u22a2 y \u2208 f '' s \u2229 t \u2194 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n  have h1 : y \u2208 f '' s \u2229 t \u2192 y \u2208 f '' (s \u2229 f \u207b\u00b9' t) := by\n    intro hy\n    -- hy : y \u2208 f '' s \u2229 t\n    -- \u22a2 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    have h1a : y \u2208 f '' s := hy.1\n    obtain \u27e8x : \u03b1, hx: x \u2208 s \u2227 f x = y\u27e9 := h1a\n    have h1b : x \u2208 s := hx.1\n    have h1c : f x = y := hx.2\n    have h1d : y \u2208 t := hy.2\n    have h1e : f x \u2208 t := by rwa [\u2190h1c] at h1d\n    have h1f : x \u2208 s \u2229 f \u207b\u00b9' t := mem_inter h1b h1e\n    have h1g : f x \u2208 f '' (s \u2229 f \u207b\u00b9' t) := mem_image_of_mem f h1f\n    show y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    rwa [h1c] at h1g\n  have h2 : y \u2208 f '' (s \u2229 f \u207b\u00b9' t) \u2192 y \u2208 f '' s \u2229 t :=  by\n    intro hy\n    -- hy : y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    -- \u22a2 y \u2208 f '' s \u2229 t\n    obtain \u27e8x : \u03b1, hx : x \u2208 s \u2229 f \u207b\u00b9' t \u2227 f x = y\u27e9 := hy\n    have h2a : x \u2208 s := hx.1.1\n    have h2b : f x \u2208 f '' s := mem_image_of_mem f h2a\n    have h2c : y \u2208 f '' s := by rwa [hx.2] at h2b\n    have h2d : x \u2208 f \u207b\u00b9' t := hx.1.2\n    have h2e : f x \u2208 t := mem_preimage.mp h2d\n    have h2f : y \u2208 t := by rwa [hx.2] at h2e\n    show y \u2208 f '' s \u2229 t\n    exact mem_inter h2c h2f\n  show y \u2208 f '' s \u2229 t \u2194 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n  exact \u27e8h1, h2\u27e9\n\n-- 2\u00aa demostraci\u00f3n\n-- ===============\n\nexample : (f '' s) \u2229 t = f '' (s \u2229 f \u207b\u00b9' t) :=\nby\n  ext y\n  -- y : \u03b2\n  -- \u22a2 y \u2208 f '' s \u2229 t \u2194 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n  constructor\n  . -- \u22a2 y \u2208 f '' s \u2229 t \u2192 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    intro hy\n    -- hy : y \u2208 f '' s \u2229 t\n    -- \u22a2 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    cases' hy with hyfs yt\n    -- hyfs : y \u2208 f '' s\n    -- yt : y \u2208 t\n    cases' hyfs with x hx\n    -- x : \u03b1\n    -- hx : x \u2208 s \u2227 f x = y\n    cases' hx with xs fxy\n    -- xs : x \u2208 s\n    -- fxy : f x = y\n    use x\n    -- \u22a2 x \u2208 s \u2229 f \u207b\u00b9' t \u2227 f x = y\n    constructor\n    . -- \u22a2 x \u2208 s \u2229 f \u207b\u00b9' t\n      constructor\n      . -- \u22a2 x \u2208 s\n        exact xs\n      . -- \u22a2 x \u2208 f \u207b\u00b9' t\n        rw [mem_preimage]\n        -- \u22a2 f x \u2208 t\n        rw [fxy]\n        -- \u22a2 y \u2208 t\n        exact yt\n    . -- \u22a2 f x = y\n      exact fxy\n  . -- \u22a2 y \u2208 f '' (s \u2229 f \u207b\u00b9' t) \u2192 y \u2208 f '' s \u2229 t\n    intro hy\n    -- hy : y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    -- \u22a2 y \u2208 f '' s \u2229 t\n    cases' hy with x hx\n    -- x : \u03b1\n    -- hx : x \u2208 s \u2229 f \u207b\u00b9' t \u2227 f x = y\n    constructor\n    . -- \u22a2 y \u2208 f '' s\n      use x\n      -- \u22a2 x \u2208 s \u2227 f x = y\n      constructor\n      . -- \u22a2 x \u2208 s\n        exact hx.1.1\n      . -- \u22a2 f x = y\n        exact hx.2\n    . -- \u22a2 y \u2208 t\n      cases' hx with hx1 fxy\n      -- hx1 : x \u2208 s \u2229 f \u207b\u00b9' t\n      -- fxy : f x = y\n      rw [\u2190fxy]\n      -- \u22a2 f x \u2208 t\n      rw [\u2190mem_preimage]\n      -- \u22a2 x \u2208 f \u207b\u00b9' t\n      exact hx1.2\n\n-- 3\u00aa demostraci\u00f3n\n-- ===============\n\nexample : (f '' s) \u2229 t = f '' (s \u2229 f \u207b\u00b9' t) :=\nby\n  ext y\n  -- y : \u03b2\n  -- \u22a2 y \u2208 f '' s \u2229 t \u2194 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n  constructor\n  . -- \u22a2 y \u2208 f '' s \u2229 t \u2192 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    rintro \u27e8\u27e8x, xs, fxy\u27e9, yt\u27e9\n    -- yt : y \u2208 t\n    -- x : \u03b1\n    -- xs : x \u2208 s\n    -- fxy : f x = y\n    -- \u22a2 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    use x\n    -- \u22a2 x \u2208 s \u2229 f \u207b\u00b9' t \u2227 f x = y\n    constructor\n    . -- \u22a2 x \u2208 s \u2229 f \u207b\u00b9' t\n      constructor\n      . -- \u22a2 x \u2208 s\n        exact xs\n      . -- \u22a2 x \u2208 f \u207b\u00b9' t\n        rw [mem_preimage]\n        -- \u22a2 f x \u2208 t\n        rw [fxy]\n        -- \u22a2 y \u2208 t\n        exact yt\n    . -- \u22a2 f x = y\n      exact fxy\n  . -- \u22a2 y \u2208 f '' (s \u2229 f \u207b\u00b9' t) \u2192 y \u2208 f '' s \u2229 t\n    rintro \u27e8x, \u27e8xs, xt\u27e9, fxy\u27e9\n    -- x : \u03b1\n    -- fxy : f x = y\n    -- xs : x \u2208 s\n    -- xt : x \u2208 f \u207b\u00b9' t\n    -- \u22a2 y \u2208 f '' s \u2229 t\n    constructor\n    . -- \u22a2 y \u2208 f '' s\n      use x, xs\n      -- \u22a2 f x = y\n      exact fxy\n    . -- \u22a2 y \u2208 t\n      rw [\u2190fxy]\n      -- \u22a2 f x \u2208 t\n      rw [\u2190mem_preimage]\n      -- \u22a2 x \u2208 f \u207b\u00b9' t\n      exact xt\n\n-- 4\u00aa demostraci\u00f3n\n-- ===============\n\nexample : (f '' s) \u2229 t = f '' (s \u2229 f \u207b\u00b9' t) :=\nby\n  ext y\n  -- y : \u03b2\n  -- \u22a2 y \u2208 f '' s \u2229 t \u2194 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n  constructor\n  . -- \u22a2 y \u2208 f '' s \u2229 t \u2192 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    rintro \u27e8\u27e8x, xs, fxy\u27e9, yt\u27e9\n    -- yt : y \u2208 t\n    -- x : \u03b1\n    -- xs : x \u2208 s\n    -- fxy : f x = y\n    -- \u22a2 y \u2208 f '' (s \u2229 f \u207b\u00b9' t)\n    aesop\n  . -- \u22a2 y \u2208 f '' (s \u2229 f \u207b\u00b9' t) \u2192 y \u2208 f '' s \u2229 t\n    rintro \u27e8x, \u27e8xs, xt\u27e9, fxy\u27e9\n    -- x : \u03b1\n    -- fxy : f x = y\n    -- xs : x \u2208 s\n    -- xt : x \u2208 f \u207b\u00b9' t\n    -- \u22a2 y \u2208 f '' s \u2229 t\n    aesop\n\n-- 5\u00aa demostraci\u00f3n\n-- ===============\n\nexample : (f '' s) \u2229 t = f '' (s \u2229 f \u207b\u00b9' t) :=\nby ext ; constructor <;> aesop\n\n-- 6\u00aa demostraci\u00f3n\n-- ===============\n\nexample : (f '' s) \u2229 t = f '' (s \u2229 f \u207b\u00b9' t) :=\n(image_inter_preimage f s t).symm\n\n-- Lemas usados\n-- ============\n\n-- variable (x : \u03b1)\n-- variable (v : Set \u03b1)\n-- #check (image_inter_preimage f s t : f '' (s \u2229 f \u207b\u00b9' t) = f '' s \u2229 t)\n-- #check (mem_image_of_mem f : x \u2208 s \u2192 f x \u2208 f '' s)\n-- #check (mem_inter : x \u2208 s \u2192 x \u2208 v \u2192 x \u2208 s \u2229 v)\n-- #check (mem_preimage : x \u2208 f \u207b\u00b9' t \u2194 f x \u2208 t)\n<\/pre>\n<p>Se puede interactuar con las demostraciones anteriores en<br \/>\n<a href=\"https:\/\/live.lean-lang.org\/#url=https:\/\/raw.githubusercontent.com\/jaalonso\/Calculemus2\/main\/src\/Interseccion_con_la_imagen.lean\">Lean 4 Web<\/a>.<\/p>\n<h2>3. Demostraciones con Isabelle\/HOL<\/h2>\n<pre lang=\"isar\">\ntheory Interseccion_con_la_imagen\nimports Main\nbegin\n\n(* 1\u00aa demostraci\u00f3n *)\n\nlemma \"(f ` s) \u2229 v = f ` (s \u2229 f -` v)\"\nproof (rule equalityI)\n  show \"(f ` s) \u2229 v \u2286 f ` (s \u2229 f -` v)\"\n  proof (rule subsetI)\n    fix y\n    assume \"y \u2208 (f ` s) \u2229 v\"\n    then show \"y \u2208 f ` (s \u2229 f -` v)\"\n    proof (rule IntE)\n      assume \"y \u2208 v\"\n      assume \"y \u2208 f ` s\"\n      then show \"y \u2208 f ` (s \u2229 f -` v)\"\n      proof (rule imageE)\n        fix x\n        assume \"x \u2208 s\"\n        assume \"y = f x\"\n        then have \"f x \u2208 v\"\n          using \u2039y \u2208 v\u203a by (rule subst)\n        then have \"x \u2208 f -` v\"\n          by (rule vimageI2)\n        with \u2039x \u2208 s\u203a have \"x \u2208 s \u2229 f -` v\"\n          by (rule IntI)\n        then have \"f x \u2208 f ` (s \u2229 f -` v)\"\n          by (rule imageI)\n        with \u2039y = f x\u203a show \"y \u2208 f ` (s \u2229 f -` v)\"\n          by (rule ssubst)\n      qed\n    qed\n  qed\nnext\n  show \"f ` (s \u2229 f -` v) \u2286 (f ` s) \u2229 v\"\n  proof (rule subsetI)\n    fix y\n    assume \"y \u2208 f ` (s \u2229 f -` v)\"\n    then show \"y \u2208 (f ` s) \u2229 v\"\n    proof (rule imageE)\n      fix x\n      assume \"y = f x\"\n      assume hx : \"x \u2208 s \u2229 f -` v\"\n      have \"y \u2208 f ` s\"\n      proof -\n        have \"x \u2208 s\"\n          using hx by (rule IntD1)\n        then have \"f x \u2208 f ` s\"\n          by (rule imageI)\n        with \u2039y = f x\u203a show \"y \u2208 f ` s\"\n          by (rule ssubst)\n      qed\n      moreover\n      have \"y \u2208 v\"\n      proof -\n        have \"x \u2208 f -` v\"\n          using hx by (rule IntD2)\n        then have \"f x \u2208 v\"\n          by (rule vimageD)\n        with \u2039y = f x\u203a show \"y \u2208 v\"\n          by (rule ssubst)\n      qed\n      ultimately show \"y \u2208 (f ` s) \u2229 v\"\n        by (rule IntI)\n    qed\n  qed\nqed\n\n(* 2\u00aa demostraci\u00f3n *)\n\nlemma \"(f ` s) \u2229 v = f ` (s \u2229 f -` v)\"\nproof\n  show \"(f ` s) \u2229 v \u2286 f ` (s \u2229 f -` v)\"\n  proof\n    fix y\n    assume \"y \u2208 (f ` s) \u2229 v\"\n    then show \"y \u2208 f ` (s \u2229 f -` v)\"\n    proof\n      assume \"y \u2208 v\"\n      assume \"y \u2208 f ` s\"\n      then show \"y \u2208 f ` (s \u2229 f -` v)\"\n      proof\n        fix x\n        assume \"x \u2208 s\"\n        assume \"y = f x\"\n        then have \"f x \u2208 v\" using \u2039y \u2208 v\u203a by simp\n        then have \"x \u2208 f -` v\" by simp\n        with \u2039x \u2208 s\u203a have \"x \u2208 s \u2229 f -` v\" by simp\n        then have \"f x \u2208 f ` (s \u2229 f -` v)\" by simp\n        with \u2039y = f x\u203a show \"y \u2208 f ` (s \u2229 f -` v)\" by simp\n      qed\n    qed\n  qed\nnext\n  show \"f ` (s \u2229 f -` v) \u2286 (f ` s) \u2229 v\"\n  proof\n    fix y\n    assume \"y \u2208 f ` (s \u2229 f -` v)\"\n    then show \"y \u2208 (f ` s) \u2229 v\"\n    proof\n      fix x\n      assume \"y = f x\"\n      assume hx : \"x \u2208 s \u2229 f -` v\"\n      have \"y \u2208 f ` s\"\n      proof -\n        have \"x \u2208 s\" using hx by simp\n        then have \"f x \u2208 f ` s\" by simp\n        with \u2039y = f x\u203a show \"y \u2208 f ` s\" by simp\n      qed\n      moreover\n      have \"y \u2208 v\"\n      proof -\n        have \"x \u2208 f -` v\" using hx by simp\n        then have \"f x \u2208 v\" by simp\n        with \u2039y = f x\u203a show \"y \u2208 v\" by simp\n      qed\n      ultimately show \"y \u2208 (f ` s) \u2229 v\" by simp\n    qed\n  qed\nqed\n\n(* 3\u00aa demostraci\u00f3n *)\n\nlemma \"(f ` s) \u2229 v = f ` (s \u2229 f -` v)\"\nproof\n  show \"(f ` s) \u2229 v \u2286 f ` (s \u2229 f -` v)\"\n  proof\n    fix y\n    assume \"y \u2208 (f ` s) \u2229 v\"\n    then show \"y \u2208 f ` (s \u2229 f -` v)\"\n    proof\n      assume \"y \u2208 v\"\n      assume \"y \u2208 f ` s\"\n      then show \"y \u2208 f ` (s \u2229 f -` v)\"\n      proof\n        fix x\n        assume \"x \u2208 s\"\n        assume \"y = f x\"\n        then show \"y \u2208 f ` (s \u2229 f -` v)\"\n          using \u2039x \u2208 s\u203a \u2039y \u2208 v\u203a by simp\n      qed\n    qed\n  qed\nnext\n  show \"f ` (s \u2229 f -` v) \u2286 (f ` s) \u2229 v\"\n  proof\n    fix y\n    assume \"y \u2208 f ` (s \u2229 f -` v)\"\n    then show \"y \u2208 (f ` s) \u2229 v\"\n    proof\n      fix x\n      assume \"y = f x\"\n      assume hx : \"x \u2208 s \u2229 f -` v\"\n      then have \"y \u2208 f ` s\" using \u2039y = f x\u203a by simp\n      moreover\n      have \"y \u2208 v\" using hx \u2039y = f x\u203a by simp\n      ultimately show \"y \u2208 (f ` s) \u2229 v\" by simp\n    qed\n  qed\nqed\n\n(* 4\u00aa demostraci\u00f3n *)\n\nlemma \"(f ` s) \u2229 v = f ` (s \u2229 f -` v)\"\n  by auto\n\nend\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Demostrar con Lean4 que &#92;[ f[s] \u2229 t = f[s \u2229 f\u207b\u00b9[t]] &#92;] Para ello, completar la siguiente teor\u00eda de Lean4: import Mathlib.Data.Set.Function import Mathlib.Tactic open Set variable {\u03b1 \u03b2 : Type _} variable (f : \u03b1 \u2192 \u03b2) variable (s : Set \u03b1) variable (t : Set \u03b2) example : (f \u00bb s) \u2229 t = f \u00bb (s \u2229 f \u207b\u00b9&#8217; t) := by sorry<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"default","_kad_post_title":"default","_kad_post_layout":"default","_kad_post_sidebar_id":"","_kad_post_content_style":"default","_kad_post_vertical_padding":"default","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[17],"tags":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/posts\/2395"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/comments?post=2395"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/posts\/2395\/revisions"}],"predecessor-version":[{"id":2396,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/posts\/2395\/revisions\/2396"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/media?parent=2395"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/categories?post=2395"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/calculemus\/wp-json\/wp\/v2\/tags?post=2395"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}