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

Theorem erovlem 6228
Description: Lemma for eroprf 6229. (Contributed by Jeff Madsen, 10-Jun-2010.) (Revised by Mario Carneiro, 30-Dec-2014.)
Hypotheses
Ref Expression
eropr.1 𝐽 = (𝐴 / 𝑅)
eropr.2 𝐾 = (𝐵 / 𝑆)
eropr.3 (𝜑𝑇𝑍)
eropr.4 (𝜑𝑅 Er 𝑈)
eropr.5 (𝜑𝑆 Er 𝑉)
eropr.6 (𝜑𝑇 Er 𝑊)
eropr.7 (𝜑𝐴𝑈)
eropr.8 (𝜑𝐵𝑉)
eropr.9 (𝜑𝐶𝑊)
eropr.10 (𝜑+ :(𝐴 × 𝐵)⟶𝐶)
eropr.11 ((𝜑 ∧ ((𝑟𝐴𝑠𝐴) ∧ (𝑡𝐵𝑢𝐵))) → ((𝑟𝑅𝑠𝑡𝑆𝑢) → (𝑟 + 𝑡)𝑇(𝑠 + 𝑢)))
eropr.12 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)}
Assertion
Ref Expression
erovlem (𝜑 = (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
Distinct variable groups:   𝑞,𝑝,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧,𝐴   𝐵,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝐽,𝑝,𝑞,𝑥,𝑦,𝑧   𝑅,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝐾,𝑝,𝑞,𝑥,𝑦,𝑧   𝑆,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   + ,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝜑,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝑇,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐶(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   (𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑈(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝐽(𝑢,𝑡,𝑠,𝑟)   𝐾(𝑢,𝑡,𝑠,𝑟)   𝑉(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑊(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑍(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)

Proof of Theorem erovlem
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 simpl 106 . . . . . . . 8 (((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → (𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆))
21reximi 2433 . . . . . . 7 (∃𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → ∃𝑞𝐵 (𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆))
32reximi 2433 . . . . . 6 (∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → ∃𝑝𝐴𝑞𝐵 (𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆))
4 eropr.1 . . . . . . . . . 10 𝐽 = (𝐴 / 𝑅)
54eleq2i 2120 . . . . . . . . 9 (𝑥𝐽𝑥 ∈ (𝐴 / 𝑅))
6 vex 2577 . . . . . . . . . 10 𝑥 ∈ V
76elqs 6187 . . . . . . . . 9 (𝑥 ∈ (𝐴 / 𝑅) ↔ ∃𝑝𝐴 𝑥 = [𝑝]𝑅)
85, 7bitri 177 . . . . . . . 8 (𝑥𝐽 ↔ ∃𝑝𝐴 𝑥 = [𝑝]𝑅)
9 eropr.2 . . . . . . . . . 10 𝐾 = (𝐵 / 𝑆)
109eleq2i 2120 . . . . . . . . 9 (𝑦𝐾𝑦 ∈ (𝐵 / 𝑆))
11 vex 2577 . . . . . . . . . 10 𝑦 ∈ V
1211elqs 6187 . . . . . . . . 9 (𝑦 ∈ (𝐵 / 𝑆) ↔ ∃𝑞𝐵 𝑦 = [𝑞]𝑆)
1310, 12bitri 177 . . . . . . . 8 (𝑦𝐾 ↔ ∃𝑞𝐵 𝑦 = [𝑞]𝑆)
148, 13anbi12i 441 . . . . . . 7 ((𝑥𝐽𝑦𝐾) ↔ (∃𝑝𝐴 𝑥 = [𝑝]𝑅 ∧ ∃𝑞𝐵 𝑦 = [𝑞]𝑆))
15 reeanv 2496 . . . . . . 7 (∃𝑝𝐴𝑞𝐵 (𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ↔ (∃𝑝𝐴 𝑥 = [𝑝]𝑅 ∧ ∃𝑞𝐵 𝑦 = [𝑞]𝑆))
1614, 15bitr4i 180 . . . . . 6 ((𝑥𝐽𝑦𝐾) ↔ ∃𝑝𝐴𝑞𝐵 (𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆))
173, 16sylibr 141 . . . . 5 (∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → (𝑥𝐽𝑦𝐾))
1817pm4.71ri 378 . . . 4 (∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ ((𝑥𝐽𝑦𝐾) ∧ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
19 eropr.3 . . . . . . . 8 (𝜑𝑇𝑍)
20 eropr.4 . . . . . . . 8 (𝜑𝑅 Er 𝑈)
21 eropr.5 . . . . . . . 8 (𝜑𝑆 Er 𝑉)
22 eropr.6 . . . . . . . 8 (𝜑𝑇 Er 𝑊)
23 eropr.7 . . . . . . . 8 (𝜑𝐴𝑈)
24 eropr.8 . . . . . . . 8 (𝜑𝐵𝑉)
25 eropr.9 . . . . . . . 8 (𝜑𝐶𝑊)
26 eropr.10 . . . . . . . 8 (𝜑+ :(𝐴 × 𝐵)⟶𝐶)
27 eropr.11 . . . . . . . 8 ((𝜑 ∧ ((𝑟𝐴𝑠𝐴) ∧ (𝑡𝐵𝑢𝐵))) → ((𝑟𝑅𝑠𝑡𝑆𝑢) → (𝑟 + 𝑡)𝑇(𝑠 + 𝑢)))
284, 9, 19, 20, 21, 22, 23, 24, 25, 26, 27eroveu 6227 . . . . . . 7 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → ∃!𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))
29 iota1 4908 . . . . . . 7 (∃!𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → (∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) = 𝑧))
3028, 29syl 14 . . . . . 6 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → (∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) = 𝑧))
31 eqcom 2058 . . . . . 6 ((℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) = 𝑧𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
3230, 31syl6bb 189 . . . . 5 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → (∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ 𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
3332pm5.32da 433 . . . 4 (𝜑 → (((𝑥𝐽𝑦𝐾) ∧ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ↔ ((𝑥𝐽𝑦𝐾) ∧ 𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))))
3418, 33syl5bb 185 . . 3 (𝜑 → (∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ ((𝑥𝐽𝑦𝐾) ∧ 𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))))
3534oprabbidv 5586 . 2 (𝜑 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐽𝑦𝐾) ∧ 𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))})
36 eropr.12 . 2 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)}
37 df-mpt2 5544 . . 3 (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))) = {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ ((𝑥𝐽𝑦𝐾) ∧ 𝑤 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))}
38 nfv 1437 . . . 4 𝑤((𝑥𝐽𝑦𝐾) ∧ 𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
39 nfv 1437 . . . . 5 𝑧(𝑥𝐽𝑦𝐾)
40 nfiota1 4896 . . . . . 6 𝑧(℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))
4140nfeq2 2205 . . . . 5 𝑧 𝑤 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))
4239, 41nfan 1473 . . . 4 𝑧((𝑥𝐽𝑦𝐾) ∧ 𝑤 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
43 eqeq1 2062 . . . . 5 (𝑧 = 𝑤 → (𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ↔ 𝑤 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
4443anbi2d 445 . . . 4 (𝑧 = 𝑤 → (((𝑥𝐽𝑦𝐾) ∧ 𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))) ↔ ((𝑥𝐽𝑦𝐾) ∧ 𝑤 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))))
4538, 42, 44cbvoprab3 5607 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐽𝑦𝐾) ∧ 𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))} = {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ ((𝑥𝐽𝑦𝐾) ∧ 𝑤 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))}
4637, 45eqtr4i 2079 . 2 (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐽𝑦𝐾) ∧ 𝑧 = (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))}
4735, 36, 463eqtr4g 2113 1 (𝜑 = (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102   = wceq 1259  wcel 1409  ∃!weu 1916  wrex 2324  wss 2944   class class class wbr 3791   × cxp 4370  cio 4892  wf 4925  (class class class)co 5539  {coprab 5540  cmpt2 5541   Er wer 6133  [cec 6134   / cqs 6135
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971  ax-un 4197
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-v 2576  df-sbc 2787  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-br 3792  df-opab 3846  df-id 4057  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-fv 4937  df-ov 5542  df-oprab 5543  df-mpt2 5544  df-er 6136  df-ec 6138  df-qs 6142
This theorem is referenced by:  eroprf  6229
  Copyright terms: Public domain W3C validator