| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ralrnmo | Structured version Visualization version GIF version | ||
| Description: On the range, "at most one" becomes "exactly one". (Contributed by Peter Mazsa, 27-Sep-2018.) (Revised by Peter Mazsa, 2-Feb-2026.) |
| Ref | Expression |
|---|---|
| ralrnmo | ⊢ (∀𝑥 ∈ ran 𝑅∃*𝑢 𝑢𝑅𝑥 ↔ ∀𝑥 ∈ ran 𝑅∃!𝑢 𝑢𝑅𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrn2 5882 | . . . . . 6 ⊢ ran 𝑅 = {𝑥 ∣ ∃𝑢 𝑢𝑅𝑥} | |
| 2 | 1 | eqabri 2912 | . . . . 5 ⊢ (𝑥 ∈ ran 𝑅 ↔ ∃𝑢 𝑢𝑅𝑥) |
| 3 | 2 | biimpi 219 | . . . 4 ⊢ (𝑥 ∈ ran 𝑅 → ∃𝑢 𝑢𝑅𝑥) |
| 4 | 3 | biantrurd 541 | . . 3 ⊢ (𝑥 ∈ ran 𝑅 → (∃*𝑢 𝑢𝑅𝑥 ↔ (∃𝑢 𝑢𝑅𝑥 ∧ ∃*𝑢 𝑢𝑅𝑥))) |
| 5 | 4 | ralbiia 3116 | . 2 ⊢ (∀𝑥 ∈ ran 𝑅∃*𝑢 𝑢𝑅𝑥 ↔ ∀𝑥 ∈ ran 𝑅(∃𝑢 𝑢𝑅𝑥 ∧ ∃*𝑢 𝑢𝑅𝑥)) |
| 6 | df-eu 2604 | . . 3 ⊢ (∃!𝑢 𝑢𝑅𝑥 ↔ (∃𝑢 𝑢𝑅𝑥 ∧ ∃*𝑢 𝑢𝑅𝑥)) | |
| 7 | 6 | ralbii 3118 | . 2 ⊢ (∀𝑥 ∈ ran 𝑅∃!𝑢 𝑢𝑅𝑥 ↔ ∀𝑥 ∈ ran 𝑅(∃𝑢 𝑢𝑅𝑥 ∧ ∃*𝑢 𝑢𝑅𝑥)) |
| 8 | 5, 7 | bitr4i 281 | 1 ⊢ (∀𝑥 ∈ ran 𝑅∃*𝑢 𝑢𝑅𝑥 ↔ ∀𝑥 ∈ ran 𝑅∃!𝑢 𝑢𝑅𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∃wex 1807 ∈ wcel 2150 ∃*wmo 2572 ∃!weu 2603 ∀wral 3086 class class class wbr 5114 ran crn 5666 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-12 2220 ax-ext 2742 ax-sep 5262 ax-pr 5408 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-sb 2099 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-ral 3087 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-cnv 5673 df-dm 5675 df-rn 5676 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |