Theorem fun11 6599

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 479	. . . . . . . 8 ⊢ ((𝑥 = 𝑧 ↔ 𝑦 = 𝑤) ↔ ((𝑥 = 𝑧 → 𝑦 = 𝑤) ∧ (𝑦 = 𝑤 → 𝑥 = 𝑧)))
2	1	imbi2i 339	. . . . . . 7 ⊢ (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → ((𝑥 = 𝑧 → 𝑦 = 𝑤) ∧ (𝑦 = 𝑤 → 𝑥 = 𝑧))))
3		pm4.76 527	. . . . . . 7 ⊢ ((((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 → 𝑦 = 𝑤)) ∧ ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑦 = 𝑤 → 𝑥 = 𝑧))) ↔ ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → ((𝑥 = 𝑧 → 𝑦 = 𝑤) ∧ (𝑦 = 𝑤 → 𝑥 = 𝑧))))
4		bi2.04 391	. . . . . . . 8 ⊢ (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 → 𝑦 = 𝑤)) ↔ (𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)))
5		bi2.04 391	. . . . . . . 8 ⊢ (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑦 = 𝑤 → 𝑥 = 𝑧)) ↔ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
6	4, 5	anbi12i 639	. . . . . . 7 ⊢ ((((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 → 𝑦 = 𝑤)) ∧ ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑦 = 𝑤 → 𝑥 = 𝑧))) ↔ ((𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))))
7	2, 3, 6	3bitr2i 302	. . . . . 6 ⊢ (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ((𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))))
8	7	2albii 1843	. . . . 5 ⊢ (∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ∀𝑥∀𝑦((𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))))
9		19.26-2 1894	. . . . 5 ⊢ (∀𝑥∀𝑦((𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))) ↔ (∀𝑥∀𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ ∀𝑥∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))))
10		alcom 2196	. . . . . . 7 ⊢ (∀𝑥∀𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦∀𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)))
11		breq1 5107	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (𝑥𝐴𝑦 ↔ 𝑧𝐴𝑦))
12	11	anbi1d 642	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) ↔ (𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤)))
13	12	imbi1d 344	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)))
14	13	equsalvw 2027	. . . . . . . 8 ⊢ (∀𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
15	14	albii 1842	. . . . . . 7 ⊢ (∀𝑦∀𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
16	10, 15	bitri 278	. . . . . 6 ⊢ (∀𝑥∀𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
17		breq2 5108	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (𝑥𝐴𝑦 ↔ 𝑥𝐴𝑤))
18	17	anbi1d 642	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) ↔ (𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤)))
19	18	imbi1d 344	. . . . . . . 8 ⊢ (𝑦 = 𝑤 → (((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
20	19	equsalvw 2027	. . . . . . 7 ⊢ (∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
21	20	albii 1842	. . . . . 6 ⊢ (∀𝑥∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
22	16, 21	anbi12i 639	. . . . 5 ⊢ ((∀𝑥∀𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ ∀𝑥∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))) ↔ (∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
23	8, 9, 22	3bitri 300	. . . 4 ⊢ (∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ (∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
24	23	2albii 1843	. . 3 ⊢ (∀𝑧∀𝑤∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ∀𝑧∀𝑤(∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
25		19.26-2 1894	. . 3 ⊢ (∀𝑧∀𝑤(∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ (∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
26	24, 25	bitr2i 279	. 2 ⊢ ((∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ∀𝑧∀𝑤∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)))
27		fun2cnv 6596	. . . 4 ⊢ (Fun ◡◡𝐴 ↔ ∀𝑧∃*𝑦 𝑧𝐴𝑦)
28		breq2 5108	. . . . . 6 ⊢ (𝑦 = 𝑤 → (𝑧𝐴𝑦 ↔ 𝑧𝐴𝑤))
29	28	mo4 2596	. . . . 5 ⊢ (∃*𝑦 𝑧𝐴𝑦 ↔ ∀𝑦∀𝑤((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
30	29	albii 1842	. . . 4 ⊢ (∀𝑧∃*𝑦 𝑧𝐴𝑦 ↔ ∀𝑧∀𝑦∀𝑤((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
31		alcom 2196	. . . . 5 ⊢ (∀𝑦∀𝑤((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
32	31	albii 1842	. . . 4 ⊢ (∀𝑧∀𝑦∀𝑤((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
33	27, 30, 32	3bitri 300	. . 3 ⊢ (Fun ◡◡𝐴 ↔ ∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤))
34		funcnv2 6593	. . . 4 ⊢ (Fun ◡𝐴 ↔ ∀𝑤∃*𝑥 𝑥𝐴𝑤)
35		breq1 5107	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑥𝐴𝑤 ↔ 𝑧𝐴𝑤))
36	35	mo4 2596	. . . . 5 ⊢ (∃*𝑥 𝑥𝐴𝑤 ↔ ∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
37	36	albii 1842	. . . 4 ⊢ (∀𝑤∃*𝑥 𝑥𝐴𝑤 ↔ ∀𝑤∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
38		alcom 2196	. . . . . 6 ⊢ (∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
39	38	albii 1842	. . . . 5 ⊢ (∀𝑤∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑤∀𝑧∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
40		alcom 2196	. . . . 5 ⊢ (∀𝑤∀𝑧∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
41	39, 40	bitri 278	. . . 4 ⊢ (∀𝑤∀𝑥∀𝑧((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
42	34, 37, 41	3bitri 300	. . 3 ⊢ (Fun ◡𝐴 ↔ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧))
43	33, 42	anbi12i 639	. 2 ⊢ ((Fun ◡◡𝐴 ∧ Fun ◡𝐴) ↔ (∀𝑧∀𝑤∀𝑦((𝑧𝐴𝑦 ∧ 𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧∀𝑤∀𝑥((𝑥𝐴𝑤 ∧ 𝑧𝐴𝑤) → 𝑥 = 𝑧)))
44		alrot4 2198	. 2 ⊢ (∀𝑥∀𝑦∀𝑧∀𝑤((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)) ↔ ∀𝑧∀𝑤∀𝑥∀𝑦((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)))
45	26, 43, 44	3bitr4i 306	1 ⊢ ((Fun ◡◡𝐴 ∧ Fun ◡𝐴) ↔ ∀𝑥∀𝑦∀𝑧∀𝑤((𝑥𝐴𝑦 ∧ 𝑧𝐴𝑤) → (𝑥 = 𝑧 ↔ 𝑦 = 𝑤)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1561  ∃*wmo 2567   class class class wbr 5104  ^◡ccnv 5650  Fun wfun 6519

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2737  ax-sep 5250  ax-pr 5394

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-mo 2569  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5105  df-opab 5167  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-fun 6527

This theorem is referenced by: (None)