| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ctiunctlemuom | GIF version | ||
| Description: Lemma for ctiunct 12926. (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 3286 | . . 3 ⊢ {𝑧 ∈ ω ∣ ((1st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇)} ⊆ ω | |
| 3 | 1, 2 | eqsstri 3233 | . 2 ⊢ 𝑈 ⊆ ω |
| 4 | 3 | a1i 9 | 1 ⊢ (𝜑 → 𝑈 ⊆ ω) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 DECID wdc 836 = wceq 1373 ∈ wcel 2178 ∀wral 2486 {crab 2490 ⦋csb 3101 ⊆ wss 3174 ωcom 4656 × cxp 4691 –onto→wfo 5288 –1-1-onto→wf1o 5289 ‘cfv 5290 1st c1st 6247 2nd c2nd 6248 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-rab 2495 df-in 3180 df-ss 3187 |
| This theorem is referenced by: ctiunct 12926 |
| Copyright terms: Public domain | W3C validator |