Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ofcs1 Structured version   Visualization version   GIF version

Theorem ofcs1 35287
Description: Letterwise operations on a single letter word. (Contributed by Thierry Arnoux, 7-Oct-2018.)
Assertion
Ref Expression
ofcs1 ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (⟨“𝐴”⟩ ∘f/c 𝑅𝐵) = ⟨“(𝐴𝑅𝐵)”⟩)

Proof of Theorem ofcs1
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 snex 5404 . . . 4 {0} ∈ V
21a1i 11 . . 3 ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → {0} ∈ V)
3 simpr 490 . . 3 ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → 𝐵 ∈ 𝑇)
4 simpll 779 . . 3 (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) ∧ 𝑖 ∈ {0}) → 𝐴 ∈ 𝑆)
5 s1val 14786 . . . . 5 (𝐴 ∈ 𝑆 → ⟨“𝐴”⟩ = {⟨0, 𝐴⟩})
6 0nn0 12661 . . . . . 6 0 ∈ ℕ0
7 fmptsn 7203 . . . . . 6 ((0 ∈ ℕ0 ∧ 𝐴 ∈ 𝑆) → {⟨0, 𝐴⟩} = (𝑖 ∈ {0} ↦ 𝐴))
86, 7mpan 703 . . . . 5 (𝐴 ∈ 𝑆 → {⟨0, 𝐴⟩} = (𝑖 ∈ {0} ↦ 𝐴))
95, 8eqtrd 2798 . . . 4 (𝐴 ∈ 𝑆 → ⟨“𝐴”⟩ = (𝑖 ∈ {0} ↦ 𝐴))
109adantr 486 . . 3 ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → ⟨“𝐴”⟩ = (𝑖 ∈ {0} ↦ 𝐴))
112, 3, 4, 10ofcfval2 34847 . 2 ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (⟨“𝐴”⟩ ∘f/c 𝑅𝐵) = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)))
12 ovex 7484 . . . 4 (𝐴𝑅𝐵) ∈ V
13 s1val 14786 . . . 4 ((𝐴𝑅𝐵) ∈ V → ⟨“(𝐴𝑅𝐵)”⟩ = {⟨0, (𝐴𝑅𝐵)⟩})
1412, 13ax-mp 5 . . 3 ⟨“(𝐴𝑅𝐵)”⟩ = {⟨0, (𝐴𝑅𝐵)⟩}
15 fmptsn 7203 . . . 4 ((0 ∈ ℕ0 ∧ (𝐴𝑅𝐵) ∈ V) → {⟨0, (𝐴𝑅𝐵)⟩} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)))
166, 12, 15mp2an 705 . . 3 {⟨0, (𝐴𝑅𝐵)⟩} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))
1714, 16eqtri 2786 . 2 ⟨“(𝐴𝑅𝐵)”⟩ = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))
1811, 17eqtr4di 2816 1 ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑇) → (⟨“𝐴”⟩ ∘f/c 𝑅𝐵) = ⟨“(𝐴𝑅𝐵)”⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {csn 4588  ⟨cop 4840   ↦ cmpt 5192  (class class class)co 7451  0cc0 11239  ℕ0cn0 12646  ⟨“cs1 14783   ∘f/c cofc 34838
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 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-mulcl 11301  ax-i2m1 11307
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-n0 12647  df-s1 14784  df-ofc 34839
This theorem is used by:  ofcs2  35288
  Copyright terms: Public domain W3C validator