MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  djuun Structured version   Visualization version   GIF version

Theorem djuun 9877
Description: The disjoint union of two classes is the union of the images of those two classes under right and left injection. (Contributed by Jim Kingdon, 22-Jun-2022.)
Assertion
Ref Expression
djuun ((inl “ 𝐴) ∪ (inr “ 𝐵)) = (𝐴𝐵)

Proof of Theorem djuun
Dummy variables 𝑥 𝑦 𝑢 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elun 4104 . . . 4 (𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)) ↔ (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
2 djulf1o 9863 . . . . . . . . . . 11 inl:V–1-1-onto→({∅} × V)
3 f1ofn 6801 . . . . . . . . . . 11 (inl:V–1-1-onto→({∅} × V) → inl Fn V)
42, 3ax-mp 5 . . . . . . . . . 10 inl Fn V
5 ssv 3958 . . . . . . . . . 10 𝐴 ⊆ V
6 fvelimab 6933 . . . . . . . . . 10 ((inl Fn V ∧ 𝐴 ⊆ V) → (𝑥 ∈ (inl “ 𝐴) ↔ ∃𝑢𝐴 (inl‘𝑢) = 𝑥))
74, 5, 6mp2an 702 . . . . . . . . 9 (𝑥 ∈ (inl “ 𝐴) ↔ ∃𝑢𝐴 (inl‘𝑢) = 𝑥)
87biimpi 218 . . . . . . . 8 (𝑥 ∈ (inl “ 𝐴) → ∃𝑢𝐴 (inl‘𝑢) = 𝑥)
9 simprr 782 . . . . . . . . 9 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢𝐴 ∧ (inl‘𝑢) = 𝑥)) → (inl‘𝑢) = 𝑥)
10 vex 3457 . . . . . . . . . . 11 𝑢 ∈ V
11 opex 5428 . . . . . . . . . . 11 ⟨∅, 𝑢⟩ ∈ V
12 opeq2 4829 . . . . . . . . . . . 12 (𝑧 = 𝑢 → ⟨∅, 𝑧⟩ = ⟨∅, 𝑢⟩)
13 df-inl 9853 . . . . . . . . . . . 12 inl = (𝑧 ∈ V ↦ ⟨∅, 𝑧⟩)
1412, 13fvmptg 6967 . . . . . . . . . . 11 ((𝑢 ∈ V ∧ ⟨∅, 𝑢⟩ ∈ V) → (inl‘𝑢) = ⟨∅, 𝑢⟩)
1510, 11, 14mp2an 702 . . . . . . . . . 10 (inl‘𝑢) = ⟨∅, 𝑢
16 0ex 5254 . . . . . . . . . . . . 13 ∅ ∈ V
1716snid 4618 . . . . . . . . . . . 12 ∅ ∈ {∅}
18 opelxpi 5680 . . . . . . . . . . . 12 ((∅ ∈ {∅} ∧ 𝑢𝐴) → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
1917, 18mpan 700 . . . . . . . . . . 11 (𝑢𝐴 → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
2019ad2antrl 738 . . . . . . . . . 10 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢𝐴 ∧ (inl‘𝑢) = 𝑥)) → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
2115, 20eqeltrid 2865 . . . . . . . . 9 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢𝐴 ∧ (inl‘𝑢) = 𝑥)) → (inl‘𝑢) ∈ ({∅} × 𝐴))
229, 21eqeltrrd 2862 . . . . . . . 8 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢𝐴 ∧ (inl‘𝑢) = 𝑥)) → 𝑥 ∈ ({∅} × 𝐴))
238, 22rexlimddv 3168 . . . . . . 7 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ ({∅} × 𝐴))
24 elun1 4132 . . . . . . 7 (𝑥 ∈ ({∅} × 𝐴) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
2523, 24syl 17 . . . . . 6 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
26 df-dju 9852 . . . . . 6 (𝐴𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
2725, 26eleqtrrdi 2872 . . . . 5 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ (𝐴𝐵))
28 djurf1o 9864 . . . . . . . . . . 11 inr:V–1-1-onto→({1o} × V)
29 f1ofn 6801 . . . . . . . . . . 11 (inr:V–1-1-onto→({1o} × V) → inr Fn V)
3028, 29ax-mp 5 . . . . . . . . . 10 inr Fn V
31 ssv 3958 . . . . . . . . . 10 𝐵 ⊆ V
32 fvelimab 6933 . . . . . . . . . 10 ((inr Fn V ∧ 𝐵 ⊆ V) → (𝑥 ∈ (inr “ 𝐵) ↔ ∃𝑢𝐵 (inr‘𝑢) = 𝑥))
3330, 31, 32mp2an 702 . . . . . . . . 9 (𝑥 ∈ (inr “ 𝐵) ↔ ∃𝑢𝐵 (inr‘𝑢) = 𝑥)
3433biimpi 218 . . . . . . . 8 (𝑥 ∈ (inr “ 𝐵) → ∃𝑢𝐵 (inr‘𝑢) = 𝑥)
35 simprr 782 . . . . . . . . 9 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢𝐵 ∧ (inr‘𝑢) = 𝑥)) → (inr‘𝑢) = 𝑥)
36 opex 5428 . . . . . . . . . . 11 ⟨1o, 𝑢⟩ ∈ V
37 opeq2 4829 . . . . . . . . . . . 12 (𝑧 = 𝑢 → ⟨1o, 𝑧⟩ = ⟨1o, 𝑢⟩)
38 df-inr 9854 . . . . . . . . . . . 12 inr = (𝑧 ∈ V ↦ ⟨1o, 𝑧⟩)
3937, 38fvmptg 6967 . . . . . . . . . . 11 ((𝑢 ∈ V ∧ ⟨1o, 𝑢⟩ ∈ V) → (inr‘𝑢) = ⟨1o, 𝑢⟩)
4010, 36, 39mp2an 702 . . . . . . . . . 10 (inr‘𝑢) = ⟨1o, 𝑢
41 1oex 8440 . . . . . . . . . . . . 13 1o ∈ V
4241snid 4618 . . . . . . . . . . . 12 1o ∈ {1o}
43 opelxpi 5680 . . . . . . . . . . . 12 ((1o ∈ {1o} ∧ 𝑢𝐵) → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4442, 43mpan 700 . . . . . . . . . . 11 (𝑢𝐵 → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4544ad2antrl 738 . . . . . . . . . 10 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢𝐵 ∧ (inr‘𝑢) = 𝑥)) → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4640, 45eqeltrid 2865 . . . . . . . . 9 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢𝐵 ∧ (inr‘𝑢) = 𝑥)) → (inr‘𝑢) ∈ ({1o} × 𝐵))
4735, 46eqeltrrd 2862 . . . . . . . 8 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢𝐵 ∧ (inr‘𝑢) = 𝑥)) → 𝑥 ∈ ({1o} × 𝐵))
4834, 47rexlimddv 3168 . . . . . . 7 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ ({1o} × 𝐵))
49 elun2 4133 . . . . . . 7 (𝑥 ∈ ({1o} × 𝐵) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
5048, 49syl 17 . . . . . 6 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
5150, 26eleqtrrdi 2872 . . . . 5 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ (𝐴𝐵))
5227, 51jaoi 868 . . . 4 ((𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)) → 𝑥 ∈ (𝐴𝐵))
531, 52sylbi 219 . . 3 (𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)) → 𝑥 ∈ (𝐴𝐵))
5453ssriv 3938 . 2 ((inl “ 𝐴) ∪ (inr “ 𝐵)) ⊆ (𝐴𝐵)
55 djur 9870 . . . . 5 (𝑥 ∈ (𝐴𝐵) → (∃𝑦𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦𝐵 𝑥 = (inr‘𝑦)))
56 vex 3457 . . . . . . . . . 10 𝑦 ∈ V
57 f1odm 6804 . . . . . . . . . . 11 (inl:V–1-1-onto→({∅} × V) → dom inl = V)
582, 57ax-mp 5 . . . . . . . . . 10 dom inl = V
5956, 58eleqtrri 2860 . . . . . . . . 9 𝑦 ∈ dom inl
60 simpl 486 . . . . . . . . 9 ((𝑦𝐴𝑥 = (inl‘𝑦)) → 𝑦𝐴)
6113funmpt2 6554 . . . . . . . . . 10 Fun inl
62 funfvima 7208 . . . . . . . . . 10 ((Fun inl ∧ 𝑦 ∈ dom inl) → (𝑦𝐴 → (inl‘𝑦) ∈ (inl “ 𝐴)))
6361, 62mpan 700 . . . . . . . . 9 (𝑦 ∈ dom inl → (𝑦𝐴 → (inl‘𝑦) ∈ (inl “ 𝐴)))
6459, 60, 63mpsyl 68 . . . . . . . 8 ((𝑦𝐴𝑥 = (inl‘𝑦)) → (inl‘𝑦) ∈ (inl “ 𝐴))
65 eleq1 2849 . . . . . . . . 9 (𝑥 = (inl‘𝑦) → (𝑥 ∈ (inl “ 𝐴) ↔ (inl‘𝑦) ∈ (inl “ 𝐴)))
6665adantl 485 . . . . . . . 8 ((𝑦𝐴𝑥 = (inl‘𝑦)) → (𝑥 ∈ (inl “ 𝐴) ↔ (inl‘𝑦) ∈ (inl “ 𝐴)))
6764, 66mpbird 259 . . . . . . 7 ((𝑦𝐴𝑥 = (inl‘𝑦)) → 𝑥 ∈ (inl “ 𝐴))
6867rexlimiva 3154 . . . . . 6 (∃𝑦𝐴 𝑥 = (inl‘𝑦) → 𝑥 ∈ (inl “ 𝐴))
69 f1odm 6804 . . . . . . . . . . 11 (inr:V–1-1-onto→({1o} × V) → dom inr = V)
7028, 69ax-mp 5 . . . . . . . . . 10 dom inr = V
7156, 70eleqtrri 2860 . . . . . . . . 9 𝑦 ∈ dom inr
72 simpl 486 . . . . . . . . 9 ((𝑦𝐵𝑥 = (inr‘𝑦)) → 𝑦𝐵)
73 f1ofun 6802 . . . . . . . . . . 11 (inr:V–1-1-onto→({1o} × V) → Fun inr)
7428, 73ax-mp 5 . . . . . . . . . 10 Fun inr
75 funfvima 7208 . . . . . . . . . 10 ((Fun inr ∧ 𝑦 ∈ dom inr) → (𝑦𝐵 → (inr‘𝑦) ∈ (inr “ 𝐵)))
7674, 75mpan 700 . . . . . . . . 9 (𝑦 ∈ dom inr → (𝑦𝐵 → (inr‘𝑦) ∈ (inr “ 𝐵)))
7771, 72, 76mpsyl 68 . . . . . . . 8 ((𝑦𝐵𝑥 = (inr‘𝑦)) → (inr‘𝑦) ∈ (inr “ 𝐵))
78 eleq1 2849 . . . . . . . . 9 (𝑥 = (inr‘𝑦) → (𝑥 ∈ (inr “ 𝐵) ↔ (inr‘𝑦) ∈ (inr “ 𝐵)))
7978adantl 485 . . . . . . . 8 ((𝑦𝐵𝑥 = (inr‘𝑦)) → (𝑥 ∈ (inr “ 𝐵) ↔ (inr‘𝑦) ∈ (inr “ 𝐵)))
8077, 79mpbird 259 . . . . . . 7 ((𝑦𝐵𝑥 = (inr‘𝑦)) → 𝑥 ∈ (inr “ 𝐵))
8180rexlimiva 3154 . . . . . 6 (∃𝑦𝐵 𝑥 = (inr‘𝑦) → 𝑥 ∈ (inr “ 𝐵))
8268, 81orim12i 919 . . . . 5 ((∃𝑦𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦𝐵 𝑥 = (inr‘𝑦)) → (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
8355, 82syl 17 . . . 4 (𝑥 ∈ (𝐴𝐵) → (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
8483, 1sylibr 236 . . 3 (𝑥 ∈ (𝐴𝐵) → 𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)))
8584ssriv 3938 . 2 (𝐴𝐵) ⊆ ((inl “ 𝐴) ∪ (inr “ 𝐵))
8654, 85eqssi 3950 1 ((inl “ 𝐴) ∪ (inr “ 𝐵)) = (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  wo 858   = wceq 1559  wcel 2141  wrex 3085  Vcvv 3453  cun 3900  wss 3902  c0 4283  {csn 4579  cop 4585   × cxp 5641  dom cdm 5643  cima 5646  Fun wfun 6509   Fn wfn 6510  1-1-ontowf1o 6514  cfv 6515  1oc1o 8423  cdju 9849  inlcinl 9850  inrcinr 9851
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7712
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-ord 6343  df-on 6344  df-lim 6345  df-suc 6346  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-om 7841  df-1st 7964  df-2nd 7965  df-1o 8430  df-dju 9852  df-inl 9853  df-inr 9854
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator