ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dmmrnm Unicode version

Theorem dmmrnm 5001
Description: A domain is inhabited if and only if the range is inhabited. (Contributed by Jim Kingdon, 15-Dec-2018.)
Assertion
Ref Expression
dmmrnm  |-  ( E. x  x  e.  dom  A  <->  E. y  y  e.  ran  A )
Distinct variable groups:    y, A    x, A

Proof of Theorem dmmrnm
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 df-dm 4784 . . . . 5  |-  dom  A  =  { x  |  E. z  x A z }
21eleq2i 2305 . . . 4  |-  ( x  e.  dom  A  <->  x  e.  { x  |  E. z  x A z } )
32exbii 1658 . . 3  |-  ( E. x  x  e.  dom  A  <->  E. x  x  e.  { x  |  E. z  x A z } )
4 abid 2226 . . . 4  |-  ( x  e.  { x  |  E. z  x A z }  <->  E. z  x A z )
54exbii 1658 . . 3  |-  ( E. x  x  e.  {
x  |  E. z  x A z }  <->  E. x E. z  x A
z )
63, 5bitri 184 . 2  |-  ( E. x  x  e.  dom  A  <->  E. x E. z  x A z )
7 dfrn2 4968 . . . . 5  |-  ran  A  =  { z  |  E. x  x A z }
87eleq2i 2305 . . . 4  |-  ( z  e.  ran  A  <->  z  e.  { z  |  E. x  x A z } )
98exbii 1658 . . 3  |-  ( E. z  z  e.  ran  A  <->  E. z  z  e.  { z  |  E. x  x A z } )
10 abid 2226 . . . . 5  |-  ( z  e.  { z  |  E. x  x A z }  <->  E. x  x A z )
1110exbii 1658 . . . 4  |-  ( E. z  z  e.  {
z  |  E. x  x A z }  <->  E. z E. x  x A
z )
12 excom 1716 . . . 4  |-  ( E. z E. x  x A z  <->  E. x E. z  x A
z )
1311, 12bitri 184 . . 3  |-  ( E. z  z  e.  {
z  |  E. x  x A z }  <->  E. x E. z  x A
z )
149, 13bitri 184 . 2  |-  ( E. z  z  e.  ran  A  <->  E. x E. z  x A z )
15 eleq1 2301 . . 3  |-  ( z  =  y  ->  (
z  e.  ran  A  <->  y  e.  ran  A ) )
1615cbvexv 1974 . 2  |-  ( E. z  z  e.  ran  A  <->  E. y  y  e.  ran  A )
176, 14, 163bitr2i 208 1  |-  ( E. x  x  e.  dom  A  <->  E. y  y  e.  ran  A )
Colors of variables:    wff set class
This proof depends on syntax axioms:    <-> wb 105   E.wex 1545    e. wcel 2209   {cab 2224   class class class wbr 4130   dom cdm 4774   ran crn 4775
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-cnv 4782  df-dm 4784  df-rn 4785
This theorem is used by:  rnsnm  5254  ghmrn  14060  nninfall  17052
  Copyright terms: Public domain W3C validator