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

Theorem djuun 9988
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 4100 . . . 4 (𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)) ↔ (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
2 djulf1o 9974 . . . . . . . . . . 11 inl:V–1-1-onto→({∅} × V)
3 f1ofn 6817 . . . . . . . . . . 11 (inl:V–1-1-onto→({∅} × V) → inl Fn V)
42, 3ax-mp 5 . . . . . . . . . 10 inl Fn V
5 ssv 3955 . . . . . . . . . 10 𝐴 ⊆ V
6 fvelimab 6949 . . . . . . . . . 10 ((inl Fn V ∧ 𝐴 ⊆ V) → (𝑥 ∈ (inl “ 𝐴) ↔ ∃𝑢 ∈ 𝐴 (inl‘𝑢) = 𝑥))
74, 5, 6mp2an 705 . . . . . . . . 9 (𝑥 ∈ (inl “ 𝐴) ↔ ∃𝑢 ∈ 𝐴 (inl‘𝑢) = 𝑥)
87biimpi 219 . . . . . . . 8 (𝑥 ∈ (inl “ 𝐴) → ∃𝑢 ∈ 𝐴 (inl‘𝑢) = 𝑥)
9 simprr 785 . . . . . . . . 9 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ (inl‘𝑢) = 𝑥)) → (inl‘𝑢) = 𝑥)
10 vex 3455 . . . . . . . . . . 11 𝑢 ∈ V
11 opex 5432 . . . . . . . . . . 11 ⟨∅, 𝑢⟩ ∈ V
12 opeq2 4834 . . . . . . . . . . . 12 (𝑧 = 𝑢 → ⟨∅, 𝑧⟩ = ⟨∅, 𝑢⟩)
13 df-inl 9964 . . . . . . . . . . . 12 inl = (𝑧 ∈ V ↦ ⟨∅, 𝑧⟩)
1412, 13fvmptg 6983 . . . . . . . . . . 11 ((𝑢 ∈ V ∧ ⟨∅, 𝑢⟩ ∈ V) → (inl‘𝑢) = ⟨∅, 𝑢⟩)
1510, 11, 14mp2an 705 . . . . . . . . . 10 (inl‘𝑢) = ⟨∅, 𝑢⟩
16 0ex 5261 . . . . . . . . . . . . 13 ∅ ∈ V
1716snid 4623 . . . . . . . . . . . 12 ∅ ∈ {∅}
18 opelxpi 5688 . . . . . . . . . . . 12 ((∅ ∈ {∅} ∧ 𝑢 ∈ 𝐴) → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
1917, 18mpan 703 . . . . . . . . . . 11 (𝑢 ∈ 𝐴 → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
2019ad2antrl 741 . . . . . . . . . 10 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ (inl‘𝑢) = 𝑥)) → ⟨∅, 𝑢⟩ ∈ ({∅} × 𝐴))
2115, 20eqeltrid 2865 . . . . . . . . 9 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ (inl‘𝑢) = 𝑥)) → (inl‘𝑢) ∈ ({∅} × 𝐴))
229, 21eqeltrrd 2862 . . . . . . . 8 ((𝑥 ∈ (inl “ 𝐴) ∧ (𝑢 ∈ 𝐴 ∧ (inl‘𝑢) = 𝑥)) → 𝑥 ∈ ({∅} × 𝐴))
238, 22rexlimddv 3170 . . . . . . 7 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ ({∅} × 𝐴))
24 elun1 4128 . . . . . . 7 (𝑥 ∈ ({∅} × 𝐴) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
2523, 24syl 18 . . . . . 6 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
26 df-dju 9963 . . . . . 6 (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
2725, 26eleqtrrdi 2872 . . . . 5 (𝑥 ∈ (inl “ 𝐴) → 𝑥 ∈ (𝐴 ⊔ 𝐵))
28 djurf1o 9975 . . . . . . . . . . 11 inr:V–1-1-onto→({1o} × V)
29 f1ofn 6817 . . . . . . . . . . 11 (inr:V–1-1-onto→({1o} × V) → inr Fn V)
3028, 29ax-mp 5 . . . . . . . . . 10 inr Fn V
31 ssv 3955 . . . . . . . . . 10 𝐵 ⊆ V
32 fvelimab 6949 . . . . . . . . . 10 ((inr Fn V ∧ 𝐵 ⊆ V) → (𝑥 ∈ (inr “ 𝐵) ↔ ∃𝑢 ∈ 𝐵 (inr‘𝑢) = 𝑥))
3330, 31, 32mp2an 705 . . . . . . . . 9 (𝑥 ∈ (inr “ 𝐵) ↔ ∃𝑢 ∈ 𝐵 (inr‘𝑢) = 𝑥)
3433biimpi 219 . . . . . . . 8 (𝑥 ∈ (inr “ 𝐵) → ∃𝑢 ∈ 𝐵 (inr‘𝑢) = 𝑥)
35 simprr 785 . . . . . . . . 9 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ (inr‘𝑢) = 𝑥)) → (inr‘𝑢) = 𝑥)
36 opex 5432 . . . . . . . . . . 11 ⟨1o, 𝑢⟩ ∈ V
37 opeq2 4834 . . . . . . . . . . . 12 (𝑧 = 𝑢 → ⟨1o, 𝑧⟩ = ⟨1o, 𝑢⟩)
38 df-inr 9965 . . . . . . . . . . . 12 inr = (𝑧 ∈ V ↦ ⟨1o, 𝑧⟩)
3937, 38fvmptg 6983 . . . . . . . . . . 11 ((𝑢 ∈ V ∧ ⟨1o, 𝑢⟩ ∈ V) → (inr‘𝑢) = ⟨1o, 𝑢⟩)
4010, 36, 39mp2an 705 . . . . . . . . . 10 (inr‘𝑢) = ⟨1o, 𝑢⟩
41 1oex 8470 . . . . . . . . . . . . 13 1o ∈ V
4241snid 4623 . . . . . . . . . . . 12 1o ∈ {1o}
43 opelxpi 5688 . . . . . . . . . . . 12 ((1o ∈ {1o} ∧ 𝑢 ∈ 𝐵) → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4442, 43mpan 703 . . . . . . . . . . 11 (𝑢 ∈ 𝐵 → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4544ad2antrl 741 . . . . . . . . . 10 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ (inr‘𝑢) = 𝑥)) → ⟨1o, 𝑢⟩ ∈ ({1o} × 𝐵))
4640, 45eqeltrid 2865 . . . . . . . . 9 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ (inr‘𝑢) = 𝑥)) → (inr‘𝑢) ∈ ({1o} × 𝐵))
4735, 46eqeltrrd 2862 . . . . . . . 8 ((𝑥 ∈ (inr “ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ (inr‘𝑢) = 𝑥)) → 𝑥 ∈ ({1o} × 𝐵))
4834, 47rexlimddv 3170 . . . . . . 7 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ ({1o} × 𝐵))
49 elun2 4129 . . . . . . 7 (𝑥 ∈ ({1o} × 𝐵) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
5048, 49syl 18 . . . . . 6 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
5150, 26eleqtrrdi 2872 . . . . 5 (𝑥 ∈ (inr “ 𝐵) → 𝑥 ∈ (𝐴 ⊔ 𝐵))
5227, 51jaoi 871 . . . 4 ((𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)) → 𝑥 ∈ (𝐴 ⊔ 𝐵))
531, 52sylbi 220 . . 3 (𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)) → 𝑥 ∈ (𝐴 ⊔ 𝐵))
5453ssriv 3935 . 2 ((inl “ 𝐴) ∪ (inr “ 𝐵)) ⊆ (𝐴 ⊔ 𝐵)
55 djur 9981 . . . . 5 (𝑥 ∈ (𝐴 ⊔ 𝐵) → (∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦)))
56 vex 3455 . . . . . . . . . 10 𝑦 ∈ V
57 f1odm 6820 . . . . . . . . . . 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 488 . . . . . . . . 9 ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑦 ∈ 𝐴)
6113funmpt2 6571 . . . . . . . . . 10 Fun inl
62 funfvima 7228 . . . . . . . . . 10 ((Fun inl ∧ 𝑦 ∈ dom inl) → (𝑦 ∈ 𝐴 → (inl‘𝑦) ∈ (inl “ 𝐴)))
6361, 62mpan 703 . . . . . . . . 9 (𝑦 ∈ dom inl → (𝑦 ∈ 𝐴 → (inl‘𝑦) ∈ (inl “ 𝐴)))
6459, 60, 63mpsyl 69 . . . . . . . 8 ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → (inl‘𝑦) ∈ (inl “ 𝐴))
65 eleq1 2849 . . . . . . . . 9 (𝑥 = (inl‘𝑦) → (𝑥 ∈ (inl “ 𝐴) ↔ (inl‘𝑦) ∈ (inl “ 𝐴)))
6665adantl 487 . . . . . . . 8 ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → (𝑥 ∈ (inl “ 𝐴) ↔ (inl‘𝑦) ∈ (inl “ 𝐴)))
6764, 66mpbird 260 . . . . . . 7 ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 ∈ (inl “ 𝐴))
6867rexlimiva 3156 . . . . . 6 (∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) → 𝑥 ∈ (inl “ 𝐴))
69 f1odm 6820 . . . . . . . . . . 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 488 . . . . . . . . 9 ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑦 ∈ 𝐵)
73 f1ofun 6818 . . . . . . . . . . 11 (inr:V–1-1-onto→({1o} × V) → Fun inr)
7428, 73ax-mp 5 . . . . . . . . . 10 Fun inr
75 funfvima 7228 . . . . . . . . . 10 ((Fun inr ∧ 𝑦 ∈ dom inr) → (𝑦 ∈ 𝐵 → (inr‘𝑦) ∈ (inr “ 𝐵)))
7674, 75mpan 703 . . . . . . . . 9 (𝑦 ∈ dom inr → (𝑦 ∈ 𝐵 → (inr‘𝑦) ∈ (inr “ 𝐵)))
7771, 72, 76mpsyl 69 . . . . . . . 8 ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → (inr‘𝑦) ∈ (inr “ 𝐵))
78 eleq1 2849 . . . . . . . . 9 (𝑥 = (inr‘𝑦) → (𝑥 ∈ (inr “ 𝐵) ↔ (inr‘𝑦) ∈ (inr “ 𝐵)))
7978adantl 487 . . . . . . . 8 ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → (𝑥 ∈ (inr “ 𝐵) ↔ (inr‘𝑦) ∈ (inr “ 𝐵)))
8077, 79mpbird 260 . . . . . . 7 ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 ∈ (inr “ 𝐵))
8180rexlimiva 3156 . . . . . 6 (∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦) → 𝑥 ∈ (inr “ 𝐵))
8268, 81orim12i 922 . . . . 5 ((∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦)) → (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
8355, 82syl 18 . . . 4 (𝑥 ∈ (𝐴 ⊔ 𝐵) → (𝑥 ∈ (inl “ 𝐴) ∨ 𝑥 ∈ (inr “ 𝐵)))
8483, 1sylibr 237 . . 3 (𝑥 ∈ (𝐴 ⊔ 𝐵) → 𝑥 ∈ ((inl “ 𝐴) ∪ (inr “ 𝐵)))
8584ssriv 3935 . 2 (𝐴 ⊔ 𝐵) ⊆ ((inl “ 𝐴) ∪ (inr “ 𝐵))
8654, 85eqssi 3947 1 ((inl “ 𝐴) ∪ (inr “ 𝐵)) = (𝐴 ⊔ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  {csn 4584  ⟨cop 4590   × cxp 5649  dom cdm 5651   “ cima 5654  Fun wfun 6525   Fn wfn 6526  –1-1-onto→wf1o 6530  ‘cfv 6531  1oc1o 8453   ⊔ cdju 9960  inlcinl 9961  inrcinr 9962
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-om 7867  df-1st 7990  df-2nd 7991  df-1o 8460  df-dju 9963  df-inl 9964  df-inr 9965
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator