| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > inisegn0 | Structured version Visualization version GIF version | ||
| Description: Nonemptiness of an initial segment in terms of range. (Contributed by Stefan O'Rear, 18-Jan-2015.) |
| Ref | Expression |
|---|---|
| inisegn0 | ⊢ (𝐴 ∈ ran 𝐹 ↔ (◡𝐹 “ {𝐴}) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3475 | . 2 ⊢ (𝐴 ∈ ran 𝐹 → 𝐴 ∈ V) | |
| 2 | snprc 4680 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅) | |
| 3 | 2 | biimpi 219 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → {𝐴} = ∅) |
| 4 | 3 | imaeq2d 6070 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (◡𝐹 “ {𝐴}) = (◡𝐹 “ ∅)) |
| 5 | ima0 6093 | . . . 4 ⊢ (◡𝐹 “ ∅) = ∅ | |
| 6 | 4, 5 | eqtrdi 2814 | . . 3 ⊢ (¬ 𝐴 ∈ V → (◡𝐹 “ {𝐴}) = ∅) |
| 7 | 6 | necon1ai 2986 | . 2 ⊢ ((◡𝐹 “ {𝐴}) ≠ ∅ → 𝐴 ∈ V) |
| 8 | eleq1 2852 | . . 3 ⊢ (𝑎 = 𝐴 → (𝑎 ∈ ran 𝐹 ↔ 𝐴 ∈ ran 𝐹)) | |
| 9 | sneq 4594 | . . . . 5 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴}) | |
| 10 | 9 | imaeq2d 6070 | . . . 4 ⊢ (𝑎 = 𝐴 → (◡𝐹 “ {𝑎}) = (◡𝐹 “ {𝐴})) |
| 11 | 10 | neeq1d 3018 | . . 3 ⊢ (𝑎 = 𝐴 → ((◡𝐹 “ {𝑎}) ≠ ∅ ↔ (◡𝐹 “ {𝐴}) ≠ ∅)) |
| 12 | abn0 4337 | . . . 4 ⊢ ({𝑏 ∣ 𝑏𝐹𝑎} ≠ ∅ ↔ ∃𝑏 𝑏𝐹𝑎) | |
| 13 | iniseg 6113 | . . . . . 6 ⊢ (𝑎 ∈ V → (◡𝐹 “ {𝑎}) = {𝑏 ∣ 𝑏𝐹𝑎}) | |
| 14 | 13 | elv 3459 | . . . . 5 ⊢ (◡𝐹 “ {𝑎}) = {𝑏 ∣ 𝑏𝐹𝑎} |
| 15 | 14 | neeq1i 3023 | . . . 4 ⊢ ((◡𝐹 “ {𝑎}) ≠ ∅ ↔ {𝑏 ∣ 𝑏𝐹𝑎} ≠ ∅) |
| 16 | vex 3458 | . . . . 5 ⊢ 𝑎 ∈ V | |
| 17 | 16 | elrn 5887 | . . . 4 ⊢ (𝑎 ∈ ran 𝐹 ↔ ∃𝑏 𝑏𝐹𝑎) |
| 18 | 12, 15, 17 | 3bitr4ri 307 | . . 3 ⊢ (𝑎 ∈ ran 𝐹 ↔ (◡𝐹 “ {𝑎}) ≠ ∅) |
| 19 | 8, 11, 18 | vtoclbg 3523 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ ran 𝐹 ↔ (◡𝐹 “ {𝐴}) ≠ ∅)) |
| 20 | 1, 7, 19 | pm5.21nii 381 | 1 ⊢ (𝐴 ∈ ran 𝐹 ↔ (◡𝐹 “ {𝐴}) ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 = wceq 1570 ∃wex 1812 ∈ wcel 2147 {cab 2741 ≠ wne 2959 Vcvv 3454 ∅c0 4281 {csn 4588 class class class wbr 5108 ◡ccnv 5657 ran crn 5659 “ cima 5661 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-xp 5664 df-cnv 5666 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 |
| This theorem is used by: fnpreimac 33362 onvfowev 36091 dnnumch3lem 44319 dnnumch3 44320 wessf1ornlem 46473 |
| Copyright terms: Public domain | W3C validator |