Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  fun11 GIF version

Theorem fun11 5198
 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 "Un2 (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
StepHypRef Expression
1 dfbi2 386 . . . . . . . 8 ((𝑥 = 𝑧𝑦 = 𝑤) ↔ ((𝑥 = 𝑧𝑦 = 𝑤) ∧ (𝑦 = 𝑤𝑥 = 𝑧)))
21imbi2i 225 . . . . . . 7 (((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ((𝑥𝐴𝑦𝑧𝐴𝑤) → ((𝑥 = 𝑧𝑦 = 𝑤) ∧ (𝑦 = 𝑤𝑥 = 𝑧))))
3 pm4.76 594 . . . . . . 7 ((((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ∧ ((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑦 = 𝑤𝑥 = 𝑧))) ↔ ((𝑥𝐴𝑦𝑧𝐴𝑤) → ((𝑥 = 𝑧𝑦 = 𝑤) ∧ (𝑦 = 𝑤𝑥 = 𝑧))))
4 bi2.04 247 . . . . . . . 8 (((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ (𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)))
5 bi2.04 247 . . . . . . . 8 (((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑦 = 𝑤𝑥 = 𝑧)) ↔ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧)))
64, 5anbi12i 456 . . . . . . 7 ((((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ∧ ((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑦 = 𝑤𝑥 = 𝑧))) ↔ ((𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))))
72, 3, 63bitr2i 207 . . . . . 6 (((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ((𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))))
872albii 1448 . . . . 5 (∀𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∀𝑥𝑦((𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))))
9 19.26-2 1459 . . . . 5 (∀𝑥𝑦((𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))) ↔ (∀𝑥𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ ∀𝑥𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))))
10 alcom 1455 . . . . . . 7 (∀𝑥𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)))
11 nfv 1509 . . . . . . . . 9 𝑥((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)
12 breq1 3940 . . . . . . . . . . 11 (𝑥 = 𝑧 → (𝑥𝐴𝑦𝑧𝐴𝑦))
1312anbi1d 461 . . . . . . . . . 10 (𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) ↔ (𝑧𝐴𝑦𝑧𝐴𝑤)))
1413imbi1d 230 . . . . . . . . 9 (𝑥 = 𝑧 → (((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)))
1511, 14equsal 1706 . . . . . . . 8 (∀𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
1615albii 1447 . . . . . . 7 (∀𝑦𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
1710, 16bitri 183 . . . . . 6 (∀𝑥𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
18 nfv 1509 . . . . . . . 8 𝑦((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)
19 breq2 3941 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝑥𝐴𝑦𝑥𝐴𝑤))
2019anbi1d 461 . . . . . . . . 9 (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) ↔ (𝑥𝐴𝑤𝑧𝐴𝑤)))
2120imbi1d 230 . . . . . . . 8 (𝑦 = 𝑤 → (((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
2218, 21equsal 1706 . . . . . . 7 (∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
2322albii 1447 . . . . . 6 (∀𝑥𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
2417, 23anbi12i 456 . . . . 5 ((∀𝑥𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ ∀𝑥𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))) ↔ (∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
258, 9, 243bitri 205 . . . 4 (∀𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ (∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
26252albii 1448 . . 3 (∀𝑧𝑤𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∀𝑧𝑤(∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
27 19.26-2 1459 . . 3 (∀𝑧𝑤(∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ (∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
2826, 27bitr2i 184 . 2 ((∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ∀𝑧𝑤𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)))
29 fun2cnv 5195 . . . 4 (Fun 𝐴 ↔ ∀𝑧∃*𝑦 𝑧𝐴𝑦)
30 breq2 3941 . . . . . 6 (𝑦 = 𝑤 → (𝑧𝐴𝑦𝑧𝐴𝑤))
3130mo4 2061 . . . . 5 (∃*𝑦 𝑧𝐴𝑦 ↔ ∀𝑦𝑤((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
3231albii 1447 . . . 4 (∀𝑧∃*𝑦 𝑧𝐴𝑦 ↔ ∀𝑧𝑦𝑤((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
33 alcom 1455 . . . . 5 (∀𝑦𝑤((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ∀𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
3433albii 1447 . . . 4 (∀𝑧𝑦𝑤((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
3529, 32, 343bitri 205 . . 3 (Fun 𝐴 ↔ ∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
36 funcnv2 5191 . . . 4 (Fun 𝐴 ↔ ∀𝑤∃*𝑥 𝑥𝐴𝑤)
37 breq1 3940 . . . . . 6 (𝑥 = 𝑧 → (𝑥𝐴𝑤𝑧𝐴𝑤))
3837mo4 2061 . . . . 5 (∃*𝑥 𝑥𝐴𝑤 ↔ ∀𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
3938albii 1447 . . . 4 (∀𝑤∃*𝑥 𝑥𝐴𝑤 ↔ ∀𝑤𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
40 alcom 1455 . . . . . 6 (∀𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
4140albii 1447 . . . . 5 (∀𝑤𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑤𝑧𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
42 alcom 1455 . . . . 5 (∀𝑤𝑧𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
4341, 42bitri 183 . . . 4 (∀𝑤𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
4436, 39, 433bitri 205 . . 3 (Fun 𝐴 ↔ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
4535, 44anbi12i 456 . 2 ((Fun 𝐴 ∧ Fun 𝐴) ↔ (∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
46 alrot4 1463 . 2 (∀𝑥𝑦𝑧𝑤((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∀𝑧𝑤𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)))
4728, 45, 463bitr4i 211 1 ((Fun 𝐴 ∧ Fun 𝐴) ↔ ∀𝑥𝑦𝑧𝑤((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1330  ∃*wmo 2001   class class class wbr 3937  ◡ccnv 4546  Fun wfun 5125 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938  df-opab 3998  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-fun 5133 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator