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

Theorem invdisj 3918
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 2473 . . 3 𝑦𝑥𝐴𝑦𝐵 𝐶 = 𝑥
2 df-ral 2419 . . . . 5 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥 ↔ ∀𝑥(𝑥𝐴 → ∀𝑦𝐵 𝐶 = 𝑥))
3 rsp 2478 . . . . . . . . 9 (∀𝑦𝐵 𝐶 = 𝑥 → (𝑦𝐵𝐶 = 𝑥))
4 eqcom 2139 . . . . . . . . 9 (𝐶 = 𝑥𝑥 = 𝐶)
53, 4syl6ib 160 . . . . . . . 8 (∀𝑦𝐵 𝐶 = 𝑥 → (𝑦𝐵𝑥 = 𝐶))
65imim2i 12 . . . . . . 7 ((𝑥𝐴 → ∀𝑦𝐵 𝐶 = 𝑥) → (𝑥𝐴 → (𝑦𝐵𝑥 = 𝐶)))
76impd 252 . . . . . 6 ((𝑥𝐴 → ∀𝑦𝐵 𝐶 = 𝑥) → ((𝑥𝐴𝑦𝐵) → 𝑥 = 𝐶))
87alimi 1431 . . . . 5 (∀𝑥(𝑥𝐴 → ∀𝑦𝐵 𝐶 = 𝑥) → ∀𝑥((𝑥𝐴𝑦𝐵) → 𝑥 = 𝐶))
92, 8sylbi 120 . . . 4 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥 → ∀𝑥((𝑥𝐴𝑦𝐵) → 𝑥 = 𝐶))
10 mo2icl 2858 . . . 4 (∀𝑥((𝑥𝐴𝑦𝐵) → 𝑥 = 𝐶) → ∃*𝑥(𝑥𝐴𝑦𝐵))
119, 10syl 14 . . 3 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥 → ∃*𝑥(𝑥𝐴𝑦𝐵))
121, 11alrimi 1502 . 2 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥 → ∀𝑦∃*𝑥(𝑥𝐴𝑦𝐵))
13 dfdisj2 3903 . 2 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑦∃*𝑥(𝑥𝐴𝑦𝐵))
1412, 13sylibr 133 1 (∀𝑥𝐴𝑦𝐵 𝐶 = 𝑥Disj 𝑥𝐴 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wal 1329   = wceq 1331  wcel 1480  ∃*wmo 1998  wral 2414  Disj wdisj 3901
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rmo 2422  df-v 2683  df-disj 3902
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator