Theorem domeng 6922

Description: Dominance in terms of equinumerosity, with the sethood requirement expressed as an antecedent. Example 1 of [Enderton] p. 146. (Contributed by NM, 24-Apr-2004.)

Assertion

Ref	Expression
domeng	|- ( B e. C -> ( A ~<_ B <-> E. x ( A ~~ x /\ x C_ B ) ) )

Distinct variable groups:   x, A   x, B

Allowed substitution hint:   C( x)

Proof of Theorem domeng

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 4092	. 2 |- ( y = B -> ( A ~<_ y <-> A ~<_ B ) )
2		sseq2 3251	. . . 4 |- ( y = B -> ( x C_ y <-> x C_ B ) )
3	2	anbi2d 464	. . 3 |- ( y = B -> ( ( A ~~ x /\ x C_ y ) <-> ( A ~~ x /\ x C_ B ) ) )
4	3	exbidv 1873	. 2 |- ( y = B -> ( E. x ( A ~~ x /\ x C_ y ) <-> E. x ( A ~~ x /\ x C_ B ) ) )
5		vex 2805	. . 3 |- y e. _V
6	5	domen 6921	. 2 |- ( A ~<_ y <-> E. x ( A ~~ x /\ x C_ y ) )
7	1, 4, 6	vtoclbg 2865	1 |- ( B e. C -> ( A ~<_ B <-> E. x ( A ~~ x /\ x C_ B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1397   E.wex 1540   e. wcel 2202   C_ wss 3200   class class class wbr 4088   ~~ cen 6906   ~<_ cdom 6907

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-dm 4735  df-rn 4736  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-en 6909  df-dom 6910

This theorem is referenced by:  mapdom1g  7032