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 3071 | . . 3 ⊢ (∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∃*𝑢(𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥)) | |
2 | brres 5898 | . . . . . 6 ⊢ (𝑥 ∈ V → (𝑢(𝑅 ↾ dom 𝑅)𝑥 ↔ (𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥))) | |
3 | 2 | elv 3438 | . . . . 5 ⊢ (𝑢(𝑅 ↾ dom 𝑅)𝑥 ↔ (𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥)) |
4 | resdm 5936 | . . . . . 6 ⊢ (Rel 𝑅 → (𝑅 ↾ dom 𝑅) = 𝑅) | |
5 | 4 | breqd 5085 | . . . . 5 ⊢ (Rel 𝑅 → (𝑢(𝑅 ↾ dom 𝑅)𝑥 ↔ 𝑢𝑅𝑥)) |
6 | 3, 5 | bitr3id 285 | . . . 4 ⊢ (Rel 𝑅 → ((𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥) ↔ 𝑢𝑅𝑥)) |
7 | 6 | mobidv 2549 | . . 3 ⊢ (Rel 𝑅 → (∃*𝑢(𝑢 ∈ dom 𝑅 ∧ 𝑢𝑅𝑥) ↔ ∃*𝑢 𝑢𝑅𝑥)) |
8 | 1, 7 | syl5bb 283 | . 2 ⊢ (Rel 𝑅 → (∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∃*𝑢 𝑢𝑅𝑥)) |
9 | 8 | albidv 1923 | 1 ⊢ (Rel 𝑅 → (∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∀𝑥∃*𝑢 𝑢𝑅𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∀wal 1537 ∈ wcel 2106 ∃*wmo 2538 ∃*wrmo 3067 Vcvv 3432 class class class wbr 5074 dom cdm 5589 ↾ cres 5591 Rel wrel 5594 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-mo 2540 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rex 3070 df-rmo 3071 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-xp 5595 df-rel 5596 df-dm 5599 df-res 5601 |
This theorem is referenced by: inecmo3 36493 |
Copyright terms: Public domain | W3C validator |