ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  djur GIF version

Theorem djur 7186
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.) Upgrade implication to biconditional and shorten proof. (Revised by BJ, 14-Jul-2023.)
Assertion
Ref Expression
djur (𝐶 ∈ (𝐴𝐵) ↔ (∃𝑥𝐴 𝐶 = (inl‘𝑥) ∨ ∃𝑥𝐵 𝐶 = (inr‘𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem djur
StepHypRef Expression
1 eldju 7185 . 2 (𝐶 ∈ (𝐴𝐵) ↔ (∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥)))
2 fvres 5613 . . . . 5 (𝑥𝐴 → ((inl ↾ 𝐴)‘𝑥) = (inl‘𝑥))
32eqeq2d 2218 . . . 4 (𝑥𝐴 → (𝐶 = ((inl ↾ 𝐴)‘𝑥) ↔ 𝐶 = (inl‘𝑥)))
43rexbiia 2522 . . 3 (∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ↔ ∃𝑥𝐴 𝐶 = (inl‘𝑥))
5 fvres 5613 . . . . 5 (𝑥𝐵 → ((inr ↾ 𝐵)‘𝑥) = (inr‘𝑥))
65eqeq2d 2218 . . . 4 (𝑥𝐵 → (𝐶 = ((inr ↾ 𝐵)‘𝑥) ↔ 𝐶 = (inr‘𝑥)))
76rexbiia 2522 . . 3 (∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥) ↔ ∃𝑥𝐵 𝐶 = (inr‘𝑥))
84, 7orbi12i 766 . 2 ((∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥)) ↔ (∃𝑥𝐴 𝐶 = (inl‘𝑥) ∨ ∃𝑥𝐵 𝐶 = (inr‘𝑥)))
91, 8bitri 184 1 (𝐶 ∈ (𝐴𝐵) ↔ (∃𝑥𝐴 𝐶 = (inl‘𝑥) ∨ ∃𝑥𝐵 𝐶 = (inr‘𝑥)))
Colors of variables: wff set class
Syntax hints:  wb 105  wo 710   = wceq 1373  wcel 2177  wrex 2486  cres 4685  cfv 5280  cdju 7154  inlcinl 7162  inrcinr 7163
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-nul 4178  ax-pow 4226  ax-pr 4261  ax-un 4488
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-sbc 3003  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-br 4052  df-opab 4114  df-mpt 4115  df-tr 4151  df-id 4348  df-iord 4421  df-on 4423  df-suc 4426  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-f1 5285  df-fo 5286  df-f1o 5287  df-fv 5288  df-1st 6239  df-2nd 6240  df-1o 6515  df-dju 7155  df-inl 7164  df-inr 7165
This theorem is referenced by:  djuss  7187  updjud  7199  omp1eomlem  7211  0ct  7224  ctmlemr  7225  ctssdclemn0  7227  fodjuomnilemdc  7261  exmidfodomrlemeldju  7323
  Copyright terms: Public domain W3C validator