Theorem bj-fununsn2 38014

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 4108	. . . 4 ⊢ (𝐺 ∪ {⟨𝐵, 𝐶⟩}) = ({⟨𝐵, 𝐶⟩} ∪ 𝐺)
3	1, 2	eqtrdi 2813	. . 3 ⊢ (𝜑 → 𝐹 = ({⟨𝐵, 𝐶⟩} ∪ 𝐺))
4		bj-fununsn2.neldm	. . 3 ⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐺)
5	3, 4	bj-funun 38012	. 2 ⊢ (𝜑 → (𝐹‘𝐵) = ({⟨𝐵, 𝐶⟩}‘𝐵))
6		bj-fununsn2.ex1	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
7		bj-fununsn2.ex2	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊)
8		fvsng 7182	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ({⟨𝐵, 𝐶⟩}‘𝐵) = 𝐶)
9	6, 7, 8	syl2anc 596	. 2 ⊢ (𝜑 → ({⟨𝐵, 𝐶⟩}‘𝐵) = 𝐶)
10	5, 9	eqtrd 2797	1 ⊢ (𝜑 → (𝐹‘𝐵) = 𝐶)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2145   ∪ cun 3900  {csn 4587  ⟨cop 4593  dom cdm 5659  ‘cfv 6537

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fv 6545

This theorem is used by:  bj-fvsnun2  38016  bj-fvmptunsn1  38017