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 30621
Description: Letterwise operations on a single letter word. (Contributed by Thierry Arnoux, 7-Oct-2018.)
Assertion
Ref Expression
ofcs1 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩∘𝑓/𝑐𝑅𝐵) = ⟨“(𝐴𝑅𝐵)”⟩)

Proof of Theorem ofcs1
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 snex 4908 . . . 4 {0} ∈ V
21a1i 11 . . 3 ((𝐴𝑆𝐵𝑇) → {0} ∈ V)
3 simpr 477 . . 3 ((𝐴𝑆𝐵𝑇) → 𝐵𝑇)
4 simpll 790 . . 3 (((𝐴𝑆𝐵𝑇) ∧ 𝑖 ∈ {0}) → 𝐴𝑆)
5 s1val 13378 . . . . 5 (𝐴𝑆 → ⟨“𝐴”⟩ = {⟨0, 𝐴⟩})
6 0nn0 11307 . . . . . 6 0 ∈ ℕ0
7 fmptsn 6433 . . . . . 6 ((0 ∈ ℕ0𝐴𝑆) → {⟨0, 𝐴⟩} = (𝑖 ∈ {0} ↦ 𝐴))
86, 7mpan 706 . . . . 5 (𝐴𝑆 → {⟨0, 𝐴⟩} = (𝑖 ∈ {0} ↦ 𝐴))
95, 8eqtrd 2656 . . . 4 (𝐴𝑆 → ⟨“𝐴”⟩ = (𝑖 ∈ {0} ↦ 𝐴))
109adantr 481 . . 3 ((𝐴𝑆𝐵𝑇) → ⟨“𝐴”⟩ = (𝑖 ∈ {0} ↦ 𝐴))
112, 3, 4, 10ofcfval2 30166 . 2 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩∘𝑓/𝑐𝑅𝐵) = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)))
12 ovex 6678 . . . 4 (𝐴𝑅𝐵) ∈ V
13 s1val 13378 . . . 4 ((𝐴𝑅𝐵) ∈ V → ⟨“(𝐴𝑅𝐵)”⟩ = {⟨0, (𝐴𝑅𝐵)⟩})
1412, 13ax-mp 5 . . 3 ⟨“(𝐴𝑅𝐵)”⟩ = {⟨0, (𝐴𝑅𝐵)⟩}
15 fmptsn 6433 . . . 4 ((0 ∈ ℕ0 ∧ (𝐴𝑅𝐵) ∈ V) → {⟨0, (𝐴𝑅𝐵)⟩} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)))
166, 12, 15mp2an 708 . . 3 {⟨0, (𝐴𝑅𝐵)⟩} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))
1714, 16eqtri 2644 . 2 ⟨“(𝐴𝑅𝐵)”⟩ = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))
1811, 17syl6eqr 2674 1 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩∘𝑓/𝑐𝑅𝐵) = ⟨“(𝐴𝑅𝐵)”⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wcel 1990  Vcvv 3200  {csn 4177  cop 4183  cmpt 4729  (class class class)co 6650  0cc0 9936  0cn0 11292  ⟨“cs1 13294  𝑓/𝑐cofc 30157
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-mulcl 9998  ax-i2m1 10004
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-n0 11293  df-s1 13302  df-ofc 30158
This theorem is referenced by:  ofcs2  30622
  Copyright terms: Public domain W3C validator