Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > djulcl | GIF version |
Description: Left closure of disjoint union. (Contributed by Jim Kingdon, 21-Jun-2022.) |
Ref | Expression |
---|---|
djulcl | ⊢ (𝐶 ∈ 𝐴 → (inl‘𝐶) ∈ (𝐴 ⊔ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2720 | . . 3 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ V) | |
2 | 0ex 4087 | . . . . 5 ⊢ ∅ ∈ V | |
3 | 2 | snid 3587 | . . . 4 ⊢ ∅ ∈ {∅} |
4 | opelxpi 4611 | . . . 4 ⊢ ((∅ ∈ {∅} ∧ 𝐶 ∈ 𝐴) → 〈∅, 𝐶〉 ∈ ({∅} × 𝐴)) | |
5 | 3, 4 | mpan 421 | . . 3 ⊢ (𝐶 ∈ 𝐴 → 〈∅, 𝐶〉 ∈ ({∅} × 𝐴)) |
6 | opeq2 3738 | . . . 4 ⊢ (𝑥 = 𝐶 → 〈∅, 𝑥〉 = 〈∅, 𝐶〉) | |
7 | df-inl 6977 | . . . 4 ⊢ inl = (𝑥 ∈ V ↦ 〈∅, 𝑥〉) | |
8 | 6, 7 | fvmptg 5537 | . . 3 ⊢ ((𝐶 ∈ V ∧ 〈∅, 𝐶〉 ∈ ({∅} × 𝐴)) → (inl‘𝐶) = 〈∅, 𝐶〉) |
9 | 1, 5, 8 | syl2anc 409 | . 2 ⊢ (𝐶 ∈ 𝐴 → (inl‘𝐶) = 〈∅, 𝐶〉) |
10 | elun1 3270 | . . . 4 ⊢ (〈∅, 𝐶〉 ∈ ({∅} × 𝐴) → 〈∅, 𝐶〉 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵))) | |
11 | 5, 10 | syl 14 | . . 3 ⊢ (𝐶 ∈ 𝐴 → 〈∅, 𝐶〉 ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵))) |
12 | df-dju 6968 | . . 3 ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵)) | |
13 | 11, 12 | eleqtrrdi 2248 | . 2 ⊢ (𝐶 ∈ 𝐴 → 〈∅, 𝐶〉 ∈ (𝐴 ⊔ 𝐵)) |
14 | 9, 13 | eqeltrd 2231 | 1 ⊢ (𝐶 ∈ 𝐴 → (inl‘𝐶) ∈ (𝐴 ⊔ 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1332 ∈ wcel 2125 Vcvv 2709 ∪ cun 3096 ∅c0 3390 {csn 3556 〈cop 3559 × cxp 4577 ‘cfv 5163 1oc1o 6346 ⊔ cdju 6967 inlcinl 6975 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1481 ax-10 1482 ax-11 1483 ax-i12 1484 ax-bndl 1486 ax-4 1487 ax-17 1503 ax-i9 1507 ax-ial 1511 ax-i5r 1512 ax-14 2128 ax-ext 2136 ax-sep 4078 ax-nul 4086 ax-pow 4130 ax-pr 4164 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1740 df-eu 2006 df-mo 2007 df-clab 2141 df-cleq 2147 df-clel 2150 df-nfc 2285 df-ral 2437 df-rex 2438 df-v 2711 df-sbc 2934 df-dif 3100 df-un 3102 df-in 3104 df-ss 3111 df-nul 3391 df-pw 3541 df-sn 3562 df-pr 3563 df-op 3565 df-uni 3769 df-br 3962 df-opab 4022 df-mpt 4023 df-id 4248 df-xp 4585 df-rel 4586 df-cnv 4587 df-co 4588 df-dm 4589 df-iota 5128 df-fun 5165 df-fv 5171 df-dju 6968 df-inl 6977 |
This theorem is referenced by: djulclb 6985 updjudhcoinlf 7010 omp1eomlem 7024 difinfsnlem 7029 difinfsn 7030 ctmlemr 7038 ctm 7039 ctssdclemn0 7040 ctssdccl 7041 fodju0 7069 exmidfodomrlemr 7116 exmidfodomrlemrALT 7117 subctctexmid 13520 |
Copyright terms: Public domain | W3C validator |