Theorem domeng 6646

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 3933	. 2 |- ( y = B -> ( A ~<_ y <-> A ~<_ B ) )
2		sseq2 3121	. . . 4 |- ( y = B -> ( x C_ y <-> x C_ B ) )
3	2	anbi2d 459	. . 3 |- ( y = B -> ( ( A ~~ x /\ x C_ y ) <-> ( A ~~ x /\ x C_ B ) ) )
4	3	exbidv 1797	. 2 |- ( y = B -> ( E. x ( A ~~ x /\ x C_ y ) <-> E. x ( A ~~ x /\ x C_ B ) ) )
5		vex 2689	. . 3 |- y e. _V
6	5	domen 6645	. 2 |- ( A ~<_ y <-> E. x ( A ~~ x /\ x C_ y ) )
7	1, 4, 6	vtoclbg 2747	1 |- ( B e. C -> ( A ~<_ B <-> E. x ( A ~~ x /\ x C_ B ) ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1331   E.wex 1468   e. wcel 1480   C_ wss 3071   class class class wbr 3929   ~~ cen 6632   ~<_ cdom 6633

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-xp 4545  df-rel 4546  df-cnv 4547  df-dm 4549  df-rn 4550  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-en 6635  df-dom 6636

This theorem is referenced by:  mapdom1g  6741