Theorem eqfunresadj 7364

Description: Law for adjoining an element to restrictions of functions. (Contributed by Scott Fenton, 6-Dec-2021.)

Assertion

Ref	Expression
eqfunresadj	⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝐹 ↾ (𝑋 ∪ {𝑌})) = (𝐺 ↾ (𝑋 ∪ {𝑌})))

Proof of Theorem eqfunresadj

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

Step	Hyp	Ref	Expression
1		relres 5998	. 2 ⊢ Rel (𝐹 ↾ (𝑋 ∪ {𝑌}))
2		relres 5998	. 2 ⊢ Rel (𝐺 ↾ (𝑋 ∪ {𝑌}))
3		breq 5105	. . . . 5 ⊢ ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) → (𝑥(𝐹 ↾ 𝑋)𝑦 ↔ 𝑥(𝐺 ↾ 𝑋)𝑦))
4	3	3ad2ant2 1152	. . . 4 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝑥(𝐹 ↾ 𝑋)𝑦 ↔ 𝑥(𝐺 ↾ 𝑋)𝑦))
5		velsn 4600	. . . . . . 7 ⊢ (𝑥 ∈ {𝑌} ↔ 𝑥 = 𝑌)
6		simp33 1230	. . . . . . . . . 10 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝐹‘𝑌) = (𝐺‘𝑌))
7	6	eqeq1d 2762	. . . . . . . . 9 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → ((𝐹‘𝑌) = 𝑦 ↔ (𝐺‘𝑌) = 𝑦))
8		simp1l 1216	. . . . . . . . . 10 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → Fun 𝐹)
9		simp31 1228	. . . . . . . . . 10 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → 𝑌 ∈ dom 𝐹)
10		funbrfvb 6932	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑌 ∈ dom 𝐹) → ((𝐹‘𝑌) = 𝑦 ↔ 𝑌𝐹𝑦))
11	8, 9, 10	syl2anc 596	. . . . . . . . 9 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → ((𝐹‘𝑌) = 𝑦 ↔ 𝑌𝐹𝑦))
12		simp1r 1217	. . . . . . . . . 10 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → Fun 𝐺)
13		simp32 1229	. . . . . . . . . 10 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → 𝑌 ∈ dom 𝐺)
14		funbrfvb 6932	. . . . . . . . . 10 ⊢ ((Fun 𝐺 ∧ 𝑌 ∈ dom 𝐺) → ((𝐺‘𝑌) = 𝑦 ↔ 𝑌𝐺𝑦))
15	12, 13, 14	syl2anc 596	. . . . . . . . 9 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → ((𝐺‘𝑌) = 𝑦 ↔ 𝑌𝐺𝑦))
16	7, 11, 15	3bitr3d 312	. . . . . . . 8 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝑌𝐹𝑦 ↔ 𝑌𝐺𝑦))
17		breq1 5106	. . . . . . . . 9 ⊢ (𝑥 = 𝑌 → (𝑥𝐹𝑦 ↔ 𝑌𝐹𝑦))
18		breq1 5106	. . . . . . . . 9 ⊢ (𝑥 = 𝑌 → (𝑥𝐺𝑦 ↔ 𝑌𝐺𝑦))
19	17, 18	bibi12d 348	. . . . . . . 8 ⊢ (𝑥 = 𝑌 → ((𝑥𝐹𝑦 ↔ 𝑥𝐺𝑦) ↔ (𝑌𝐹𝑦 ↔ 𝑌𝐺𝑦)))
20	16, 19	syl5ibrcom 250	. . . . . . 7 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝑥 = 𝑌 → (𝑥𝐹𝑦 ↔ 𝑥𝐺𝑦)))
21	5, 20	biimtrid 245	. . . . . 6 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝑥 ∈ {𝑌} → (𝑥𝐹𝑦 ↔ 𝑥𝐺𝑦)))
22	21	pm5.32d 588	. . . . 5 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → ((𝑥 ∈ {𝑌} ∧ 𝑥𝐹𝑦) ↔ (𝑥 ∈ {𝑌} ∧ 𝑥𝐺𝑦)))
23		vex 3454	. . . . . 6 ⊢ 𝑦 ∈ V
24	23	brresi 5981	. . . . 5 ⊢ (𝑥(𝐹 ↾ {𝑌})𝑦 ↔ (𝑥 ∈ {𝑌} ∧ 𝑥𝐹𝑦))
25	23	brresi 5981	. . . . 5 ⊢ (𝑥(𝐺 ↾ {𝑌})𝑦 ↔ (𝑥 ∈ {𝑌} ∧ 𝑥𝐺𝑦))
26	22, 24, 25	3bitr4g 317	. . . 4 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝑥(𝐹 ↾ {𝑌})𝑦 ↔ 𝑥(𝐺 ↾ {𝑌})𝑦))
27	4, 26	orbi12d 932	. . 3 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → ((𝑥(𝐹 ↾ 𝑋)𝑦 ∨ 𝑥(𝐹 ↾ {𝑌})𝑦) ↔ (𝑥(𝐺 ↾ 𝑋)𝑦 ∨ 𝑥(𝐺 ↾ {𝑌})𝑦)))
28		resundi 5986	. . . . 5 ⊢ (𝐹 ↾ (𝑋 ∪ {𝑌})) = ((𝐹 ↾ 𝑋) ∪ (𝐹 ↾ {𝑌}))
29	28	breqi 5109	. . . 4 ⊢ (𝑥(𝐹 ↾ (𝑋 ∪ {𝑌}))𝑦 ↔ 𝑥((𝐹 ↾ 𝑋) ∪ (𝐹 ↾ {𝑌}))𝑦)
30		brun 5156	. . . 4 ⊢ (𝑥((𝐹 ↾ 𝑋) ∪ (𝐹 ↾ {𝑌}))𝑦 ↔ (𝑥(𝐹 ↾ 𝑋)𝑦 ∨ 𝑥(𝐹 ↾ {𝑌})𝑦))
31	29, 30	bitri 278	. . 3 ⊢ (𝑥(𝐹 ↾ (𝑋 ∪ {𝑌}))𝑦 ↔ (𝑥(𝐹 ↾ 𝑋)𝑦 ∨ 𝑥(𝐹 ↾ {𝑌})𝑦))
32		resundi 5986	. . . . 5 ⊢ (𝐺 ↾ (𝑋 ∪ {𝑌})) = ((𝐺 ↾ 𝑋) ∪ (𝐺 ↾ {𝑌}))
33	32	breqi 5109	. . . 4 ⊢ (𝑥(𝐺 ↾ (𝑋 ∪ {𝑌}))𝑦 ↔ 𝑥((𝐺 ↾ 𝑋) ∪ (𝐺 ↾ {𝑌}))𝑦)
34		brun 5156	. . . 4 ⊢ (𝑥((𝐺 ↾ 𝑋) ∪ (𝐺 ↾ {𝑌}))𝑦 ↔ (𝑥(𝐺 ↾ 𝑋)𝑦 ∨ 𝑥(𝐺 ↾ {𝑌})𝑦))
35	33, 34	bitri 278	. . 3 ⊢ (𝑥(𝐺 ↾ (𝑋 ∪ {𝑌}))𝑦 ↔ (𝑥(𝐺 ↾ 𝑋)𝑦 ∨ 𝑥(𝐺 ↾ {𝑌})𝑦))
36	27, 31, 35	3bitr4g 317	. 2 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝑥(𝐹 ↾ (𝑋 ∪ {𝑌}))𝑦 ↔ 𝑥(𝐺 ↾ (𝑋 ∪ {𝑌}))𝑦))
37	1, 2, 36	eqbrrdiv 5774	1 ⊢ (((Fun 𝐹 ∧ Fun 𝐺) ∧ (𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ∧ (𝑌 ∈ dom 𝐹 ∧ 𝑌 ∈ dom 𝐺 ∧ (𝐹‘𝑌) = (𝐺‘𝑌))) → (𝐹 ↾ (𝑋 ∪ {𝑌})) = (𝐺 ↾ (𝑋 ∪ {𝑌})))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ∪ cun 3897  {csn 4584   class class class wbr 5103  dom cdm 5655   ↾ cres 5657  Fun wfun 6527  ‘cfv 6533

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-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 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-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-res 5667  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541

This theorem is used by:  eqfunressuc  7365