| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > exmidfodomrlemeldju | GIF version | ||
| Description: Lemma for exmidfodomr 7405. A variant of djur 7259. (Contributed by Jim Kingdon, 2-Jul-2022.) |
| Ref | Expression |
|---|---|
| exmidfodomrlemeldju.a | ⊢ (𝜑 → 𝐴 ⊆ 1o) |
| exmidfodomrlemeldju.el | ⊢ (𝜑 → 𝐵 ∈ (𝐴 ⊔ 1o)) |
| Ref | Expression |
|---|---|
| exmidfodomrlemeldju | ⊢ (𝜑 → (𝐵 = (inl‘∅) ∨ 𝐵 = (inr‘∅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | exmidfodomrlemeldju.a | . . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ 1o) | |
| 2 | 1 | sselda 3225 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 1o) |
| 3 | el1o 6600 | . . . . . . . . 9 ⊢ (𝑥 ∈ 1o ↔ 𝑥 = ∅) | |
| 4 | 2, 3 | sylib 122 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 = ∅) |
| 5 | 4 | fveq2d 5639 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (inl‘𝑥) = (inl‘∅)) |
| 6 | 5 | eqeq2d 2241 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 = (inl‘𝑥) ↔ 𝐵 = (inl‘∅))) |
| 7 | 6 | biimpd 144 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 = (inl‘𝑥) → 𝐵 = (inl‘∅))) |
| 8 | 7 | rexlimdva 2648 | . . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝐵 = (inl‘𝑥) → 𝐵 = (inl‘∅))) |
| 9 | 8 | imp 124 | . . 3 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 𝐴 𝐵 = (inl‘𝑥)) → 𝐵 = (inl‘∅)) |
| 10 | 9 | orcd 738 | . 2 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 𝐴 𝐵 = (inl‘𝑥)) → (𝐵 = (inl‘∅) ∨ 𝐵 = (inr‘∅))) |
| 11 | simpr 110 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 1o) → 𝑥 ∈ 1o) | |
| 12 | 11, 3 | sylib 122 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 1o) → 𝑥 = ∅) |
| 13 | 12 | fveq2d 5639 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 1o) → (inr‘𝑥) = (inr‘∅)) |
| 14 | 13 | eqeq2d 2241 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 1o) → (𝐵 = (inr‘𝑥) ↔ 𝐵 = (inr‘∅))) |
| 15 | 14 | biimpd 144 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 1o) → (𝐵 = (inr‘𝑥) → 𝐵 = (inr‘∅))) |
| 16 | 15 | rexlimdva 2648 | . . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥) → 𝐵 = (inr‘∅))) |
| 17 | 16 | imp 124 | . . 3 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥)) → 𝐵 = (inr‘∅)) |
| 18 | 17 | olcd 739 | . 2 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥)) → (𝐵 = (inl‘∅) ∨ 𝐵 = (inr‘∅))) |
| 19 | exmidfodomrlemeldju.el | . . 3 ⊢ (𝜑 → 𝐵 ∈ (𝐴 ⊔ 1o)) | |
| 20 | djur 7259 | . . 3 ⊢ (𝐵 ∈ (𝐴 ⊔ 1o) ↔ (∃𝑥 ∈ 𝐴 𝐵 = (inl‘𝑥) ∨ ∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥))) | |
| 21 | 19, 20 | sylib 122 | . 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝐵 = (inl‘𝑥) ∨ ∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥))) |
| 22 | 10, 18, 21 | mpjaodan 803 | 1 ⊢ (𝜑 → (𝐵 = (inl‘∅) ∨ 𝐵 = (inr‘∅))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ∃wrex 2509 ⊆ wss 3198 ∅c0 3492 ‘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: exmidfodomrlemr 7403 |
| Copyright terms: Public domain | W3C validator |