Theorem fmptsnd 7178

Description: Express a singleton function in maps-to notation. Deduction form of fmptsng 7177. (Contributed by AV, 4-Aug-2019.)

Hypotheses

Ref	Expression
fmptsnd.1	⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶)
fmptsnd.2	⊢ (𝜑 → 𝐴 ∈ 𝑉)
fmptsnd.3	⊢ (𝜑 → 𝐶 ∈ 𝑊)

Assertion

Ref	Expression
fmptsnd	⊢ (𝜑 → {⟨𝐴, 𝐶⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝜑,𝑥

Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem fmptsnd

Dummy variables 𝑝 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		velsn 4596	. . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
2	1	bicomi 227	. . . 4 ⊢ (𝑥 = 𝐴 ↔ 𝑥 ∈ {𝐴})
3	2	anbi1i 636	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵))
4	3	opabbii 5171	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)}
5		velsn 4596	. . . . 5 ⊢ (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ 𝑝 = ⟨𝐴, 𝐶⟩)
6		eqidd 2761	. . . . . . . 8 ⊢ (𝜑 → 𝐴 = 𝐴)
7		eqidd 2761	. . . . . . . 8 ⊢ (𝜑 → 𝐶 = 𝐶)
8		sbcan 3787	. . . . . . . . . . 11 ⊢ ([𝐶 / 𝑦](𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ([𝐶 / 𝑦]𝑥 = 𝐴 ∧ [𝐶 / 𝑦]𝑦 = 𝐵))
9		fmptsnd.3	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ 𝑊)
10		sbcg 3810	. . . . . . . . . . . . 13 ⊢ (𝐶 ∈ 𝑊 → ([𝐶 / 𝑦]𝑥 = 𝐴 ↔ 𝑥 = 𝐴))
11	9, 10	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → ([𝐶 / 𝑦]𝑥 = 𝐴 ↔ 𝑥 = 𝐴))
12		eqsbc1 3784	. . . . . . . . . . . . 13 ⊢ (𝐶 ∈ 𝑊 → ([𝐶 / 𝑦]𝑦 = 𝐵 ↔ 𝐶 = 𝐵))
13	9, 12	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → ([𝐶 / 𝑦]𝑦 = 𝐵 ↔ 𝐶 = 𝐵))
14	11, 13	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝜑 → (([𝐶 / 𝑦]𝑥 = 𝐴 ∧ [𝐶 / 𝑦]𝑦 = 𝐵) ↔ (𝑥 = 𝐴 ∧ 𝐶 = 𝐵)))
15	8, 14	bitrid 286	. . . . . . . . . 10 ⊢ (𝜑 → ([𝐶 / 𝑦](𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 = 𝐴 ∧ 𝐶 = 𝐵)))
16	15	sbcbidv 3793	. . . . . . . . 9 ⊢ (𝜑 → ([𝐴 / 𝑥][𝐶 / 𝑦](𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ [𝐴 / 𝑥](𝑥 = 𝐴 ∧ 𝐶 = 𝐵)))
17		fmptsnd.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
18		eqeq1 2764	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐴 ↔ 𝐴 = 𝐴))
19	18	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝑥 = 𝐴 ↔ 𝐴 = 𝐴))
20		fmptsnd.1	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶)
21	20	eqeq2d 2771	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝐶 = 𝐵 ↔ 𝐶 = 𝐶))
22	19, 21	anbi12d 644	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝑥 = 𝐴 ∧ 𝐶 = 𝐵) ↔ (𝐴 = 𝐴 ∧ 𝐶 = 𝐶)))
23	17, 22	sbcied 3781	. . . . . . . . 9 ⊢ (𝜑 → ([𝐴 / 𝑥](𝑥 = 𝐴 ∧ 𝐶 = 𝐵) ↔ (𝐴 = 𝐴 ∧ 𝐶 = 𝐶)))
24	16, 23	bitrd 282	. . . . . . . 8 ⊢ (𝜑 → ([𝐴 / 𝑥][𝐶 / 𝑦](𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝐴 = 𝐴 ∧ 𝐶 = 𝐶)))
25	6, 7, 24	mpbir2and 726	. . . . . . 7 ⊢ (𝜑 → [𝐴 / 𝑥][𝐶 / 𝑦](𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
26		opelopabsb 5504	. . . . . . 7 ⊢ (⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} ↔ [𝐴 / 𝑥][𝐶 / 𝑦](𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
27	25, 26	sylibr 237	. . . . . 6 ⊢ (𝜑 → ⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)})
28		eleq1 2848	. . . . . 6 ⊢ (𝑝 = ⟨𝐴, 𝐶⟩ → (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} ↔ ⟨𝐴, 𝐶⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)}))
29	27, 28	syl5ibrcom 250	. . . . 5 ⊢ (𝜑 → (𝑝 = ⟨𝐴, 𝐶⟩ → 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)}))
30	5, 29	biimtrid 245	. . . 4 ⊢ (𝜑 → (𝑝 ∈ {⟨𝐴, 𝐶⟩} → 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)}))
31		elopab 5501	. . . . 5 ⊢ (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} ↔ ∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)))
32		opeq12 4841	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
33	32	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
34	33	eqeq2d 2771	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝑝 = ⟨𝑥, 𝑦⟩ ↔ 𝑝 = ⟨𝐴, 𝐵⟩))
35	20	adantrr 730	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝐵 = 𝐶)
36	35	opeq2d 4846	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ⟨𝐴, 𝐵⟩ = ⟨𝐴, 𝐶⟩)
37		opex 5432	. . . . . . . . . . . 12 ⊢ ⟨𝐴, 𝐶⟩ ∈ V
38	37	snid 4619	. . . . . . . . . . 11 ⊢ ⟨𝐴, 𝐶⟩ ∈ {⟨𝐴, 𝐶⟩}
39	36, 38	eqeltrdi 2868	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ⟨𝐴, 𝐵⟩ ∈ {⟨𝐴, 𝐶⟩})
40		eleq1 2848	. . . . . . . . . 10 ⊢ (𝑝 = ⟨𝐴, 𝐵⟩ → (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝐴, 𝐶⟩}))
41	39, 40	syl5ibrcom 250	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝑝 = ⟨𝐴, 𝐵⟩ → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
42	34, 41	sylbid 243	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝑝 = ⟨𝑥, 𝑦⟩ → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
43	42	ex 418	. . . . . . 7 ⊢ (𝜑 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑝 = ⟨𝑥, 𝑦⟩ → 𝑝 ∈ {⟨𝐴, 𝐶⟩})))
44	43	impcomd 417	. . . . . 6 ⊢ (𝜑 → ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
45	44	exlimdvv 1966	. . . . 5 ⊢ (𝜑 → (∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
46	31, 45	biimtrid 245	. . . 4 ⊢ (𝜑 → (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)} → 𝑝 ∈ {⟨𝐴, 𝐶⟩}))
47	30, 46	impbid 215	. . 3 ⊢ (𝜑 → (𝑝 ∈ {⟨𝐴, 𝐶⟩} ↔ 𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)}))
48	47	eqrdv 2758	. 2 ⊢ (𝜑 → {⟨𝐴, 𝐶⟩} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)})
49		df-mpt 5186	. . 3 ⊢ (𝑥 ∈ {𝐴} ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)}
50	49	a1i 11	. 2 ⊢ (𝜑 → (𝑥 ∈ {𝐴} ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝐴} ∧ 𝑦 = 𝐵)})
51	4, 48, 50	3eqtr4a 2821	1 ⊢ (𝜑 → {⟨𝐴, 𝐶⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  [wsbc 3738  {csn 4584  ⟨cop 4834  {copab 5166   ↦ cmpt 5185

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-pr 5391

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-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-opab 5167  df-mpt 5186

This theorem is used by:  fmptapd  7180  fmptpr  7181  mposn  8120  fmptunsnop  33344  vieta  34262