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

Theorem fun11 5279
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 388 . . . . . . . 8 ((𝑥 = 𝑧𝑦 = 𝑤) ↔ ((𝑥 = 𝑧𝑦 = 𝑤) ∧ (𝑦 = 𝑤𝑥 = 𝑧)))
21imbi2i 226 . . . . . . 7 (((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ((𝑥𝐴𝑦𝑧𝐴𝑤) → ((𝑥 = 𝑧𝑦 = 𝑤) ∧ (𝑦 = 𝑤𝑥 = 𝑧))))
3 pm4.76 604 . . . . . . 7 ((((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ∧ ((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑦 = 𝑤𝑥 = 𝑧))) ↔ ((𝑥𝐴𝑦𝑧𝐴𝑤) → ((𝑥 = 𝑧𝑦 = 𝑤) ∧ (𝑦 = 𝑤𝑥 = 𝑧))))
4 bi2.04 248 . . . . . . . 8 (((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ (𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)))
5 bi2.04 248 . . . . . . . 8 (((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑦 = 𝑤𝑥 = 𝑧)) ↔ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧)))
64, 5anbi12i 460 . . . . . . 7 ((((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ∧ ((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑦 = 𝑤𝑥 = 𝑧))) ↔ ((𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))))
72, 3, 63bitr2i 208 . . . . . 6 (((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ((𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))))
872albii 1471 . . . . 5 (∀𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∀𝑥𝑦((𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))))
9 19.26-2 1482 . . . . 5 (∀𝑥𝑦((𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))) ↔ (∀𝑥𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ ∀𝑥𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))))
10 alcom 1478 . . . . . . 7 (∀𝑥𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)))
11 nfv 1528 . . . . . . . . 9 𝑥((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)
12 breq1 4003 . . . . . . . . . . 11 (𝑥 = 𝑧 → (𝑥𝐴𝑦𝑧𝐴𝑦))
1312anbi1d 465 . . . . . . . . . 10 (𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) ↔ (𝑧𝐴𝑦𝑧𝐴𝑤)))
1413imbi1d 231 . . . . . . . . 9 (𝑥 = 𝑧 → (((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)))
1511, 14equsal 1727 . . . . . . . 8 (∀𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
1615albii 1470 . . . . . . 7 (∀𝑦𝑥(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
1710, 16bitri 184 . . . . . 6 (∀𝑥𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ↔ ∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
18 nfv 1528 . . . . . . . 8 𝑦((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)
19 breq2 4004 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝑥𝐴𝑦𝑥𝐴𝑤))
2019anbi1d 465 . . . . . . . . 9 (𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) ↔ (𝑥𝐴𝑤𝑧𝐴𝑤)))
2120imbi1d 231 . . . . . . . 8 (𝑦 = 𝑤 → (((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
2218, 21equsal 1727 . . . . . . 7 (∀𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
2322albii 1470 . . . . . 6 (∀𝑥𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
2417, 23anbi12i 460 . . . . 5 ((∀𝑥𝑦(𝑥 = 𝑧 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤)) ∧ ∀𝑥𝑦(𝑦 = 𝑤 → ((𝑥𝐴𝑦𝑧𝐴𝑤) → 𝑥 = 𝑧))) ↔ (∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
258, 9, 243bitri 206 . . . 4 (∀𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ (∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
26252albii 1471 . . 3 (∀𝑧𝑤𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∀𝑧𝑤(∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
27 19.26-2 1482 . . 3 (∀𝑧𝑤(∀𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ (∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
2826, 27bitr2i 185 . 2 ((∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)) ↔ ∀𝑧𝑤𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)))
29 fun2cnv 5276 . . . 4 (Fun 𝐴 ↔ ∀𝑧∃*𝑦 𝑧𝐴𝑦)
30 breq2 4004 . . . . . 6 (𝑦 = 𝑤 → (𝑧𝐴𝑦𝑧𝐴𝑤))
3130mo4 2087 . . . . 5 (∃*𝑦 𝑧𝐴𝑦 ↔ ∀𝑦𝑤((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
3231albii 1470 . . . 4 (∀𝑧∃*𝑦 𝑧𝐴𝑦 ↔ ∀𝑧𝑦𝑤((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
33 alcom 1478 . . . . 5 (∀𝑦𝑤((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ∀𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
3433albii 1470 . . . 4 (∀𝑧𝑦𝑤((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ↔ ∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
3529, 32, 343bitri 206 . . 3 (Fun 𝐴 ↔ ∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤))
36 funcnv2 5272 . . . 4 (Fun 𝐴 ↔ ∀𝑤∃*𝑥 𝑥𝐴𝑤)
37 breq1 4003 . . . . . 6 (𝑥 = 𝑧 → (𝑥𝐴𝑤𝑧𝐴𝑤))
3837mo4 2087 . . . . 5 (∃*𝑥 𝑥𝐴𝑤 ↔ ∀𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
3938albii 1470 . . . 4 (∀𝑤∃*𝑥 𝑥𝐴𝑤 ↔ ∀𝑤𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
40 alcom 1478 . . . . . 6 (∀𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
4140albii 1470 . . . . 5 (∀𝑤𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑤𝑧𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
42 alcom 1478 . . . . 5 (∀𝑤𝑧𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
4341, 42bitri 184 . . . 4 (∀𝑤𝑥𝑧((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧) ↔ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
4436, 39, 433bitri 206 . . 3 (Fun 𝐴 ↔ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧))
4535, 44anbi12i 460 . 2 ((Fun 𝐴 ∧ Fun 𝐴) ↔ (∀𝑧𝑤𝑦((𝑧𝐴𝑦𝑧𝐴𝑤) → 𝑦 = 𝑤) ∧ ∀𝑧𝑤𝑥((𝑥𝐴𝑤𝑧𝐴𝑤) → 𝑥 = 𝑧)))
46 alrot4 1486 . 2 (∀𝑥𝑦𝑧𝑤((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)) ↔ ∀𝑧𝑤𝑥𝑦((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)))
4728, 45, 463bitr4i 212 1 ((Fun 𝐴 ∧ Fun 𝐴) ↔ ∀𝑥𝑦𝑧𝑤((𝑥𝐴𝑦𝑧𝐴𝑤) → (𝑥 = 𝑧𝑦 = 𝑤)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wal 1351  ∃*wmo 2027   class class class wbr 4000  ccnv 4622  Fun wfun 5206
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-br 4001  df-opab 4062  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-fun 5214
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator