Theorem fun11 6615

Description: Two ways of stating that 𝐴 is one-to-one (but not necessarily a function). Each side is equivalent to Definition 6.4(3) of [TakeutiZaring] p. 24, who use the notation "Un₂ (A)" for one-to-one (but not necessarily a function). (Contributed by NM, 17-Jan-2006.)

Assertion

Ref	Expression
fun11	⊢ ((Fun ◡◡𝐴 ∧ Fun ◡𝐴) ↔ ∀𝑥∀𝑦∀𝑧∀𝑤((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)))

Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝐴

Proof of Theorem fun11

Step	Hyp	Ref	Expression
1		dfbi2 474	. . . . . . . 8 ⊢ ((𝑥 = 𝑧 ↔ 𝑦 = 𝑤) ↔ ((𝑥 = 𝑧 → 𝑦 = 𝑤) ∧ (𝑦 = 𝑤 → 𝑥 = 𝑧)))
2	1	imbi2i 336	. . . . . . 7 ⊢ (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → ((𝑥 = 𝑧 → 𝑦 = 𝑤) ∧ (𝑦 = 𝑤 → 𝑥 = 𝑧))))
3		pm4.76 518	. . . . . . 7 ⊢ ((((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 → 𝑦 = 𝑤)) ∧ ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑦 = 𝑤 → 𝑥 = 𝑧))) ↔ ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → ((𝑥 = 𝑧 → 𝑦 = 𝑤) ∧ (𝑦 = 𝑤 → 𝑥 = 𝑧))))
4		bi2.04 387	. . . . . . . 8 ⊢ (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 → 𝑦 = 𝑤)) ↔ (𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)))
5		bi2.04 387	. . . . . . . 8 ⊢ (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑦 = 𝑤 → 𝑥 = 𝑧)) ↔ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
6	4, 5	anbi12i 628	. . . . . . 7 ⊢ ((((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 → 𝑦 = 𝑤)) ∧ ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑦 = 𝑤 → 𝑥 = 𝑧))) ↔ ((𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))))
7	2, 3, 6	3bitr2i 299	. . . . . 6 ⊢ (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ((𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))))
8	7	2albii 1820	. . . . 5 ⊢ (∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ∀𝑥∀𝑦((𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))))
9		19.26-2 1871	. . . . 5 ⊢ (∀𝑥∀𝑦((𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))) ↔ (∀𝑥∀𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ ∀𝑥∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))))
10		alcom 2160	. . . . . . 7 ⊢ (∀𝑥∀𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦∀𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)))
11		breq1 5127	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (𝑥𝐴𝑦 ↔ 𝑧𝐴𝑦))
12	11	anbi1d 631	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) ↔ (𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤)))
13	12	imbi1d 341	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)))
14	13	equsalvw 2004	. . . . . . . 8 ⊢ (∀𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
15	14	albii 1819	. . . . . . 7 ⊢ (∀𝑦∀𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
16	10, 15	bitri 275	. . . . . 6 ⊢ (∀𝑥∀𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
17		breq2 5128	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (𝑥𝐴𝑦 ↔ 𝑥𝐴𝑤))
18	17	anbi1d 631	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) ↔ (𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤)))
19	18	imbi1d 341	. . . . . . . 8 ⊢ (𝑦 = 𝑤 → (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
20	19	equsalvw 2004	. . . . . . 7 ⊢ (∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
21	20	albii 1819	. . . . . 6 ⊢ (∀𝑥∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
22	16, 21	anbi12i 628	. . . . 5 ⊢ ((∀𝑥∀𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ ∀𝑥∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))) ↔ (∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
23	8, 9, 22	3bitri 297	. . . 4 ⊢ (∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ (∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
24	23	2albii 1820	. . 3 ⊢ (∀𝑧∀𝑤∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ∀𝑧∀𝑤(∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
25		19.26-2 1871	. . 3 ⊢ (∀𝑧∀𝑤(∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ (∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
26	24, 25	bitr2i 276	. 2 ⊢ ((∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ∀𝑧∀𝑤∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)))
27		fun2cnv 6612	. . . 4 ⊢ (Fun ◡◡𝐴 ↔ ∀𝑧∃*𝑦 𝑧𝐴𝑦)
28		breq2 5128	. . . . . 6 ⊢ (𝑦 = 𝑤 → (𝑧𝐴𝑦 ↔ 𝑧𝐴𝑤))
29	28	mo4 2566	. . . . 5 ⊢ (∃*𝑦 𝑧𝐴𝑦 ↔ ∀𝑦∀𝑤((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
30	29	albii 1819	. . . 4 ⊢ (∀𝑧∃*𝑦 𝑧𝐴𝑦 ↔ ∀𝑧∀𝑦∀𝑤((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
31		alcom 2160	. . . . 5 ⊢ (∀𝑦∀𝑤((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
32	31	albii 1819	. . . 4 ⊢ (∀𝑧∀𝑦∀𝑤((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
33	27, 30, 32	3bitri 297	. . 3 ⊢ (Fun ◡◡𝐴 ↔ ∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
34		funcnv2 6609	. . . 4 ⊢ (Fun ◡𝐴 ↔ ∀𝑤∃*𝑥 𝑥𝐴𝑤)
35		breq1 5127	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑥𝐴𝑤 ↔ 𝑧𝐴𝑤))
36	35	mo4 2566	. . . . 5 ⊢ (∃*𝑥 𝑥𝐴𝑤 ↔ ∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
37	36	albii 1819	. . . 4 ⊢ (∀𝑤∃*𝑥 𝑥𝐴𝑤 ↔ ∀𝑤∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
38		alcom 2160	. . . . . 6 ⊢ (∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
39	38	albii 1819	. . . . 5 ⊢ (∀𝑤∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑤∀𝑧∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
40		alcom 2160	. . . . 5 ⊢ (∀𝑤∀𝑧∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
41	39, 40	bitri 275	. . . 4 ⊢ (∀𝑤∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
42	34, 37, 41	3bitri 297	. . 3 ⊢ (Fun ◡𝐴 ↔ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
43	33, 42	anbi12i 628	. 2 ⊢ ((Fun ◡◡𝐴 ∧ Fun ◡𝐴) ↔ (∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
44		alrot4 2162	. 2 ⊢ (∀𝑥∀𝑦∀𝑧∀𝑤((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ∀𝑧∀𝑤∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)))
45	26, 43, 44	3bitr4i 303	1 ⊢ ((Fun ◡◡𝐴 ∧ Fun ◡𝐴) ↔ ∀𝑥∀𝑦∀𝑧∀𝑤((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1538  ∃*wmo 2538   class class class wbr 5124  ^◡ccnv 5658  Fun wfun 6530

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-11 2158  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-mo 2540  df-clab 2715  df-cleq 2728  df-clel 2810  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-br 5125  df-opab 5187  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-fun 6538

This theorem is referenced by: (None)