![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dmmrnm | GIF version |
Description: A domain is inhabited if and only if the range is inhabited. (Contributed by Jim Kingdon, 15-Dec-2018.) |
Ref | Expression |
---|---|
dmmrnm | ⊢ (∃𝑥 𝑥 ∈ dom 𝐴 ↔ ∃𝑦 𝑦 ∈ ran 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-dm 4632 | . . . . 5 ⊢ dom 𝐴 = {𝑥 ∣ ∃𝑧 𝑥𝐴𝑧} | |
2 | 1 | eleq2i 2244 | . . . 4 ⊢ (𝑥 ∈ dom 𝐴 ↔ 𝑥 ∈ {𝑥 ∣ ∃𝑧 𝑥𝐴𝑧}) |
3 | 2 | exbii 1605 | . . 3 ⊢ (∃𝑥 𝑥 ∈ dom 𝐴 ↔ ∃𝑥 𝑥 ∈ {𝑥 ∣ ∃𝑧 𝑥𝐴𝑧}) |
4 | abid 2165 | . . . 4 ⊢ (𝑥 ∈ {𝑥 ∣ ∃𝑧 𝑥𝐴𝑧} ↔ ∃𝑧 𝑥𝐴𝑧) | |
5 | 4 | exbii 1605 | . . 3 ⊢ (∃𝑥 𝑥 ∈ {𝑥 ∣ ∃𝑧 𝑥𝐴𝑧} ↔ ∃𝑥∃𝑧 𝑥𝐴𝑧) |
6 | 3, 5 | bitri 184 | . 2 ⊢ (∃𝑥 𝑥 ∈ dom 𝐴 ↔ ∃𝑥∃𝑧 𝑥𝐴𝑧) |
7 | dfrn2 4810 | . . . . 5 ⊢ ran 𝐴 = {𝑧 ∣ ∃𝑥 𝑥𝐴𝑧} | |
8 | 7 | eleq2i 2244 | . . . 4 ⊢ (𝑧 ∈ ran 𝐴 ↔ 𝑧 ∈ {𝑧 ∣ ∃𝑥 𝑥𝐴𝑧}) |
9 | 8 | exbii 1605 | . . 3 ⊢ (∃𝑧 𝑧 ∈ ran 𝐴 ↔ ∃𝑧 𝑧 ∈ {𝑧 ∣ ∃𝑥 𝑥𝐴𝑧}) |
10 | abid 2165 | . . . . 5 ⊢ (𝑧 ∈ {𝑧 ∣ ∃𝑥 𝑥𝐴𝑧} ↔ ∃𝑥 𝑥𝐴𝑧) | |
11 | 10 | exbii 1605 | . . . 4 ⊢ (∃𝑧 𝑧 ∈ {𝑧 ∣ ∃𝑥 𝑥𝐴𝑧} ↔ ∃𝑧∃𝑥 𝑥𝐴𝑧) |
12 | excom 1664 | . . . 4 ⊢ (∃𝑧∃𝑥 𝑥𝐴𝑧 ↔ ∃𝑥∃𝑧 𝑥𝐴𝑧) | |
13 | 11, 12 | bitri 184 | . . 3 ⊢ (∃𝑧 𝑧 ∈ {𝑧 ∣ ∃𝑥 𝑥𝐴𝑧} ↔ ∃𝑥∃𝑧 𝑥𝐴𝑧) |
14 | 9, 13 | bitri 184 | . 2 ⊢ (∃𝑧 𝑧 ∈ ran 𝐴 ↔ ∃𝑥∃𝑧 𝑥𝐴𝑧) |
15 | eleq1 2240 | . . 3 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ ran 𝐴 ↔ 𝑦 ∈ ran 𝐴)) | |
16 | 15 | cbvexv 1918 | . 2 ⊢ (∃𝑧 𝑧 ∈ ran 𝐴 ↔ ∃𝑦 𝑦 ∈ ran 𝐴) |
17 | 6, 14, 16 | 3bitr2i 208 | 1 ⊢ (∃𝑥 𝑥 ∈ dom 𝐴 ↔ ∃𝑦 𝑦 ∈ ran 𝐴) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 105 ∃wex 1492 ∈ wcel 2148 {cab 2163 class class class wbr 4000 dom cdm 4622 ran crn 4623 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-pow 4171 ax-pr 4205 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-v 2739 df-un 3133 df-in 3135 df-ss 3142 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-br 4001 df-opab 4062 df-cnv 4630 df-dm 4632 df-rn 4633 |
This theorem is referenced by: rnsnm 5090 nninfall 14381 |
Copyright terms: Public domain | W3C validator |