Theorem brdomain 36513

Description: Binary relation form of the domain function. (Contributed by Scott Fenton, 11-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

Hypotheses

Ref	Expression
brdomain.1	⊢ 𝐴 ∈ V
brdomain.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
brdomain	⊢ (𝐴Domain𝐵 ↔ 𝐵 = dom 𝐴)

Proof of Theorem brdomain

Step	Hyp	Ref	Expression
1		brdomain.1	. . 3 ⊢ 𝐴 ∈ V
2		brdomain.2	. . 3 ⊢ 𝐵 ∈ V
3	1, 2	brimage 36506	. 2 ⊢ (𝐴Image(1st ↾ (V × V))𝐵 ↔ 𝐵 = ((1st ↾ (V × V)) “ 𝐴))
4		df-domain 36447	. . 3 ⊢ Domain = Image(1st ↾ (V × V))
5	4	breqi 5109	. 2 ⊢ (𝐴Domain𝐵 ↔ 𝐴Image(1st ↾ (V × V))𝐵)
6		dfdm5 36355	. . 3 ⊢ dom 𝐴 = ((1st ↾ (V × V)) “ 𝐴)
7	6	eqeq2i 2773	. 2 ⊢ (𝐵 = dom 𝐴 ↔ 𝐵 = ((1st ↾ (V × V)) “ 𝐴))
8	3, 5, 7	3bitr4i 306	1 ⊢ (𝐴Domain𝐵 ↔ 𝐵 = dom 𝐴)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2145  Vcvv 3450   class class class wbr 5103   × cxp 5653  dom cdm 5655   ↾ cres 5657   “ cima 5658  1^st c1st 7985  Imagecimage 36420  Domaincdomain 36423

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

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-nfc 2909  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-symdif 4199  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-mpt 5187  df-id 5550  df-eprel 5555  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fo 6539  df-fv 6541  df-1st 7987  df-2nd 7988  df-txp 36434  df-image 36444  df-domain 36447

This theorem is used by:  brdomaing  36515  dfrecs2  36532  dfrdg4  36533