Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  disjdsct Structured version   Visualization version   GIF version

Theorem disjdsct 29820
 Description: A disjoint collection is distinct, i.e. each set in this collection is different of all others, provided that it does not contain the empty set This can be expressed as "the converse of the mapping function is a function", or "the mapping function is single-rooted". (Cf. funcnv 6098) (Contributed by Thierry Arnoux, 28-Feb-2017.)
Hypotheses
Ref Expression
disjdsct.0 𝑥𝜑
disjdsct.1 𝑥𝐴
disjdsct.2 ((𝜑𝑥𝐴) → 𝐵 ∈ (𝑉 ∖ {∅}))
disjdsct.3 (𝜑Disj 𝑥𝐴 𝐵)
Assertion
Ref Expression
disjdsct (𝜑 → Fun (𝑥𝐴𝐵))
Distinct variable group:   𝑥,𝑉
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem disjdsct
Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 disjdsct.3 . . . . . . . 8 (𝜑Disj 𝑥𝐴 𝐵)
2 disjdsct.1 . . . . . . . . 9 𝑥𝐴
32disjorsf 29731 . . . . . . . 8 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑖𝐴𝑗𝐴 (𝑖 = 𝑗 ∨ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅))
41, 3sylib 208 . . . . . . 7 (𝜑 → ∀𝑖𝐴𝑗𝐴 (𝑖 = 𝑗 ∨ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅))
54r19.21bi 3081 . . . . . 6 ((𝜑𝑖𝐴) → ∀𝑗𝐴 (𝑖 = 𝑗 ∨ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅))
65r19.21bi 3081 . . . . 5 (((𝜑𝑖𝐴) ∧ 𝑗𝐴) → (𝑖 = 𝑗 ∨ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅))
7 simpr3 1237 . . . . . . . . 9 ((𝜑 ∧ (𝑖𝐴𝑗𝐴 ∧ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅)) → (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅)
8 disjdsct.2 . . . . . . . . . . . . 13 ((𝜑𝑥𝐴) → 𝐵 ∈ (𝑉 ∖ {∅}))
9 eldifsni 4457 . . . . . . . . . . . . 13 (𝐵 ∈ (𝑉 ∖ {∅}) → 𝐵 ≠ ∅)
108, 9syl 17 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → 𝐵 ≠ ∅)
1110sbimi 2055 . . . . . . . . . . 11 ([𝑖 / 𝑥](𝜑𝑥𝐴) → [𝑖 / 𝑥]𝐵 ≠ ∅)
12 sban 2546 . . . . . . . . . . . 12 ([𝑖 / 𝑥](𝜑𝑥𝐴) ↔ ([𝑖 / 𝑥]𝜑 ∧ [𝑖 / 𝑥]𝑥𝐴))
13 disjdsct.0 . . . . . . . . . . . . . 14 𝑥𝜑
1413sbf 2527 . . . . . . . . . . . . 13 ([𝑖 / 𝑥]𝜑𝜑)
152clelsb3f 2917 . . . . . . . . . . . . 13 ([𝑖 / 𝑥]𝑥𝐴𝑖𝐴)
1614, 15anbi12i 612 . . . . . . . . . . . 12 (([𝑖 / 𝑥]𝜑 ∧ [𝑖 / 𝑥]𝑥𝐴) ↔ (𝜑𝑖𝐴))
1712, 16bitri 264 . . . . . . . . . . 11 ([𝑖 / 𝑥](𝜑𝑥𝐴) ↔ (𝜑𝑖𝐴))
18 sbsbc 3591 . . . . . . . . . . . 12 ([𝑖 / 𝑥]𝐵 ≠ ∅ ↔ [𝑖 / 𝑥]𝐵 ≠ ∅)
19 sbcne12 4130 . . . . . . . . . . . 12 ([𝑖 / 𝑥]𝐵 ≠ ∅ ↔ 𝑖 / 𝑥𝐵𝑖 / 𝑥∅)
20 csb0 4126 . . . . . . . . . . . . 13 𝑖 / 𝑥∅ = ∅
2120neeq2i 3008 . . . . . . . . . . . 12 (𝑖 / 𝑥𝐵𝑖 / 𝑥∅ ↔ 𝑖 / 𝑥𝐵 ≠ ∅)
2218, 19, 213bitri 286 . . . . . . . . . . 11 ([𝑖 / 𝑥]𝐵 ≠ ∅ ↔ 𝑖 / 𝑥𝐵 ≠ ∅)
2311, 17, 223imtr3i 280 . . . . . . . . . 10 ((𝜑𝑖𝐴) → 𝑖 / 𝑥𝐵 ≠ ∅)
24233ad2antr1 1203 . . . . . . . . 9 ((𝜑 ∧ (𝑖𝐴𝑗𝐴 ∧ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅)) → 𝑖 / 𝑥𝐵 ≠ ∅)
25 disj3 4164 . . . . . . . . . . . . 13 ((𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅ ↔ 𝑖 / 𝑥𝐵 = (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵))
2625biimpi 206 . . . . . . . . . . . 12 ((𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅ → 𝑖 / 𝑥𝐵 = (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵))
2726neeq1d 3002 . . . . . . . . . . 11 ((𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅ → (𝑖 / 𝑥𝐵 ≠ ∅ ↔ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) ≠ ∅))
2827biimpa 462 . . . . . . . . . 10 (((𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅ ∧ 𝑖 / 𝑥𝐵 ≠ ∅) → (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) ≠ ∅)
29 difn0 4090 . . . . . . . . . 10 ((𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) ≠ ∅ → 𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵)
3028, 29syl 17 . . . . . . . . 9 (((𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅ ∧ 𝑖 / 𝑥𝐵 ≠ ∅) → 𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵)
317, 24, 30syl2anc 573 . . . . . . . 8 ((𝜑 ∧ (𝑖𝐴𝑗𝐴 ∧ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅)) → 𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵)
32313anassrs 1453 . . . . . . 7 ((((𝜑𝑖𝐴) ∧ 𝑗𝐴) ∧ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅) → 𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵)
3332ex 397 . . . . . 6 (((𝜑𝑖𝐴) ∧ 𝑗𝐴) → ((𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅ → 𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵))
3433orim2d 947 . . . . 5 (((𝜑𝑖𝐴) ∧ 𝑗𝐴) → ((𝑖 = 𝑗 ∨ (𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵) = ∅) → (𝑖 = 𝑗𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵)))
356, 34mpd 15 . . . 4 (((𝜑𝑖𝐴) ∧ 𝑗𝐴) → (𝑖 = 𝑗𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵))
3635ralrimiva 3115 . . 3 ((𝜑𝑖𝐴) → ∀𝑗𝐴 (𝑖 = 𝑗𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵))
3736ralrimiva 3115 . 2 (𝜑 → ∀𝑖𝐴𝑗𝐴 (𝑖 = 𝑗𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵))
38 nfmpt1 4881 . . 3 𝑥(𝑥𝐴𝐵)
39 eqid 2771 . . 3 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
4013, 2, 38, 39, 8funcnv4mpt 29810 . 2 (𝜑 → (Fun (𝑥𝐴𝐵) ↔ ∀𝑖𝐴𝑗𝐴 (𝑖 = 𝑗𝑖 / 𝑥𝐵𝑗 / 𝑥𝐵)))
4137, 40mpbird 247 1 (𝜑 → Fun (𝑥𝐴𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 382   ∨ wo 834   ∧ w3a 1071   = wceq 1631  Ⅎwnf 1856  [wsb 2049   ∈ wcel 2145  Ⅎwnfc 2900   ≠ wne 2943  ∀wral 3061  [wsbc 3587  ⦋csb 3682   ∖ cdif 3720   ∩ cin 3722  ∅c0 4063  {csn 4316  Disj wdisj 4754   ↦ cmpt 4863  ◡ccnv 5248  Fun wfun 6025 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3an 1073  df-tru 1634  df-fal 1637  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-rmo 3069  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-uni 4575  df-disj 4755  df-br 4787  df-opab 4847  df-mpt 4864  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-fv 6039 This theorem is referenced by:  esumrnmpt  30454  measvunilem  30615
 Copyright terms: Public domain W3C validator