Theorem fndmin 5623

Description: Two ways to express the locus of equality between two functions. (Contributed by Stefan O'Rear, 17-Jan-2015.)

Assertion

Ref	Expression
fndmin	⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → dom (𝐹 ∩ 𝐺) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐺‘𝑥)})

Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝑥,𝐴

Proof of Theorem fndmin

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dffn5im 5561	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
2		df-mpt 4066	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))}
3	1, 2	eqtrdi 2226	. . . . 5 ⊢ (𝐹 Fn 𝐴 → 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))})
4		dffn5im 5561	. . . . . 6 ⊢ (𝐺 Fn 𝐴 → 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)))
5		df-mpt 4066	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))}
6	4, 5	eqtrdi 2226	. . . . 5 ⊢ (𝐺 Fn 𝐴 → 𝐺 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))})
7	3, 6	ineqan12d 3338	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 ∩ 𝐺) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))} ∩ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))}))
8		inopab 4759	. . . 4 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))} ∩ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))}) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)))}
9	7, 8	eqtrdi 2226	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 ∩ 𝐺) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)))})
10	9	dmeqd 4829	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → dom (𝐹 ∩ 𝐺) = dom {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)))})
11		anandi 590	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥))) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))))
12	11	exbii 1605	. . . . . . 7 ⊢ (∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥))) ↔ ∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))))
13		19.42v 1906	. . . . . . 7 ⊢ (∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥))) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥))))
14	12, 13	bitr3i 186	. . . . . 6 ⊢ (∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥))))
15		funfvex 5532	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ V)
16		eqeq1 2184	. . . . . . . . . 10 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑦 = (𝐺‘𝑥) ↔ (𝐹‘𝑥) = (𝐺‘𝑥)))
17	16	ceqsexgv 2866	. . . . . . . . 9 ⊢ ((𝐹‘𝑥) ∈ V → (∃𝑦(𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥)) ↔ (𝐹‘𝑥) = (𝐺‘𝑥)))
18	15, 17	syl 14	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (∃𝑦(𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥)) ↔ (𝐹‘𝑥) = (𝐺‘𝑥)))
19	18	funfni 5316	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (∃𝑦(𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥)) ↔ (𝐹‘𝑥) = (𝐺‘𝑥)))
20	19	pm5.32da 452	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → ((𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑦 = (𝐹‘𝑥) ∧ 𝑦 = (𝐺‘𝑥))) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐺‘𝑥))))
21	14, 20	bitrid 192	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐺‘𝑥))))
22	21	abbidv 2295	. . . 4 ⊢ (𝐹 Fn 𝐴 → {𝑥 ∣ ∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)))} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐺‘𝑥))})
23		dmopab 4838	. . . 4 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)))} = {𝑥 ∣ ∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)))}
24		df-rab 2464	. . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐺‘𝑥)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐺‘𝑥))}
25	22, 23, 24	3eqtr4g 2235	. . 3 ⊢ (𝐹 Fn 𝐴 → dom {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)))} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐺‘𝑥)})
26	25	adantr 276	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → dom {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)))} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐺‘𝑥)})
27	10, 26	eqtrd 2210	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → dom (𝐹 ∩ 𝐺) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐺‘𝑥)})

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353  ∃wex 1492   ∈ wcel 2148  {cab 2163  {crab 2459  Vcvv 2737   ∩ cin 3128  {copab 4063   ↦ cmpt 4064  dom cdm 4626  Fun wfun 5210   Fn wfn 5211  ‘cfv 5216

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-br 4004  df-opab 4065  df-mpt 4066  df-id 4293  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-iota 5178  df-fun 5218  df-fn 5219  df-fv 5224

This theorem is referenced by:  fneqeql  5624  mhmeql  12875