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

Theorem fconstfvm 5476
Description: A constant function expressed in terms of its functionality, domain, and value. See also fconst2 5475. (Contributed by Jim Kingdon, 8-Jan-2019.)
Assertion
Ref Expression
fconstfvm (∃𝑦 𝑦𝐴 → (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝑦,𝐴
Allowed substitution hints:   𝐵(𝑦)   𝐹(𝑦)

Proof of Theorem fconstfvm
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ffn 5126 . . 3 (𝐹:𝐴⟶{𝐵} → 𝐹 Fn 𝐴)
2 fvconst 5448 . . . 4 ((𝐹:𝐴⟶{𝐵} ∧ 𝑥𝐴) → (𝐹𝑥) = 𝐵)
32ralrimiva 2442 . . 3 (𝐹:𝐴⟶{𝐵} → ∀𝑥𝐴 (𝐹𝑥) = 𝐵)
41, 3jca 300 . 2 (𝐹:𝐴⟶{𝐵} → (𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵))
5 fvelrnb 5315 . . . . . . . . 9 (𝐹 Fn 𝐴 → (𝑤 ∈ ran 𝐹 ↔ ∃𝑧𝐴 (𝐹𝑧) = 𝑤))
6 fveq2 5268 . . . . . . . . . . . . . 14 (𝑥 = 𝑧 → (𝐹𝑥) = (𝐹𝑧))
76eqeq1d 2093 . . . . . . . . . . . . 13 (𝑥 = 𝑧 → ((𝐹𝑥) = 𝐵 ↔ (𝐹𝑧) = 𝐵))
87rspccva 2714 . . . . . . . . . . . 12 ((∀𝑥𝐴 (𝐹𝑥) = 𝐵𝑧𝐴) → (𝐹𝑧) = 𝐵)
98eqeq1d 2093 . . . . . . . . . . 11 ((∀𝑥𝐴 (𝐹𝑥) = 𝐵𝑧𝐴) → ((𝐹𝑧) = 𝑤𝐵 = 𝑤))
109rexbidva 2373 . . . . . . . . . 10 (∀𝑥𝐴 (𝐹𝑥) = 𝐵 → (∃𝑧𝐴 (𝐹𝑧) = 𝑤 ↔ ∃𝑧𝐴 𝐵 = 𝑤))
11 r19.9rmv 3360 . . . . . . . . . . 11 (∃𝑦 𝑦𝐴 → (𝐵 = 𝑤 ↔ ∃𝑧𝐴 𝐵 = 𝑤))
1211bicomd 139 . . . . . . . . . 10 (∃𝑦 𝑦𝐴 → (∃𝑧𝐴 𝐵 = 𝑤𝐵 = 𝑤))
1310, 12sylan9bbr 451 . . . . . . . . 9 ((∃𝑦 𝑦𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵) → (∃𝑧𝐴 (𝐹𝑧) = 𝑤𝐵 = 𝑤))
145, 13sylan9bbr 451 . . . . . . . 8 (((∃𝑦 𝑦𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → (𝑤 ∈ ran 𝐹𝐵 = 𝑤))
15 velsn 3448 . . . . . . . . 9 (𝑤 ∈ {𝐵} ↔ 𝑤 = 𝐵)
16 eqcom 2087 . . . . . . . . 9 (𝑤 = 𝐵𝐵 = 𝑤)
1715, 16bitr2i 183 . . . . . . . 8 (𝐵 = 𝑤𝑤 ∈ {𝐵})
1814, 17syl6bb 194 . . . . . . 7 (((∃𝑦 𝑦𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → (𝑤 ∈ ran 𝐹𝑤 ∈ {𝐵}))
1918eqrdv 2083 . . . . . 6 (((∃𝑦 𝑦𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → ran 𝐹 = {𝐵})
2019an32s 533 . . . . 5 (((∃𝑦 𝑦𝐴𝐹 Fn 𝐴) ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵) → ran 𝐹 = {𝐵})
2120exp31 356 . . . 4 (∃𝑦 𝑦𝐴 → (𝐹 Fn 𝐴 → (∀𝑥𝐴 (𝐹𝑥) = 𝐵 → ran 𝐹 = {𝐵})))
2221imdistand 436 . . 3 (∃𝑦 𝑦𝐴 → ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵) → (𝐹 Fn 𝐴 ∧ ran 𝐹 = {𝐵})))
23 df-fo 4987 . . . 4 (𝐹:𝐴onto→{𝐵} ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = {𝐵}))
24 fof 5196 . . . 4 (𝐹:𝐴onto→{𝐵} → 𝐹:𝐴⟶{𝐵})
2523, 24sylbir 133 . . 3 ((𝐹 Fn 𝐴 ∧ ran 𝐹 = {𝐵}) → 𝐹:𝐴⟶{𝐵})
2622, 25syl6 33 . 2 (∃𝑦 𝑦𝐴 → ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵) → 𝐹:𝐴⟶{𝐵}))
274, 26impbid2 141 1 (∃𝑦 𝑦𝐴 → (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) = 𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1287  wex 1424  wcel 1436  wral 2355  wrex 2356  {csn 3431  ran crn 4412   Fn wfn 4976  wf 4977  ontowfo 4979  cfv 4981
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-14 1448  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-sep 3932  ax-pow 3984  ax-pr 4010
This theorem depends on definitions:  df-bi 115  df-3an 924  df-tru 1290  df-nf 1393  df-sb 1690  df-eu 1948  df-mo 1949  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ral 2360  df-rex 2361  df-v 2617  df-sbc 2830  df-un 2992  df-in 2994  df-ss 3001  df-pw 3417  df-sn 3437  df-pr 3438  df-op 3440  df-uni 3637  df-br 3821  df-opab 3875  df-mpt 3876  df-id 4094  df-xp 4417  df-rel 4418  df-cnv 4419  df-co 4420  df-dm 4421  df-rn 4422  df-iota 4946  df-fun 4983  df-fn 4984  df-f 4985  df-fo 4987  df-fv 4989
This theorem is referenced by:  fconst3m  5477
  Copyright terms: Public domain W3C validator