| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ctiunctlemuom | GIF version | ||
| Description: Lemma for ctiunct 13314. (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 3333 | . . 3 ⊢ {𝑧 ∈ ω ∣ ((1st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇)} ⊆ ω | |
| 3 | 1, 2 | eqsstri 3280 | . 2 ⊢ 𝑈 ⊆ ω |
| 4 | 3 | a1i 9 | 1 ⊢ (𝜑 → 𝑈 ⊆ ω) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 DECID wdc 846 = wceq 1402 ∈ wcel 2209 ∀wral 2528 {crab 2532 ⦋csb 3147 ⊆ wss 3220 ωcom 4735 × cxp 4770 –onto→wfo 5373 –1-1-onto→wf1o 5374 ‘cfv 5375 1st c1st 6366 2nd c2nd 6367 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-rab 2537 df-in 3226 df-ss 3233 |
| This theorem is referenced by: ctiunct 13314 |
| Copyright terms: Public domain | W3C validator |