![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > genpprecll | GIF version |
Description: Pre-closure law for general operation on lower cuts. (Contributed by Jim Kingdon, 2-Oct-2019.) |
Ref | Expression |
---|---|
genpelvl.1 | ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ 〈{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1st ‘𝑤) ∧ 𝑧 ∈ (1st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2nd ‘𝑤) ∧ 𝑧 ∈ (2nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}〉) |
genpelvl.2 | ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q) |
Ref | Expression |
---|---|
genpprecll | ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐶 ∈ (1st ‘𝐴) ∧ 𝐷 ∈ (1st ‘𝐵)) → (𝐶𝐺𝐷) ∈ (1st ‘(𝐴𝐹𝐵)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2083 | . . 3 ⊢ (𝐶𝐺𝐷) = (𝐶𝐺𝐷) | |
2 | rspceov 5600 | . . 3 ⊢ ((𝐶 ∈ (1st ‘𝐴) ∧ 𝐷 ∈ (1st ‘𝐵) ∧ (𝐶𝐺𝐷) = (𝐶𝐺𝐷)) → ∃𝑔 ∈ (1st ‘𝐴)∃ℎ ∈ (1st ‘𝐵)(𝐶𝐺𝐷) = (𝑔𝐺ℎ)) | |
3 | 1, 2 | mp3an3 1258 | . 2 ⊢ ((𝐶 ∈ (1st ‘𝐴) ∧ 𝐷 ∈ (1st ‘𝐵)) → ∃𝑔 ∈ (1st ‘𝐴)∃ℎ ∈ (1st ‘𝐵)(𝐶𝐺𝐷) = (𝑔𝐺ℎ)) |
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 | genpelvl 6841 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐶𝐺𝐷) ∈ (1st ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (1st ‘𝐴)∃ℎ ∈ (1st ‘𝐵)(𝐶𝐺𝐷) = (𝑔𝐺ℎ))) |
7 | 3, 6 | syl5ibr 154 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐶 ∈ (1st ‘𝐴) ∧ 𝐷 ∈ (1st ‘𝐵)) → (𝐶𝐺𝐷) ∈ (1st ‘(𝐴𝐹𝐵)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ∧ w3a 920 = wceq 1285 ∈ wcel 1434 ∃wrex 2354 {crab 2357 〈cop 3420 ‘cfv 4953 (class class class)co 5565 ↦ cmpt2 5567 1st c1st 5818 2nd c2nd 5819 Qcnq 6609 Pcnp 6620 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 577 ax-in2 578 ax-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-bndl 1440 ax-4 1441 ax-13 1445 ax-14 1446 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2065 ax-coll 3914 ax-sep 3917 ax-pow 3969 ax-pr 3993 ax-un 4217 ax-setind 4309 ax-iinf 4358 |
This theorem depends on definitions: df-bi 115 df-3an 922 df-tru 1288 df-fal 1291 df-nf 1391 df-sb 1688 df-eu 1946 df-mo 1947 df-clab 2070 df-cleq 2076 df-clel 2079 df-nfc 2212 df-ne 2250 df-ral 2358 df-rex 2359 df-reu 2360 df-rab 2362 df-v 2613 df-sbc 2826 df-csb 2919 df-dif 2985 df-un 2987 df-in 2989 df-ss 2996 df-pw 3403 df-sn 3423 df-pr 3424 df-op 3426 df-uni 3623 df-int 3658 df-iun 3701 df-br 3807 df-opab 3861 df-mpt 3862 df-id 4077 df-iom 4361 df-xp 4398 df-rel 4399 df-cnv 4400 df-co 4401 df-dm 4402 df-rn 4403 df-res 4404 df-ima 4405 df-iota 4918 df-fun 4955 df-fn 4956 df-f 4957 df-f1 4958 df-fo 4959 df-f1o 4960 df-fv 4961 df-ov 5568 df-oprab 5569 df-mpt2 5570 df-1st 5820 df-2nd 5821 df-qs 6201 df-ni 6633 df-nqqs 6677 df-inp 6795 |
This theorem is referenced by: genpml 6846 genprndl 6850 addnqprl 6858 mulnqprl 6897 distrlem1prl 6911 distrlem4prl 6913 ltaddpr 6926 ltexprlemrl 6939 addcanprleml 6943 addcanprlemu 6944 |
Copyright terms: Public domain | W3C validator |