Theorem dffrege115 44256

Description: If from the circumstance that 𝑐 is a result of an application of the procedure 𝑅 to 𝑏, whatever 𝑏 may be, it can be inferred that every result of an application of the procedure 𝑅 to 𝑏 is the same as 𝑐, then we say : "The procedure 𝑅 is single-valued". Definition 115 of [Frege1879] p. 77. (Contributed by RP, 7-Jul-2020.)

Assertion

Ref	Expression
dffrege115	⊢ (∀𝑐∀𝑏(𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ Fun ◡◡𝑅)

Distinct variable group:   𝑎,𝑏,𝑐,𝑅

Proof of Theorem dffrege115

Step	Hyp	Ref	Expression
1		alcom 2165	. 2 ⊢ (∀𝑐∀𝑏(𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ ∀𝑏∀𝑐(𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)))
2		19.21v 1941	. . . . . . 7 ⊢ (∀𝑎(𝑏𝑅𝑐 → (𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ (𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)))
3		impexp 450	. . . . . . . . 9 ⊢ (((𝑏𝑅𝑐 ∧ 𝑏𝑅𝑎) → 𝑎 = 𝑐) ↔ (𝑏𝑅𝑐 → (𝑏𝑅𝑎 → 𝑎 = 𝑐)))
4		vex 3443	. . . . . . . . . . . . 13 ⊢ 𝑏 ∈ V
5		vex 3443	. . . . . . . . . . . . 13 ⊢ 𝑐 ∈ V
6	4, 5	brcnv 5830	. . . . . . . . . . . 12 ⊢ (𝑏◡◡𝑅𝑐 ↔ 𝑐◡𝑅𝑏)
7		df-br 5098	. . . . . . . . . . . 12 ⊢ (𝑏◡◡𝑅𝑐 ↔ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅)
8	5, 4	brcnv 5830	. . . . . . . . . . . 12 ⊢ (𝑐◡𝑅𝑏 ↔ 𝑏𝑅𝑐)
9	6, 7, 8	3bitr3ri 302	. . . . . . . . . . 11 ⊢ (𝑏𝑅𝑐 ↔ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅)
10		vex 3443	. . . . . . . . . . . . 13 ⊢ 𝑎 ∈ V
11	4, 10	brcnv 5830	. . . . . . . . . . . 12 ⊢ (𝑏◡◡𝑅𝑎 ↔ 𝑎◡𝑅𝑏)
12		df-br 5098	. . . . . . . . . . . 12 ⊢ (𝑏◡◡𝑅𝑎 ↔ ⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅)
13	10, 4	brcnv 5830	. . . . . . . . . . . 12 ⊢ (𝑎◡𝑅𝑏 ↔ 𝑏𝑅𝑎)
14	11, 12, 13	3bitr3ri 302	. . . . . . . . . . 11 ⊢ (𝑏𝑅𝑎 ↔ ⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅)
15	9, 14	anbi12ci 630	. . . . . . . . . 10 ⊢ ((𝑏𝑅𝑐 ∧ 𝑏𝑅𝑎) ↔ (⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅))
16	15	imbi1i 349	. . . . . . . . 9 ⊢ (((𝑏𝑅𝑐 ∧ 𝑏𝑅𝑎) → 𝑎 = 𝑐) ↔ ((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐))
17	3, 16	bitr3i 277	. . . . . . . 8 ⊢ ((𝑏𝑅𝑐 → (𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ ((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐))
18	17	albii 1821	. . . . . . 7 ⊢ (∀𝑎(𝑏𝑅𝑐 → (𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ ∀𝑎((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐))
19	2, 18	bitr3i 277	. . . . . 6 ⊢ ((𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ ∀𝑎((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐))
20	19	albii 1821	. . . . 5 ⊢ (∀𝑐(𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ ∀𝑐∀𝑎((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐))
21		alcom 2165	. . . . 5 ⊢ (∀𝑐∀𝑎((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐) ↔ ∀𝑎∀𝑐((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐))
22	20, 21	bitri 275	. . . 4 ⊢ (∀𝑐(𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ ∀𝑎∀𝑐((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐))
23		opeq2 4829	. . . . . 6 ⊢ (𝑎 = 𝑐 → ⟨𝑏, 𝑎⟩ = ⟨𝑏, 𝑐⟩)
24	23	eleq1d 2820	. . . . 5 ⊢ (𝑎 = 𝑐 → (⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ↔ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅))
25	24	mo4 2565	. . . 4 ⊢ (∃*𝑎⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ↔ ∀𝑎∀𝑐((⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ∧ ⟨𝑏, 𝑐⟩ ∈ ◡◡𝑅) → 𝑎 = 𝑐))
26		dfmo 2539	. . . 4 ⊢ (∃*𝑎⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 ↔ ∃𝑐∀𝑎(⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 → 𝑎 = 𝑐))
27	22, 25, 26	3bitr2i 299	. . 3 ⊢ (∀𝑐(𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ ∃𝑐∀𝑎(⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 → 𝑎 = 𝑐))
28	27	albii 1821	. 2 ⊢ (∀𝑏∀𝑐(𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ ∀𝑏∃𝑐∀𝑎(⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 → 𝑎 = 𝑐))
29		relcnv 6062	. . . 4 ⊢ Rel ◡◡𝑅
30	29	biantrur 530	. . 3 ⊢ (∀𝑏∃𝑐∀𝑎(⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 → 𝑎 = 𝑐) ↔ (Rel ◡◡𝑅 ∧ ∀𝑏∃𝑐∀𝑎(⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 → 𝑎 = 𝑐)))
31		dffun5 6505	. . 3 ⊢ (Fun ◡◡𝑅 ↔ (Rel ◡◡𝑅 ∧ ∀𝑏∃𝑐∀𝑎(⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 → 𝑎 = 𝑐)))
32	30, 31	bitr4i 278	. 2 ⊢ (∀𝑏∃𝑐∀𝑎(⟨𝑏, 𝑎⟩ ∈ ◡◡𝑅 → 𝑎 = 𝑐) ↔ Fun ◡◡𝑅)
33	1, 28, 32	3bitri 297	1 ⊢ (∀𝑐∀𝑏(𝑏𝑅𝑐 → ∀𝑎(𝑏𝑅𝑎 → 𝑎 = 𝑐)) ↔ Fun ◡◡𝑅)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1540  ∃wex 1781   ∈ wcel 2114  ∃*wmo 2536  ⟨cop 4585   class class class wbr 5097  ^◡ccnv 5622  Rel wrel 5628  Fun wfun 6485

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2538  df-clab 2714  df-cleq 2727  df-clel 2810  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-ss 3917  df-nul 4285  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-fun 6493

This theorem is referenced by:  frege116  44257