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

Theorem djuun 9913
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 4108 . . . 4 (𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)) ↔ (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
2 djulf1o 9899 . . . . . . . . . . 11 inl:V–1-1-onto→({∅} × V)
3 f1ofn 6823 . . . . . . . . . . 11 (inl:V–1-1-onto→({∅} × V) → inl Fn V)
42, 3ax-mp 5 . . . . . . . . . 10 inl Fn V
5 ssv 3962 . . . . . . . . . 10 𝐴 ⊆ V
6 fvelimab 6955 . . . . . . . . . 10 ((inl Fn V ∧ 𝐴 ⊆ V) → (𝑥 ∈ (inl “ 𝐴) ↔ ∃𝑢𝐴 (inl‘𝑢) = 𝑥))
74, 5, 6mp2an 704 . . . . . . . . 9 (𝑥 ∈ (inl “ 𝐴) ↔ ∃𝑢𝐴 (inl‘𝑢) = 𝑥)
87biimpi 219 . . . . . . . 8 (𝑥 ∈ (inl “ 𝐴) → ∃𝑢𝐴 (inl‘𝑢) = 𝑥)
9 simprr 784 . . . . . . . . 9 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢𝐴 ∧ (inl‘𝑢) = 𝑥)) → (inl‘𝑢) = 𝑥)
10 vex 3459 . . . . . . . . . . 11 𝑢 ∈ V
11 opex 5447 . . . . . . . . . . 11 ⟨∅, 𝑢⟩ ∈ V
12 opeq2 4840 . . . . . . . . . . . 12 (𝑧 = 𝑢 → ⟨∅, 𝑧⟩ = ⟨∅, 𝑢⟩)
13 df-inl 9889 . . . . . . . . . . . 12 inl = (𝑧 ∈ V ↦ ⟨∅, 𝑧⟩)
1412, 13fvmptg 6989 . . . . . . . . . . 11 ((𝑢 ∈ V ∧ ⟨∅, 𝑢⟩ ∈ V) → (inl‘𝑢) = ⟨∅, 𝑢⟩)
1510, 11, 14mp2an 704 . . . . . . . . . 10 (inl‘𝑢) = ⟨∅, 𝑢
16 0ex 5271 . . . . . . . . . . . . 13 ∅ ∈ V
1716snid 4629 . . . . . . . . . . . 12 ∅ ∈ {∅}
18 opelxpi 5700 . . . . . . . . . . . 12 ((∅ ∈ {∅} ∧ 𝑢𝐴) → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
1917, 18mpan 702 . . . . . . . . . . 11 (𝑢𝐴 → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
2019ad2antrl 740 . . . . . . . . . 10 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢𝐴 ∧ (inl‘𝑢) = 𝑥)) → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
2115, 20eqeltrid 2867 . . . . . . . . 9 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢𝐴 ∧ (inl‘𝑢) = 𝑥)) → (inl‘𝑢) ∈ ({∅} × 𝐴))
229, 21eqeltrrd 2864 . . . . . . . 8 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢𝐴 ∧ (inl‘𝑢) = 𝑥)) → 𝑥 ∈ ({∅} × 𝐴))
238, 22rexlimddv 3172 . . . . . . 7 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ ({∅} × 𝐴))
24 elun1 4136 . . . . . . 7 (𝑥 ∈ ({∅} × 𝐴) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
2523, 24syl 18 . . . . . 6 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
26 df-dju 9888 . . . . . 6 (𝐴𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
2725, 26eleqtrrdi 2874 . . . . 5 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ (𝐴𝐵))
28 djurf1o 9900 . . . . . . . . . . 11 inr:V–1-1-onto→({1o} × V)
29 f1ofn 6823 . . . . . . . . . . 11 (inr:V–1-1-onto→({1o} × V) → inr Fn V)
3028, 29ax-mp 5 . . . . . . . . . 10 inr Fn V
31 ssv 3962 . . . . . . . . . 10 𝐵 ⊆ V
32 fvelimab 6955 . . . . . . . . . 10 ((inr Fn V ∧ 𝐵 ⊆ V) → (𝑥 ∈ (inr “ 𝐵) ↔ ∃𝑢𝐵 (inr‘𝑢) = 𝑥))
3330, 31, 32mp2an 704 . . . . . . . . 9 (𝑥 ∈ (inr “ 𝐵) ↔ ∃𝑢𝐵 (inr‘𝑢) = 𝑥)
3433biimpi 219 . . . . . . . 8 (𝑥 ∈ (inr “ 𝐵) → ∃𝑢𝐵 (inr‘𝑢) = 𝑥)
35 simprr 784 . . . . . . . . 9 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢𝐵 ∧ (inr‘𝑢) = 𝑥)) → (inr‘𝑢) = 𝑥)
36 opex 5447 . . . . . . . . . . 11 ⟨1o, 𝑢⟩ ∈ V
37 opeq2 4840 . . . . . . . . . . . 12 (𝑧 = 𝑢 → ⟨1o, 𝑧⟩ = ⟨1o, 𝑢⟩)
38 df-inr 9890 . . . . . . . . . . . 12 inr = (𝑧 ∈ V ↦ ⟨1o, 𝑧⟩)
3937, 38fvmptg 6989 . . . . . . . . . . 11 ((𝑢 ∈ V ∧ ⟨1o, 𝑢⟩ ∈ V) → (inr‘𝑢) = ⟨1o, 𝑢⟩)
4010, 36, 39mp2an 704 . . . . . . . . . 10 (inr‘𝑢) = ⟨1o, 𝑢
41 1oex 8464 . . . . . . . . . . . . 13 1o ∈ V
4241snid 4629 . . . . . . . . . . . 12 1o ∈ {1o}
43 opelxpi 5700 . . . . . . . . . . . 12 ((1o ∈ {1o} ∧ 𝑢𝐵) → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4442, 43mpan 702 . . . . . . . . . . 11 (𝑢𝐵 → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4544ad2antrl 740 . . . . . . . . . 10 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢𝐵 ∧ (inr‘𝑢) = 𝑥)) → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4640, 45eqeltrid 2867 . . . . . . . . 9 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢𝐵 ∧ (inr‘𝑢) = 𝑥)) → (inr‘𝑢) ∈ ({1o} × 𝐵))
4735, 46eqeltrrd 2864 . . . . . . . 8 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢𝐵 ∧ (inr‘𝑢) = 𝑥)) → 𝑥 ∈ ({1o} × 𝐵))
4834, 47rexlimddv 3172 . . . . . . 7 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ ({1o} × 𝐵))
49 elun2 4137 . . . . . . 7 (𝑥 ∈ ({1o} × 𝐵) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
5048, 49syl 18 . . . . . 6 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
5150, 26eleqtrrdi 2874 . . . . 5 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ (𝐴𝐵))
5227, 51jaoi 870 . . . 4 ((𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)) → 𝑥 ∈ (𝐴𝐵))
531, 52sylbi 220 . . 3 (𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)) → 𝑥 ∈ (𝐴𝐵))
5453ssriv 3942 . 2 ((inl “ 𝐴) ∪ (inr “ 𝐵)) ⊆ (𝐴𝐵)
55 djur 9906 . . . . 5 (𝑥 ∈ (𝐴𝐵) → (∃𝑦𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦𝐵 𝑥 = (inr‘𝑦)))
56 vex 3459 . . . . . . . . . 10 𝑦 ∈ V
57 f1odm 6826 . . . . . . . . . . 11 (inl:V–1-1-onto→({∅} × V) → dom inl = V)
582, 57ax-mp 5 . . . . . . . . . 10 dom inl = V
5956, 58eleqtrri 2862 . . . . . . . . 9 𝑦 ∈ dom inl
60 simpl 487 . . . . . . . . 9 ((𝑦𝐴𝑥 = (inl‘𝑦)) → 𝑦𝐴)
6113funmpt2 6577 . . . . . . . . . 10 Fun inl
62 funfvima 7230 . . . . . . . . . 10 ((Fun inl ∧ 𝑦 ∈ dom inl) → (𝑦𝐴 → (inl‘𝑦) ∈ (inl “ 𝐴)))
6361, 62mpan 702 . . . . . . . . 9 (𝑦 ∈ dom inl → (𝑦𝐴 → (inl‘𝑦) ∈ (inl “ 𝐴)))
6459, 60, 63mpsyl 69 . . . . . . . 8 ((𝑦𝐴𝑥 = (inl‘𝑦)) → (inl‘𝑦) ∈ (inl “ 𝐴))
65 eleq1 2851 . . . . . . . . 9 (𝑥 = (inl‘𝑦) → (𝑥 ∈ (inl “ 𝐴) ↔ (inl‘𝑦) ∈ (inl “ 𝐴)))
6665adantl 486 . . . . . . . 8 ((𝑦𝐴𝑥 = (inl‘𝑦)) → (𝑥 ∈ (inl “ 𝐴) ↔ (inl‘𝑦) ∈ (inl “ 𝐴)))
6764, 66mpbird 260 . . . . . . 7 ((𝑦𝐴𝑥 = (inl‘𝑦)) → 𝑥 ∈ (inl “ 𝐴))
6867rexlimiva 3158 . . . . . 6 (∃𝑦𝐴 𝑥 = (inl‘𝑦) → 𝑥 ∈ (inl “ 𝐴))
69 f1odm 6826 . . . . . . . . . . 11 (inr:V–1-1-onto→({1o} × V) → dom inr = V)
7028, 69ax-mp 5 . . . . . . . . . 10 dom inr = V
7156, 70eleqtrri 2862 . . . . . . . . 9 𝑦 ∈ dom inr
72 simpl 487 . . . . . . . . 9 ((𝑦𝐵𝑥 = (inr‘𝑦)) → 𝑦𝐵)
73 f1ofun 6824 . . . . . . . . . . 11 (inr:V–1-1-onto→({1o} × V) → Fun inr)
7428, 73ax-mp 5 . . . . . . . . . 10 Fun inr
75 funfvima 7230 . . . . . . . . . 10 ((Fun inr ∧ 𝑦 ∈ dom inr) → (𝑦𝐵 → (inr‘𝑦) ∈ (inr “ 𝐵)))
7674, 75mpan 702 . . . . . . . . 9 (𝑦 ∈ dom inr → (𝑦𝐵 → (inr‘𝑦) ∈ (inr “ 𝐵)))
7771, 72, 76mpsyl 69 . . . . . . . 8 ((𝑦𝐵𝑥 = (inr‘𝑦)) → (inr‘𝑦) ∈ (inr “ 𝐵))
78 eleq1 2851 . . . . . . . . 9 (𝑥 = (inr‘𝑦) → (𝑥 ∈ (inr “ 𝐵) ↔ (inr‘𝑦) ∈ (inr “ 𝐵)))
7978adantl 486 . . . . . . . 8 ((𝑦𝐵𝑥 = (inr‘𝑦)) → (𝑥 ∈ (inr “ 𝐵) ↔ (inr‘𝑦) ∈ (inr “ 𝐵)))
8077, 79mpbird 260 . . . . . . 7 ((𝑦𝐵𝑥 = (inr‘𝑦)) → 𝑥 ∈ (inr “ 𝐵))
8180rexlimiva 3158 . . . . . 6 (∃𝑦𝐵 𝑥 = (inr‘𝑦) → 𝑥 ∈ (inr “ 𝐵))
8268, 81orim12i 921 . . . . 5 ((∃𝑦𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦𝐵 𝑥 = (inr‘𝑦)) → (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
8355, 82syl 18 . . . 4 (𝑥 ∈ (𝐴𝐵) → (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
8483, 1sylibr 237 . . 3 (𝑥 ∈ (𝐴𝐵) → 𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)))
8584ssriv 3942 . 2 (𝐴𝐵) ⊆ ((inl “ 𝐴) ∪ (inr “ 𝐵))
8654, 85eqssi 3954 1 ((inl “ 𝐴) ∪ (inr “ 𝐵)) = (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wo 860   = wceq 1570  wcel 2143  wrex 3089  Vcvv 3455  cun 3904  wss 3906  c0 4287  {csn 4590  cop 4596   × cxp 5661  dom cdm 5663  cima 5666  Fun wfun 6532   Fn wfn 6533  1-1-ontowf1o 6537  cfv 6538  1oc1o 8447  cdju 9885  inlcinl 9886  inrcinr 9887
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-om 7864  df-1st 7987  df-2nd 7988  df-1o 8454  df-dju 9888  df-inl 9889  df-inr 9890
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator