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

Theorem djur 9957
Description: A member of a disjoint union can be mapped from one of the classes which produced it. (Contributed by Jim Kingdon, 23-Jun-2022.)
Assertion
Ref Expression
djur (𝐶 ∈ (𝐴𝐵) → (∃𝑥𝐴 𝐶 = (inl‘𝑥) ∨ ∃𝑥𝐵 𝐶 = (inr‘𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem djur
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-dju 9939 . . . 4 (𝐴𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
21eleq2i 2831 . . 3 (𝐶 ∈ (𝐴𝐵) ↔ 𝐶 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
3 elun 4163 . . 3 (𝐶 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ↔ (𝐶 ∈ ({∅} × 𝐴) ∨ 𝐶 ∈ ({1o} × 𝐵)))
42, 3sylbb 219 . 2 (𝐶 ∈ (𝐴𝐵) → (𝐶 ∈ ({∅} × 𝐴) ∨ 𝐶 ∈ ({1o} × 𝐵)))
5 xp2nd 8046 . . . 4 (𝐶 ∈ ({∅} × 𝐴) → (2nd𝐶) ∈ 𝐴)
6 1st2nd2 8052 . . . . . 6 (𝐶 ∈ ({∅} × 𝐴) → 𝐶 = ⟨(1st𝐶), (2nd𝐶)⟩)
7 xp1st 8045 . . . . . . 7 (𝐶 ∈ ({∅} × 𝐴) → (1st𝐶) ∈ {∅})
8 elsni 4648 . . . . . . 7 ((1st𝐶) ∈ {∅} → (1st𝐶) = ∅)
9 opeq1 4878 . . . . . . . 8 ((1st𝐶) = ∅ → ⟨(1st𝐶), (2nd𝐶)⟩ = ⟨∅, (2nd𝐶)⟩)
109eqeq2d 2746 . . . . . . 7 ((1st𝐶) = ∅ → (𝐶 = ⟨(1st𝐶), (2nd𝐶)⟩ ↔ 𝐶 = ⟨∅, (2nd𝐶)⟩))
117, 8, 103syl 18 . . . . . 6 (𝐶 ∈ ({∅} × 𝐴) → (𝐶 = ⟨(1st𝐶), (2nd𝐶)⟩ ↔ 𝐶 = ⟨∅, (2nd𝐶)⟩))
126, 11mpbid 232 . . . . 5 (𝐶 ∈ ({∅} × 𝐴) → 𝐶 = ⟨∅, (2nd𝐶)⟩)
13 fvexd 6922 . . . . . 6 (𝐶 ∈ ({∅} × 𝐴) → (2nd𝐶) ∈ V)
14 opex 5475 . . . . . 6 ⟨∅, (2nd𝐶)⟩ ∈ V
15 opeq2 4879 . . . . . . 7 (𝑦 = (2nd𝐶) → ⟨∅, 𝑦⟩ = ⟨∅, (2nd𝐶)⟩)
16 df-inl 9940 . . . . . . 7 inl = (𝑦 ∈ V ↦ ⟨∅, 𝑦⟩)
1715, 16fvmptg 7014 . . . . . 6 (((2nd𝐶) ∈ V ∧ ⟨∅, (2nd𝐶)⟩ ∈ V) → (inl‘(2nd𝐶)) = ⟨∅, (2nd𝐶)⟩)
1813, 14, 17sylancl 586 . . . . 5 (𝐶 ∈ ({∅} × 𝐴) → (inl‘(2nd𝐶)) = ⟨∅, (2nd𝐶)⟩)
1912, 18eqtr4d 2778 . . . 4 (𝐶 ∈ ({∅} × 𝐴) → 𝐶 = (inl‘(2nd𝐶)))
20 fveq2 6907 . . . . 5 (𝑥 = (2nd𝐶) → (inl‘𝑥) = (inl‘(2nd𝐶)))
2120rspceeqv 3645 . . . 4 (((2nd𝐶) ∈ 𝐴𝐶 = (inl‘(2nd𝐶))) → ∃𝑥𝐴 𝐶 = (inl‘𝑥))
225, 19, 21syl2anc 584 . . 3 (𝐶 ∈ ({∅} × 𝐴) → ∃𝑥𝐴 𝐶 = (inl‘𝑥))
23 xp2nd 8046 . . . 4 (𝐶 ∈ ({1o} × 𝐵) → (2nd𝐶) ∈ 𝐵)
24 1st2nd2 8052 . . . . . 6 (𝐶 ∈ ({1o} × 𝐵) → 𝐶 = ⟨(1st𝐶), (2nd𝐶)⟩)
25 xp1st 8045 . . . . . . 7 (𝐶 ∈ ({1o} × 𝐵) → (1st𝐶) ∈ {1o})
26 elsni 4648 . . . . . . 7 ((1st𝐶) ∈ {1o} → (1st𝐶) = 1o)
27 opeq1 4878 . . . . . . . 8 ((1st𝐶) = 1o → ⟨(1st𝐶), (2nd𝐶)⟩ = ⟨1o, (2nd𝐶)⟩)
2827eqeq2d 2746 . . . . . . 7 ((1st𝐶) = 1o → (𝐶 = ⟨(1st𝐶), (2nd𝐶)⟩ ↔ 𝐶 = ⟨1o, (2nd𝐶)⟩))
2925, 26, 283syl 18 . . . . . 6 (𝐶 ∈ ({1o} × 𝐵) → (𝐶 = ⟨(1st𝐶), (2nd𝐶)⟩ ↔ 𝐶 = ⟨1o, (2nd𝐶)⟩))
3024, 29mpbid 232 . . . . 5 (𝐶 ∈ ({1o} × 𝐵) → 𝐶 = ⟨1o, (2nd𝐶)⟩)
31 fvexd 6922 . . . . . 6 (𝐶 ∈ ({1o} × 𝐵) → (2nd𝐶) ∈ V)
32 opex 5475 . . . . . 6 ⟨1o, (2nd𝐶)⟩ ∈ V
33 opeq2 4879 . . . . . . 7 (𝑧 = (2nd𝐶) → ⟨1o, 𝑧⟩ = ⟨1o, (2nd𝐶)⟩)
34 df-inr 9941 . . . . . . 7 inr = (𝑧 ∈ V ↦ ⟨1o, 𝑧⟩)
3533, 34fvmptg 7014 . . . . . 6 (((2nd𝐶) ∈ V ∧ ⟨1o, (2nd𝐶)⟩ ∈ V) → (inr‘(2nd𝐶)) = ⟨1o, (2nd𝐶)⟩)
3631, 32, 35sylancl 586 . . . . 5 (𝐶 ∈ ({1o} × 𝐵) → (inr‘(2nd𝐶)) = ⟨1o, (2nd𝐶)⟩)
3730, 36eqtr4d 2778 . . . 4 (𝐶 ∈ ({1o} × 𝐵) → 𝐶 = (inr‘(2nd𝐶)))
38 fveq2 6907 . . . . 5 (𝑥 = (2nd𝐶) → (inr‘𝑥) = (inr‘(2nd𝐶)))
3938rspceeqv 3645 . . . 4 (((2nd𝐶) ∈ 𝐵𝐶 = (inr‘(2nd𝐶))) → ∃𝑥𝐵 𝐶 = (inr‘𝑥))
4023, 37, 39syl2anc 584 . . 3 (𝐶 ∈ ({1o} × 𝐵) → ∃𝑥𝐵 𝐶 = (inr‘𝑥))
4122, 40orim12i 908 . 2 ((𝐶 ∈ ({∅} × 𝐴) ∨ 𝐶 ∈ ({1o} × 𝐵)) → (∃𝑥𝐴 𝐶 = (inl‘𝑥) ∨ ∃𝑥𝐵 𝐶 = (inr‘𝑥)))
424, 41syl 17 1 (𝐶 ∈ (𝐴𝐵) → (∃𝑥𝐴 𝐶 = (inl‘𝑥) ∨ ∃𝑥𝐵 𝐶 = (inr‘𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wo 847   = wceq 1537  wcel 2106  wrex 3068  Vcvv 3478  cun 3961  c0 4339  {csn 4631  cop 4637   × cxp 5687  cfv 6563  1st c1st 8011  2nd c2nd 8012  1oc1o 8498  cdju 9936  inlcinl 9937  inrcinr 9938
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-iota 6516  df-fun 6565  df-fv 6571  df-1st 8013  df-2nd 8014  df-dju 9939  df-inl 9940  df-inr 9941
This theorem is referenced by:  djuss  9958  djuun  9964  updjud  9972
  Copyright terms: Public domain W3C validator