| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ctiunctlemuom | GIF version | ||
| Description: Lemma for ctiunct 13062. (Contributed by Jim Kingdon, 28-Oct-2023.) |
| Ref | Expression |
|---|---|
| ctiunct.som | ⊢ (𝜑 → 𝑆 ⊆ ω) |
| ctiunct.sdc | ⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆) |
| ctiunct.f | ⊢ (𝜑 → 𝐹:𝑆–onto→𝐴) |
| ctiunct.tom | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑇 ⊆ ω) |
| ctiunct.tdc | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇) |
| ctiunct.g | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐺:𝑇–onto→𝐵) |
| ctiunct.j | ⊢ (𝜑 → 𝐽:ω–1-1-onto→(ω × ω)) |
| ctiunct.u | ⊢ 𝑈 = {𝑧 ∈ ω ∣ ((1st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇)} |
| Ref | Expression |
|---|---|
| ctiunctlemuom | ⊢ (𝜑 → 𝑈 ⊆ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ctiunct.u | . . 3 ⊢ 𝑈 = {𝑧 ∈ ω ∣ ((1st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇)} | |
| 2 | ssrab2 3312 | . . 3 ⊢ {𝑧 ∈ ω ∣ ((1st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇)} ⊆ ω | |
| 3 | 1, 2 | eqsstri 3259 | . 2 ⊢ 𝑈 ⊆ ω |
| 4 | 3 | a1i 9 | 1 ⊢ (𝜑 → 𝑈 ⊆ ω) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 DECID wdc 841 = wceq 1397 ∈ wcel 2202 ∀wral 2510 {crab 2514 ⦋csb 3127 ⊆ wss 3200 ωcom 4688 × cxp 4723 –onto→wfo 5324 –1-1-onto→wf1o 5325 ‘cfv 5326 1st c1st 6301 2nd c2nd 6302 |
| 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-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-rab 2519 df-in 3206 df-ss 3213 |
| This theorem is referenced by: ctiunct 13062 |
| Copyright terms: Public domain | W3C validator |