| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eldju | GIF version | ||
| Description: Element of a disjoint union. (Contributed by BJ and Jim Kingdon, 23-Jun-2022.) |
| Ref | Expression |
|---|---|
| eldju | ⊢ (𝐶 ∈ (𝐴 ⊔ 𝐵) ↔ (∃𝑥 ∈ 𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥 ∈ 𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | djuunr 7256 | . . . 4 ⊢ (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵)) = (𝐴 ⊔ 𝐵) | |
| 2 | 1 | eqcomi 2233 | . . 3 ⊢ (𝐴 ⊔ 𝐵) = (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵)) |
| 3 | 2 | eleq2i 2296 | . 2 ⊢ (𝐶 ∈ (𝐴 ⊔ 𝐵) ↔ 𝐶 ∈ (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵))) |
| 4 | elun 3346 | . . 3 ⊢ (𝐶 ∈ (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵)) ↔ (𝐶 ∈ ran (inl ↾ 𝐴) ∨ 𝐶 ∈ ran (inr ↾ 𝐵))) | |
| 5 | djulf1or 7246 | . . . . . 6 ⊢ (inl ↾ 𝐴):𝐴–1-1-onto→({∅} × 𝐴) | |
| 6 | f1ofn 5581 | . . . . . 6 ⊢ ((inl ↾ 𝐴):𝐴–1-1-onto→({∅} × 𝐴) → (inl ↾ 𝐴) Fn 𝐴) | |
| 7 | fvelrnb 5689 | . . . . . 6 ⊢ ((inl ↾ 𝐴) Fn 𝐴 → (𝐶 ∈ ran (inl ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 ((inl ↾ 𝐴)‘𝑥) = 𝐶)) | |
| 8 | 5, 6, 7 | mp2b 8 | . . . . 5 ⊢ (𝐶 ∈ ran (inl ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 ((inl ↾ 𝐴)‘𝑥) = 𝐶) |
| 9 | eqcom 2231 | . . . . . 6 ⊢ (((inl ↾ 𝐴)‘𝑥) = 𝐶 ↔ 𝐶 = ((inl ↾ 𝐴)‘𝑥)) | |
| 10 | 9 | rexbii 2537 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ((inl ↾ 𝐴)‘𝑥) = 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥)) |
| 11 | 8, 10 | bitri 184 | . . . 4 ⊢ (𝐶 ∈ ran (inl ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥)) |
| 12 | djurf1or 7247 | . . . . . 6 ⊢ (inr ↾ 𝐵):𝐵–1-1-onto→({1o} × 𝐵) | |
| 13 | f1ofn 5581 | . . . . . 6 ⊢ ((inr ↾ 𝐵):𝐵–1-1-onto→({1o} × 𝐵) → (inr ↾ 𝐵) Fn 𝐵) | |
| 14 | fvelrnb 5689 | . . . . . 6 ⊢ ((inr ↾ 𝐵) Fn 𝐵 → (𝐶 ∈ ran (inr ↾ 𝐵) ↔ ∃𝑥 ∈ 𝐵 ((inr ↾ 𝐵)‘𝑥) = 𝐶)) | |
| 15 | 12, 13, 14 | mp2b 8 | . . . . 5 ⊢ (𝐶 ∈ ran (inr ↾ 𝐵) ↔ ∃𝑥 ∈ 𝐵 ((inr ↾ 𝐵)‘𝑥) = 𝐶) |
| 16 | eqcom 2231 | . . . . . 6 ⊢ (((inr ↾ 𝐵)‘𝑥) = 𝐶 ↔ 𝐶 = ((inr ↾ 𝐵)‘𝑥)) | |
| 17 | 16 | rexbii 2537 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐵 ((inr ↾ 𝐵)‘𝑥) = 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥)) |
| 18 | 15, 17 | bitri 184 | . . . 4 ⊢ (𝐶 ∈ ran (inr ↾ 𝐵) ↔ ∃𝑥 ∈ 𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥)) |
| 19 | 11, 18 | orbi12i 769 | . . 3 ⊢ ((𝐶 ∈ ran (inl ↾ 𝐴) ∨ 𝐶 ∈ ran (inr ↾ 𝐵)) ↔ (∃𝑥 ∈ 𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥 ∈ 𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥))) |
| 20 | 4, 19 | bitri 184 | . 2 ⊢ (𝐶 ∈ (ran (inl ↾ 𝐴) ∪ ran (inr ↾ 𝐵)) ↔ (∃𝑥 ∈ 𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥 ∈ 𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥))) |
| 21 | 3, 20 | bitri 184 | 1 ⊢ (𝐶 ∈ (𝐴 ⊔ 𝐵) ↔ (∃𝑥 ∈ 𝐴 𝐶 = ((inl ↾ 𝐴)‘𝑥) ∨ ∃𝑥 ∈ 𝐵 𝐶 = ((inr ↾ 𝐵)‘𝑥))) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ∃wrex 2509 ∪ cun 3196 ∅c0 3492 {csn 3667 × cxp 4721 ran crn 4724 ↾ cres 4725 Fn wfn 5319 –1-1-onto→wf1o 5323 ‘cfv 5324 1oc1o 6570 ⊔ cdju 7227 inlcinl 7235 inrcinr 7236 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-suc 4466 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-1st 6298 df-2nd 6299 df-1o 6577 df-dju 7228 df-inl 7237 df-inr 7238 |
| This theorem is referenced by: djur 7259 exmidfodomrlemreseldju 7401 |
| Copyright terms: Public domain | W3C validator |