| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > genppreclu | GIF version | ||
| Description: Pre-closure law for general operation on upper cuts. (Contributed by Jim Kingdon, 7-Nov-2019.) |
| Ref | Expression |
|---|---|
| genpelvl.1 | ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ 〈{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1st ‘𝑤) ∧ 𝑧 ∈ (1st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2nd ‘𝑤) ∧ 𝑧 ∈ (2nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}〉) |
| genpelvl.2 | ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q) |
| Ref | Expression |
|---|---|
| genppreclu | ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐶 ∈ (2nd ‘𝐴) ∧ 𝐷 ∈ (2nd ‘𝐵)) → (𝐶𝐺𝐷) ∈ (2nd ‘(𝐴𝐹𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2232 | . . 3 ⊢ (𝐶𝐺𝐷) = (𝐶𝐺𝐷) | |
| 2 | rspceov 6092 | . . 3 ⊢ ((𝐶 ∈ (2nd ‘𝐴) ∧ 𝐷 ∈ (2nd ‘𝐵) ∧ (𝐶𝐺𝐷) = (𝐶𝐺𝐷)) → ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)(𝐶𝐺𝐷) = (𝑔𝐺ℎ)) | |
| 3 | 1, 2 | mp3an3 1363 | . 2 ⊢ ((𝐶 ∈ (2nd ‘𝐴) ∧ 𝐷 ∈ (2nd ‘𝐵)) → ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)(𝐶𝐺𝐷) = (𝑔𝐺ℎ)) |
| 4 | genpelvl.1 | . . 3 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ 〈{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1st ‘𝑤) ∧ 𝑧 ∈ (1st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2nd ‘𝑤) ∧ 𝑧 ∈ (2nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}〉) | |
| 5 | genpelvl.2 | . . 3 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q) | |
| 6 | 4, 5 | genpelvu 7827 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐶𝐺𝐷) ∈ (2nd ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (2nd ‘𝐴)∃ℎ ∈ (2nd ‘𝐵)(𝐶𝐺𝐷) = (𝑔𝐺ℎ))) |
| 7 | 3, 6 | imbitrrid 156 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐶 ∈ (2nd ‘𝐴) ∧ 𝐷 ∈ (2nd ‘𝐵)) → (𝐶𝐺𝐷) ∈ (2nd ‘(𝐴𝐹𝐵)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 ∃wrex 2521 {crab 2524 〈cop 3691 ‘cfv 5351 (class class class)co 6049 ∈ cmpo 6051 1st c1st 6331 2nd c2nd 6332 Qcnq 7594 Pcnp 7605 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-qs 6772 df-ni 7618 df-nqqs 7662 df-inp 7780 |
| This theorem is referenced by: genpmu 7832 genprndu 7836 addnqpru 7844 mulnqpru 7883 distrlem1pru 7897 distrlem4pru 7899 ltexprlemru 7926 addcanprleml 7928 addcanprlemu 7929 |
| Copyright terms: Public domain | W3C validator |