Theorem bj-fununsn2 38268

Description: Value of a function expressed as a union of a function and a singleton on a couple (with disjoint domain) at the first component of that couple. (Contributed by BJ, 18-Mar-2023.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-fununsn.un	⊢ (𝜑 → 𝐹 = (𝐺 ∪ {⟨𝐵, 𝐶⟩}))
bj-fununsn2.neldm	⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐺)
bj-fununsn2.ex1	⊢ (𝜑 → 𝐵 ∈ 𝑉)
bj-fununsn2.ex2	⊢ (𝜑 → 𝐶 ∈ 𝑊)

Assertion

Ref	Expression
bj-fununsn2	⊢ (𝜑 → (𝐹‘𝐵) = 𝐶)

Proof of Theorem bj-fununsn2

Step	Hyp	Ref	Expression
1		bj-fununsn.un	. . . 4 ⊢ (𝜑 → 𝐹 = (𝐺 ∪ {⟨𝐵, 𝐶⟩}))
2		uncom 4157	. . . 4 ⊢ (𝐺 ∪ {⟨𝐵, 𝐶⟩}) = ({⟨𝐵, 𝐶⟩} ∪ 𝐺)
3	1, 2	eqtrdi 2811	. . 3 ⊢ (𝜑 → 𝐹 = ({⟨𝐵, 𝐶⟩} ∪ 𝐺))
4		bj-fununsn2.neldm	. . 3 ⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐺)
5	3, 4	bj-funun 38266	. 2 ⊢ (𝜑 → (𝐹‘𝐵) = ({⟨𝐵, 𝐶⟩}‘𝐵))
6		bj-fununsn2.ex1	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
7		bj-fununsn2.ex2	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊)
8		fvsng 7185	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ({⟨𝐵, 𝐶⟩}‘𝐵) = 𝐶)
9	6, 7, 8	syl2anc 596	. 2 ⊢ (𝜑 → ({⟨𝐵, 𝐶⟩}‘𝐵) = 𝐶)
10	5, 9	eqtrd 2795	1 ⊢ (𝜑 → (𝐹‘𝐵) = 𝐶)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569   ∈ wcel 2144   ∪ cun 4149  {csn 4584  ⟨cop 4834  dom cdm 5650  ‘cfv 6538

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fv 6546

This theorem is used by:  bj-fvsnun2  38270  bj-fvmptunsn1  38271