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

Theorem caofid0l 7750
Description: Transfer a left identity law to the function operation. (Contributed by NM, 21-Oct-2014.)
Hypotheses
Ref Expression
caofref.1 (𝜑 → 𝐴 ∈ 𝑉)
caofref.2 (𝜑 → 𝐹:𝐴⟶𝑆)
caofid0.3 (𝜑 → 𝐵 ∈ 𝑊)
caofid0l.5 ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝐵𝑅𝑥) = 𝑥)
Assertion
Ref Expression
caofid0l (𝜑 → ((𝐴 × {𝐵}) ∘f 𝑅𝐹) = 𝐹)
Distinct variable groups:   𝑥,𝐵   𝑥,𝐹   𝜑,𝑥   𝑥,𝑅   𝑥,𝑆
Allowed substitution hints:   𝐴(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem caofid0l
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 caofref.1 . 2 (𝜑 → 𝐴 ∈ 𝑉)
2 caofid0.3 . . 3 (𝜑 → 𝐵 ∈ 𝑊)
3 fnconstg 6792 . . 3 (𝐵 ∈ 𝑊 → (𝐴 × {𝐵}) Fn 𝐴)
42, 3syl 18 . 2 (𝜑 → (𝐴 × {𝐵}) Fn 𝐴)
5 caofref.2 . . 3 (𝜑 → 𝐹:𝐴⟶𝑆)
65ffnd 6732 . 2 (𝜑 → 𝐹 Fn 𝐴)
7 fvconst2g 7231 . . 3 ((𝐵 ∈ 𝑊 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑤) = 𝐵)
82, 7sylan 592 . 2 ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑤) = 𝐵)
9 eqidd 2764 . 2 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤))
10 caofid0l.5 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝐵𝑅𝑥) = 𝑥)
1110ralrimiva 3158 . . 3 (𝜑 → ∀𝑥 ∈ 𝑆 (𝐵𝑅𝑥) = 𝑥)
125ffvelcdmda 7108 . . 3 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
13 oveq2 7451 . . . . 5 (𝑥 = (𝐹‘𝑤) → (𝐵𝑅𝑥) = (𝐵𝑅(𝐹‘𝑤)))
14 id 23 . . . . 5 (𝑥 = (𝐹‘𝑤) → 𝑥 = (𝐹‘𝑤))
1513, 14eqeq12d 2779 . . . 4 (𝑥 = (𝐹‘𝑤) → ((𝐵𝑅𝑥) = 𝑥 ↔ (𝐵𝑅(𝐹‘𝑤)) = (𝐹‘𝑤)))
1615rspccva 3579 . . 3 ((∀𝑥 ∈ 𝑆 (𝐵𝑅𝑥) = 𝑥 ∧ (𝐹‘𝑤) ∈ 𝑆) → (𝐵𝑅(𝐹‘𝑤)) = (𝐹‘𝑤))
1711, 12, 16syl2an2r 698 . 2 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐵𝑅(𝐹‘𝑤)) = (𝐹‘𝑤))
181, 4, 6, 6, 8, 9, 17offveq 7743 1 (𝜑 → ((𝐴 × {𝐵}) ∘f 𝑅𝐹) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {csn 4588   × cxp 5653   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443   ∘f cof 7715
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-of 7717
This theorem is used by:  mndvlid  19023  psr0lid  22291  psrlmod  22297  lfladd0l  40323  mendlmod  44383
  Copyright terms: Public domain W3C validator