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

Theorem invdisj 3976
Description: If there is a function 𝐶(𝑦) such that 𝐶(𝑦) = 𝑥 for all 𝑦𝐵(𝑥), then the sets 𝐵(𝑥) for distinct 𝑥𝐴 are disjoint. (Contributed by Mario Carneiro, 10-Dec-2016.)
Assertion
Ref Expression
invdisj (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥Disj 𝑥𝐴 𝐵)
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑦,𝐵   𝑥,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑦)

Proof of Theorem invdisj
StepHypRef Expression
1 nfra2xy 2508 . . 3 𝑦𝑥𝐴𝑦𝐵 𝐶 = 𝑥
2 df-ral 2449 . . . . 5 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥 ↔ ∀𝑥(𝑥𝐴 → ∀𝑦𝐵 𝐶 = 𝑥))
3 rsp 2513 . . . . . . . . 9 (∀𝑦𝐵 𝐶 = 𝑥 → (𝑦𝐵𝐶 = 𝑥))
4 eqcom 2167 . . . . . . . . 9 (𝐶 = 𝑥𝑥 = 𝐶)
53, 4syl6ib 160 . . . . . . . 8 (∀𝑦𝐵 𝐶 = 𝑥 → (𝑦𝐵𝑥 = 𝐶))
65imim2i 12 . . . . . . 7 ((𝑥𝐴 → ∀𝑦𝐵 𝐶 = 𝑥) → (𝑥𝐴 → (𝑦𝐵𝑥 = 𝐶)))
76impd 252 . . . . . 6 ((𝑥𝐴 → ∀𝑦𝐵 𝐶 = 𝑥) → ((𝑥𝐴𝑦𝐵) → 𝑥 = 𝐶))
87alimi 1443 . . . . 5 (∀𝑥(𝑥𝐴 → ∀𝑦𝐵 𝐶 = 𝑥) → ∀𝑥((𝑥𝐴𝑦𝐵) → 𝑥 = 𝐶))
92, 8sylbi 120 . . . 4 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥 → ∀𝑥((𝑥𝐴𝑦𝐵) → 𝑥 = 𝐶))
10 mo2icl 2905 . . . 4 (∀𝑥((𝑥𝐴𝑦𝐵) → 𝑥 = 𝐶) → ∃*𝑥(𝑥𝐴𝑦𝐵))
119, 10syl 14 . . 3 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥 → ∃*𝑥(𝑥𝐴𝑦𝐵))
121, 11alrimi 1510 . 2 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥 → ∀𝑦∃*𝑥(𝑥𝐴𝑦𝐵))
13 dfdisj2 3961 . 2 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑦∃*𝑥(𝑥𝐴𝑦𝐵))
1412, 13sylibr 133 1 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥Disj 𝑥𝐴 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wal 1341   = wceq 1343  ∃*wmo 2015  wcel 2136  wral 2444  Disj wdisj 3959
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 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rmo 2452  df-v 2728  df-disj 3960
This theorem is referenced by:  phisum  12172
  Copyright terms: Public domain W3C validator