| 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 2234 | . . 3 ⊢ (𝐶𝐺𝐷) = (𝐶𝐺𝐷) | |
| 2 | rspceov 6101 | . . 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 7844 | . 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 2205 ∃wrex 2523 {crab 2526 〈cop 3697 ‘cfv 5357 (class class class)co 6058 ∈ cmpo 6060 1st c1st 6345 2nd c2nd 6346 Qcnq 7611 Pcnp 7622 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 |
| 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 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-qs 6786 df-ni 7635 df-nqqs 7679 df-inp 7797 |
| This theorem is referenced by: genpmu 7849 genprndu 7853 addnqpru 7861 mulnqpru 7900 distrlem1pru 7914 distrlem4pru 7916 ltexprlemru 7943 addcanprleml 7945 addcanprlemu 7946 |
| Copyright terms: Public domain | W3C validator |