![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > alrmomodm | Structured version Visualization version GIF version |
Description: Equivalence of an "at most one" and an "at most one" restricted to the domain inside a universal quantification. (Contributed by Peter Mazsa, 5-Sep-2021.) |
Ref | Expression |
---|---|
alrmomodm | ⊢ (Rel 𝑅 → (∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∀𝑥∃*𝑢 𝑢𝑅𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rmo 3380 | . . 3 ⊢ (∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∃*𝑢(𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥)) | |
2 | brres 6011 | . . . . . 6 ⊢ (𝑥 ∈ V → (𝑢(𝑅 ↾ dom 𝑅)𝑥 ↔ (𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥))) | |
3 | 2 | elv 3486 | . . . . 5 ⊢ (𝑢(𝑅 ↾ dom 𝑅)𝑥 ↔ (𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥)) |
4 | resdm 6051 | . . . . . 6 ⊢ (Rel 𝑅 → (𝑅 ↾ dom 𝑅) = 𝑅) | |
5 | 4 | breqd 5162 | . . . . 5 ⊢ (Rel 𝑅 → (𝑢(𝑅 ↾ dom 𝑅)𝑥 ↔ 𝑢𝑅𝑥)) |
6 | 3, 5 | bitr3id 285 | . . . 4 ⊢ (Rel 𝑅 → ((𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥) ↔ 𝑢𝑅𝑥)) |
7 | 6 | mobidv 2549 | . . 3 ⊢ (Rel 𝑅 → (∃*𝑢(𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥) ↔ ∃*𝑢 𝑢𝑅𝑥)) |
8 | 1, 7 | bitrid 283 | . 2 ⊢ (Rel 𝑅 → (∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∃*𝑢 𝑢𝑅𝑥)) |
9 | 8 | albidv 1920 | 1 ⊢ (Rel 𝑅 → (∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∀𝑥∃*𝑢 𝑢𝑅𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1537 ∈ wcel 2108 ∃*wmo 2538 ∃*wrmo 3379 Vcvv 3481 class class class wbr 5151 dom cdm 5693 ↾ cres 5695 Rel wrel 5698 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 ax-sep 5305 ax-nul 5315 ax-pr 5441 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2065 df-mo 2540 df-clab 2715 df-cleq 2729 df-clel 2816 df-ral 3062 df-rex 3071 df-rmo 3380 df-rab 3437 df-v 3483 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-nul 4343 df-if 4535 df-sn 4635 df-pr 4637 df-op 4641 df-br 5152 df-opab 5214 df-xp 5699 df-rel 5700 df-dm 5703 df-res 5705 |
This theorem is referenced by: inecmo3 38357 |
Copyright terms: Public domain | W3C validator |