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

Theorem eldju 7327
Description: Element of a disjoint union. (Contributed by BJ and Jim Kingdon, 23-Jun-2022.)
Assertion
Ref Expression
eldju (𝐶 ∈ (𝐴𝐵) ↔ (∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem eldju
StepHypRef Expression
1 djuunr 7325 . . . 4 (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵)) = (𝐴𝐵)
21eqcomi 2235 . . 3 (𝐴𝐵) = (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵))
32eleq2i 2298 . 2 (𝐶 ∈ (𝐴𝐵) ↔ 𝐶 ∈ (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵)))
4 elun 3350 . . 3 (𝐶 ∈ (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵)) ↔ (𝐶 ∈ ran (inl ↾ 𝐴) ∨ 𝐶 ∈ ran (inr ↾ 𝐵)))
5 djulf1or 7315 . . . . . 6 (inl ↾ 𝐴):𝐴1-1-onto→({∅} × 𝐴)
6 f1ofn 5593 . . . . . 6 ((inl ↾ 𝐴):𝐴1-1-onto→({∅} × 𝐴) → (inl ↾ 𝐴) Fn 𝐴)
7 fvelrnb 5702 . . . . . 6 ((inl ↾ 𝐴) Fn 𝐴 → (𝐶 ∈ ran (inl ↾ 𝐴) ↔ ∃𝑥𝐴 ((inl ↾ 𝐴)‘𝑥) = 𝐶))
85, 6, 7mp2b 8 . . . . 5 (𝐶 ∈ ran (inl ↾ 𝐴) ↔ ∃𝑥𝐴 ((inl ↾ 𝐴)‘𝑥) = 𝐶)
9 eqcom 2233 . . . . . 6 (((inl ↾ 𝐴)‘𝑥) = 𝐶𝐶 = ((inl ↾ 𝐴)‘𝑥))
109rexbii 2540 . . . . 5 (∃𝑥𝐴 ((inl ↾ 𝐴)‘𝑥) = 𝐶 ↔ ∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥))
118, 10bitri 184 . . . 4 (𝐶 ∈ ran (inl ↾ 𝐴) ↔ ∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥))
12 djurf1or 7316 . . . . . 6 (inr ↾ 𝐵):𝐵1-1-onto→({1o} × 𝐵)
13 f1ofn 5593 . . . . . 6 ((inr ↾ 𝐵):𝐵1-1-onto→({1o} × 𝐵) → (inr ↾ 𝐵) Fn 𝐵)
14 fvelrnb 5702 . . . . . 6 ((inr ↾ 𝐵) Fn 𝐵 → (𝐶 ∈ ran (inr ↾ 𝐵) ↔ ∃𝑥𝐵 ((inr ↾ 𝐵)‘𝑥) = 𝐶))
1512, 13, 14mp2b 8 . . . . 5 (𝐶 ∈ ran (inr ↾ 𝐵) ↔ ∃𝑥𝐵 ((inr ↾ 𝐵)‘𝑥) = 𝐶)
16 eqcom 2233 . . . . . 6 (((inr ↾ 𝐵)‘𝑥) = 𝐶𝐶 = ((inr ↾ 𝐵)‘𝑥))
1716rexbii 2540 . . . . 5 (∃𝑥𝐵 ((inr ↾ 𝐵)‘𝑥) = 𝐶 ↔ ∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥))
1815, 17bitri 184 . . . 4 (𝐶 ∈ ran (inr ↾ 𝐵) ↔ ∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥))
1911, 18orbi12i 772 . . 3 ((𝐶 ∈ ran (inl ↾ 𝐴) ∨ 𝐶 ∈ ran (inr ↾ 𝐵)) ↔ (∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥)))
204, 19bitri 184 . 2 (𝐶 ∈ (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵)) ↔ (∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥)))
213, 20bitri 184 1 (𝐶 ∈ (𝐴𝐵) ↔ (∃𝑥𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥)))
Colors of variables: wff set class
Syntax hints:  wb 105  wo 716   = wceq 1398  wcel 2202  wrex 2512  cun 3199  c0 3496  {csn 3673   × cxp 4729  ran crn 4732  cres 4733   Fn wfn 5328  1-1-ontowf1o 5332  cfv 5333  1oc1o 6618  cdju 7296  inlcinl 7304  inrcinr 7305
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1st 6312  df-2nd 6313  df-1o 6625  df-dju 7297  df-inl 7306  df-inr 7307
This theorem is referenced by:  djur  7328  exmidfodomrlemreseldju  7471
  Copyright terms: Public domain W3C validator