Theorem dfdfat2 47133

Description: Alternate definition of the predicate "defined at" not using the Fun predicate. (Contributed by Alexander van der Vekens, 22-Jul-2017.) (Proof shortened by Peter Mazsa, 2-Oct-2022.)

Assertion

Ref	Expression
dfdfat2	⊢ (𝐹 defAt 𝐴 ↔ (𝐴 ∈ dom 𝐹 ∧ ∃!𝑦 𝐴𝐹𝑦))

Distinct variable groups:   𝑦,𝐴   𝑦,𝐹

Proof of Theorem dfdfat2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-dfat 47124	. 2 ⊢ (𝐹 defAt 𝐴 ↔ (𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})))
2		relres 5979	. . . 4 ⊢ Rel (𝐹 ↾ {𝐴})
3		dffun8 6547	. . . 4 ⊢ (Fun (𝐹 ↾ {𝐴}) ↔ (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥 ∈ dom (𝐹 ↾ {𝐴})∃!𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
4	2, 3	mpbiran 709	. . 3 ⊢ (Fun (𝐹 ↾ {𝐴}) ↔ ∀𝑥 ∈ dom (𝐹 ↾ {𝐴})∃!𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
5	4	anbi2i 623	. 2 ⊢ ((𝐴 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝐴})) ↔ (𝐴 ∈ dom 𝐹 ∧ ∀𝑥 ∈ dom (𝐹 ↾ {𝐴})∃!𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
6		brres 5960	. . . . . . . 8 ⊢ (𝑦 ∈ V → (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦)))
7	6	elv 3455	. . . . . . 7 ⊢ (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦))
8	7	a1i 11	. . . . . 6 ⊢ (𝐴 ∈ dom 𝐹 → (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦)))
9	8	eubidv 2580	. . . . 5 ⊢ (𝐴 ∈ dom 𝐹 → (∃!𝑦 𝑥(𝐹 ↾ {𝐴})𝑦 ↔ ∃!𝑦(𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦)))
10	9	ralbidv 3157	. . . 4 ⊢ (𝐴 ∈ dom 𝐹 → (∀𝑥 ∈ dom (𝐹 ↾ {𝐴})∃!𝑦 𝑥(𝐹 ↾ {𝐴})𝑦 ↔ ∀𝑥 ∈ dom (𝐹 ↾ {𝐴})∃!𝑦(𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦)))
11		eldmressnsn 5998	. . . . 5 ⊢ (𝐴 ∈ dom 𝐹 → 𝐴 ∈ dom (𝐹 ↾ {𝐴}))
12		eldmressn 47042	. . . . 5 ⊢ (𝑥 ∈ dom (𝐹 ↾ {𝐴}) → 𝑥 = 𝐴)
13		velsn 4608	. . . . . . . 8 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
14	13	biimpri 228	. . . . . . 7 ⊢ (𝑥 = 𝐴 → 𝑥 ∈ {𝐴})
15		breq1 5113	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝑦))
16	15	anbi2d 630	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦) ↔ (𝑥 ∈ {𝐴} ∧ 𝐴𝐹𝑦)))
17	14, 16	mpbirand 707	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦) ↔ 𝐴𝐹𝑦))
18	17	eubidv 2580	. . . . 5 ⊢ (𝑥 = 𝐴 → (∃!𝑦(𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦) ↔ ∃!𝑦 𝐴𝐹𝑦))
19	11, 12, 18	ralbinrald 47127	. . . 4 ⊢ (𝐴 ∈ dom 𝐹 → (∀𝑥 ∈ dom (𝐹 ↾ {𝐴})∃!𝑦(𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦) ↔ ∃!𝑦 𝐴𝐹𝑦))
20	10, 19	bitrd 279	. . 3 ⊢ (𝐴 ∈ dom 𝐹 → (∀𝑥 ∈ dom (𝐹 ↾ {𝐴})∃!𝑦 𝑥(𝐹 ↾ {𝐴})𝑦 ↔ ∃!𝑦 𝐴𝐹𝑦))
21	20	pm5.32i 574	. 2 ⊢ ((𝐴 ∈ dom 𝐹 ∧ ∀𝑥 ∈ dom (𝐹 ↾ {𝐴})∃!𝑦 𝑥(𝐹 ↾ {𝐴})𝑦) ↔ (𝐴 ∈ dom 𝐹 ∧ ∃!𝑦 𝐴𝐹𝑦))
22	1, 5, 21	3bitri 297	1 ⊢ (𝐹 defAt 𝐴 ↔ (𝐴 ∈ dom 𝐹 ∧ ∃!𝑦 𝐴𝐹𝑦))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∃!weu 2562  ∀wral 3045  Vcvv 3450  {csn 4592   class class class wbr 5110  dom cdm 5641   ↾ cres 5643  Rel wrel 5646  Fun wfun 6508   defAt wdfat 47121

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-res 5653  df-fun 6516  df-dfat 47124

This theorem is referenced by:  dfafv2  47137  afveu  47158  rlimdmafv  47182  tz6.12-2-afv2  47242  afv2eu  47243  tz6.12i-afv2  47248  dfatbrafv2b  47250  dfatsnafv2  47257  dfafv23  47258  dfatcolem  47260  dfatco  47261  rlimdmafv2  47263