| 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 3471 | . 2 ⊢ (𝐴 ∈ ran 𝐹 → 𝐴 ∈ V) | |
| 2 | snprc 4678 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅) | |
| 3 | 2 | biimpi 219 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → {𝐴} = ∅) |
| 4 | 3 | imaeq2d 6056 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (◡𝐹 “ {𝐴}) = (◡𝐹 “ ∅)) |
| 5 | ima0 6073 | . . . 4 ⊢ (◡𝐹 “ ∅) = ∅ | |
| 6 | 4, 5 | eqtrdi 2811 | . . 3 ⊢ (¬ 𝐴 ∈ V → (◡𝐹 “ {𝐴}) = ∅) |
| 7 | 6 | necon1ai 2982 | . 2 ⊢ ((◡𝐹 “ {𝐴}) ≠ ∅ → 𝐴 ∈ V) |
| 8 | eleq1 2848 | . . 3 ⊢ (𝑎 = 𝐴 → (𝑎 ∈ ran 𝐹 ↔ 𝐴 ∈ ran 𝐹)) | |
| 9 | sneq 4594 | . . . . 5 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴}) | |
| 10 | 9 | imaeq2d 6056 | . . . 4 ⊢ (𝑎 = 𝐴 → (◡𝐹 “ {𝑎}) = (◡𝐹 “ {𝐴})) |
| 11 | 10 | neeq1d 3014 | . . 3 ⊢ (𝑎 = 𝐴 → ((◡𝐹 “ {𝑎}) ≠ ∅ ↔ (◡𝐹 “ {𝐴}) ≠ ∅)) |
| 12 | abn0 4334 | . . . 4 ⊢ ({𝑏 ∣ 𝑏𝐹𝑎} ≠ ∅ ↔ ∃𝑏 𝑏𝐹𝑎) | |
| 13 | iniseg 6093 | . . . . . 6 ⊢ (𝑎 ∈ V → (◡𝐹 “ {𝑎}) = {𝑏 ∣ 𝑏𝐹𝑎}) | |
| 14 | 13 | elv 3455 | . . . . 5 ⊢ (◡𝐹 “ {𝑎}) = {𝑏 ∣ 𝑏𝐹𝑎} |
| 15 | 14 | neeq1i 3019 | . . . 4 ⊢ ((◡𝐹 “ {𝑎}) ≠ ∅ ↔ {𝑏 ∣ 𝑏𝐹𝑎} ≠ ∅) |
| 16 | vex 3454 | . . . . 5 ⊢ 𝑎 ∈ V | |
| 17 | 16 | elrn 5877 | . . . 4 ⊢ (𝑎 ∈ ran 𝐹 ↔ ∃𝑏 𝑏𝐹𝑎) |
| 18 | 12, 15, 17 | 3bitr4ri 307 | . . 3 ⊢ (𝑎 ∈ ran 𝐹 ↔ (◡𝐹 “ {𝑎}) ≠ ∅) |
| 19 | 8, 11, 18 | vtoclbg 3519 | . 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 2145 {cab 2738 ≠ wne 2955 Vcvv 3450 ∅c0 4279 {csn 4584 class class class wbr 5103 ◡ccnv 5654 ran crn 5656 “ cima 5658 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 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 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5661 df-cnv 5663 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 |
| This theorem is used by: fnpreimac 33144 onvfowev 35714 dnnumch3lem 43888 dnnumch3 43889 wessf1ornlem 46018 |
| Copyright terms: Public domain | W3C validator |