ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  genpprecll GIF version

Theorem genpprecll 7574
Description: Pre-closure law for general operation on lower cuts. (Contributed by Jim Kingdon, 2-Oct-2019.)
Hypotheses
Ref Expression
genpelvl.1 𝐹 = (𝑤P, 𝑣P ↦ ⟨{𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (1st𝑤) ∧ 𝑧 ∈ (1st𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥Q ∣ ∃𝑦Q𝑧Q (𝑦 ∈ (2nd𝑤) ∧ 𝑧 ∈ (2nd𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
genpelvl.2 ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)
Assertion
Ref Expression
genpprecll ((𝐴P𝐵P) → ((𝐶 ∈ (1st𝐴) ∧ 𝐷 ∈ (1st𝐵)) → (𝐶𝐺𝐷) ∈ (1st ‘(𝐴𝐹𝐵))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣   𝑥,𝐺,𝑦,𝑧,𝑤,𝑣
Allowed substitution hints:   𝐶(𝑥,𝑦,𝑧,𝑤,𝑣)   𝐷(𝑥,𝑦,𝑧,𝑤,𝑣)   𝐹(𝑥,𝑦,𝑧,𝑤,𝑣)

Proof of Theorem genpprecll
Dummy variables 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2193 . . 3 (𝐶𝐺𝐷) = (𝐶𝐺𝐷)
2 rspceov 5960 . . 3 ((𝐶 ∈ (1st𝐴) ∧ 𝐷 ∈ (1st𝐵) ∧ (𝐶𝐺𝐷) = (𝐶𝐺𝐷)) → ∃𝑔 ∈ (1st𝐴)∃ ∈ (1st𝐵)(𝐶𝐺𝐷) = (𝑔𝐺))
31, 2mp3an3 1337 . 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)
64, 5genpelvl 7572 . 2 ((𝐴P𝐵P) → ((𝐶𝐺𝐷) ∈ (1st ‘(𝐴𝐹𝐵)) ↔ ∃𝑔 ∈ (1st𝐴)∃ ∈ (1st𝐵)(𝐶𝐺𝐷) = (𝑔𝐺)))
73, 6imbitrrid 156 1 ((𝐴P𝐵P) → ((𝐶 ∈ (1st𝐴) ∧ 𝐷 ∈ (1st𝐵)) → (𝐶𝐺𝐷) ∈ (1st ‘(𝐴𝐹𝐵))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2164  wrex 2473  {crab 2476  cop 3621  cfv 5254  (class class class)co 5918  cmpo 5920  1st c1st 6191  2nd c2nd 6192  Qcnq 7340  Pcnp 7351
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-qs 6593  df-ni 7364  df-nqqs 7408  df-inp 7526
This theorem is referenced by:  genpml  7577  genprndl  7581  addnqprl  7589  mulnqprl  7628  distrlem1prl  7642  distrlem4prl  7644  ltaddpr  7657  ltexprlemrl  7670  addcanprleml  7674  addcanprlemu  7675
  Copyright terms: Public domain W3C validator