Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > exmidontriimlem2 | GIF version |
Description: Lemma for exmidontriim 7143. (Contributed by Jim Kingdon, 12-Aug-2024.) |
Ref | Expression |
---|---|
exmidontriimlem2.b | ⊢ (𝜑 → 𝐵 ∈ On) |
exmidontriimlem2.em | ⊢ (𝜑 → EXMID) |
exmidontriimlem2.hb | ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 (𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦 ∨ 𝑦 ∈ 𝐴)) |
Ref | Expression |
---|---|
exmidontriimlem2 | ⊢ (𝜑 → (𝐴 ∈ 𝐵 ∨ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | exmidontriimlem2.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ On) | |
2 | 1 | ad2antrr 480 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝐴 ∈ 𝑦) → 𝐵 ∈ On) |
3 | simpr 109 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝐴 ∈ 𝑦) → 𝐴 ∈ 𝑦) | |
4 | simplr 520 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝐴 ∈ 𝑦) → 𝑦 ∈ 𝐵) | |
5 | 3, 4 | jca 304 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝐴 ∈ 𝑦) → (𝐴 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)) |
6 | ontr1 4348 | . . . . 5 ⊢ (𝐵 ∈ On → ((𝐴 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) → 𝐴 ∈ 𝐵)) | |
7 | 2, 5, 6 | sylc 62 | . . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝐴 ∈ 𝑦) → 𝐴 ∈ 𝐵) |
8 | 7 | r19.29an 2599 | . . 3 ⊢ ((𝜑 ∧ ∃𝑦 ∈ 𝐵 𝐴 ∈ 𝑦) → 𝐴 ∈ 𝐵) |
9 | 8 | orcd 723 | . 2 ⊢ ((𝜑 ∧ ∃𝑦 ∈ 𝐵 𝐴 ∈ 𝑦) → (𝐴 ∈ 𝐵 ∨ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴)) |
10 | simpr 109 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝐴 = 𝑦) → 𝐴 = 𝑦) | |
11 | simplr 520 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝐴 = 𝑦) → 𝑦 ∈ 𝐵) | |
12 | 10, 11 | eqeltrd 2234 | . . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝐴 = 𝑦) → 𝐴 ∈ 𝐵) |
13 | 12 | r19.29an 2599 | . . 3 ⊢ ((𝜑 ∧ ∃𝑦 ∈ 𝐵 𝐴 = 𝑦) → 𝐴 ∈ 𝐵) |
14 | 13 | orcd 723 | . 2 ⊢ ((𝜑 ∧ ∃𝑦 ∈ 𝐵 𝐴 = 𝑦) → (𝐴 ∈ 𝐵 ∨ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴)) |
15 | simpr 109 | . . 3 ⊢ ((𝜑 ∧ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴) → ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴) | |
16 | 15 | olcd 724 | . 2 ⊢ ((𝜑 ∧ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴) → (𝐴 ∈ 𝐵 ∨ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴)) |
17 | exmidontriimlem2.hb | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 (𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦 ∨ 𝑦 ∈ 𝐴)) | |
18 | exmidontriimlem2.em | . . 3 ⊢ (𝜑 → EXMID) | |
19 | exmidontriimlem1 7139 | . . 3 ⊢ ((∀𝑦 ∈ 𝐵 (𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦 ∨ 𝑦 ∈ 𝐴) ∧ EXMID) → (∃𝑦 ∈ 𝐵 𝐴 ∈ 𝑦 ∨ ∃𝑦 ∈ 𝐵 𝐴 = 𝑦 ∨ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴)) | |
20 | 17, 18, 19 | syl2anc 409 | . 2 ⊢ (𝜑 → (∃𝑦 ∈ 𝐵 𝐴 ∈ 𝑦 ∨ ∃𝑦 ∈ 𝐵 𝐴 = 𝑦 ∨ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴)) |
21 | 9, 14, 16, 20 | mpjao3dan 1289 | 1 ⊢ (𝜑 → (𝐴 ∈ 𝐵 ∨ ∀𝑦 ∈ 𝐵 𝑦 ∈ 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∨ wo 698 ∨ w3o 962 = wceq 1335 ∈ wcel 2128 ∀wral 2435 ∃wrex 2436 EXMIDwem 4154 Oncon0 4322 |
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 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-14 2131 ax-ext 2139 ax-sep 4082 ax-nul 4090 ax-pow 4134 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ral 2440 df-rex 2441 df-rab 2444 df-v 2714 df-dif 3104 df-in 3108 df-ss 3115 df-nul 3395 df-pw 3545 df-sn 3566 df-uni 3773 df-tr 4063 df-exmid 4155 df-iord 4325 df-on 4327 |
This theorem is referenced by: exmidontriimlem3 7141 |
Copyright terms: Public domain | W3C validator |