Theorem alrmomorn 39035

Description: Equivalence of an "at most one" and an "at most one" restricted to the range inside a universal quantification. (Contributed by Peter Mazsa, 3-Sep-2021.)

Assertion

Ref	Expression
alrmomorn	⊢ (∀𝑥∃*𝑦 ∈ ran 𝑅 𝑥𝑅𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝑅𝑦)

Proof of Theorem alrmomorn

Step	Hyp	Ref	Expression
1		df-rmo 3368	. . 3 ⊢ (∃*𝑦 ∈ ran 𝑅 𝑥𝑅𝑦 ↔ ∃*𝑦(𝑦 ∈ ran 𝑅 ∧ 𝑥𝑅𝑦))
2		cnvresrn 39025	. . . . . 6 ⊢ (◡𝑅 ↾ ran 𝑅) = ◡𝑅
3	2	breqi 5114	. . . . 5 ⊢ (𝑦(◡𝑅 ↾ ran 𝑅)𝑥 ↔ 𝑦◡𝑅𝑥)
4		brres 5984	. . . . . . 7 ⊢ (𝑥 ∈ V → (𝑦(◡𝑅 ↾ ran 𝑅)𝑥 ↔ (𝑦 ∈ ran 𝑅 ∧ 𝑦◡𝑅𝑥)))
5	4	elv 3459	. . . . . 6 ⊢ (𝑦(◡𝑅 ↾ ran 𝑅)𝑥 ↔ (𝑦 ∈ ran 𝑅 ∧ 𝑦◡𝑅𝑥))
6		brcnvg 5864	. . . . . . . 8 ⊢ ((𝑦 ∈ V ∧ 𝑥 ∈ V) → (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦))
7	6	el2v 3461	. . . . . . 7 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦)
8	7	anbi2i 634	. . . . . 6 ⊢ ((𝑦 ∈ ran 𝑅 ∧ 𝑦◡𝑅𝑥) ↔ (𝑦 ∈ ran 𝑅 ∧ 𝑥𝑅𝑦))
9	5, 8	bitri 278	. . . . 5 ⊢ (𝑦(◡𝑅 ↾ ran 𝑅)𝑥 ↔ (𝑦 ∈ ran 𝑅 ∧ 𝑥𝑅𝑦))
10	3, 9, 7	3bitr3i 304	. . . 4 ⊢ ((𝑦 ∈ ran 𝑅 ∧ 𝑥𝑅𝑦) ↔ 𝑥𝑅𝑦)
11	10	mobii 2575	. . 3 ⊢ (∃*𝑦(𝑦 ∈ ran 𝑅 ∧ 𝑥𝑅𝑦) ↔ ∃*𝑦 𝑥𝑅𝑦)
12	1, 11	bitri 278	. 2 ⊢ (∃*𝑦 ∈ ran 𝑅 𝑥𝑅𝑦 ↔ ∃*𝑦 𝑥𝑅𝑦)
13	12	albii 1848	1 ⊢ (∀𝑥∃*𝑦 ∈ ran 𝑅 𝑥𝑅𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝑅𝑦)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400  ∀wal 1567   ∈ wcel 2142  ∃*wmo 2564  ∃*wrmo 3367  Vcvv 3454   class class class wbr 5108  ^◡ccnv 5659  ran crn 5661   ↾ cres 5662

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-mo 2566  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rmo 3368  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5666  df-rel 5667  df-cnv 5668  df-dm 5670  df-rn 5671  df-res 5672

This theorem is used by:  ineccnvmo2  39045