Theorem refbas 21313

Description: A refinement covers the same set. (Contributed by Jeff Hankins, 18-Jan-2010.) (Revised by Thierry Arnoux, 3-Feb-2020.)

Hypotheses

Ref	Expression
refbas.1	|- X = U. A
refbas.2	|- Y = U. B

Assertion

Ref	Expression
refbas	|- ( A Ref B -> Y = X )

Proof of Theorem refbas

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		refrel 21311	. . 3 |- Rel Ref
2	1	brrelexi 5158	. 2 |- ( A Ref B -> A e. _V )
3		refbas.1	. . . 4 |- X = U. A
4		refbas.2	. . . 4 |- Y = U. B
5	3, 4	isref 21312	. . 3 |- ( A e. _V -> ( A Ref B <-> ( Y = X /\ A. x e. A E. y e. B x C_ y ) ) )
6	5	simprbda 653	. 2 |- ( ( A e. _V /\ A Ref B ) -> Y = X )
7	2, 6	mpancom 703	1 |- ( A Ref B -> Y = X )

Syntax hints:   -> wi 4   = wceq 1483   e. wcel 1990   A.wral 2912   E.wrex 2913   _Vcvv 3200   C_ wss 3574   U.cuni 4436   class class class wbr 4653   Refcref 21305

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-ref 21308

This theorem is referenced by:  reftr  21317  refun0  21318  locfinreflem  29907  cmpcref  29917  cmppcmp  29925  refssfne  32353