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

Theorem eroprf 6738
Description: Functionality of an operation defined on equivalence classes. (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 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)}
eropr.13 (𝜑𝑅𝑋)
eropr.14 (𝜑𝑆𝑌)
eropr.15 𝐿 = (𝐶 / 𝑇)
Assertion
Ref Expression
eroprf (𝜑 :(𝐽 × 𝐾)⟶𝐿)
Distinct variable groups:   𝑞,𝑝,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧,𝐴   𝐵,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝐿,𝑝,𝑞,𝑥,𝑦,𝑧   𝐽,𝑝,𝑞,𝑥,𝑦,𝑧   𝑅,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝐾,𝑝,𝑞,𝑥,𝑦,𝑧   𝑆,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   + ,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝜑,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝑇,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑥,𝑦,𝑧   𝑋,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑧   𝑌,𝑝,𝑞,𝑟,𝑠,𝑡,𝑢,𝑧
Allowed substitution hints:   𝐶(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   (𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑈(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝐽(𝑢,𝑡,𝑠,𝑟)   𝐾(𝑢,𝑡,𝑠,𝑟)   𝐿(𝑢,𝑡,𝑠,𝑟)   𝑉(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑊(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)   𝑋(𝑥,𝑦)   𝑌(𝑥,𝑦)   𝑍(𝑥,𝑦,𝑧,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝)

Proof of Theorem eroprf
StepHypRef Expression
1 eropr.3 . . . . . . . . . . . 12 (𝜑𝑇𝑍)
21ad2antrr 488 . . . . . . . . . . 11 (((𝜑 ∧ (𝑥𝐽𝑦𝐾)) ∧ (𝑝𝐴𝑞𝐵)) → 𝑇𝑍)
3 eropr.10 . . . . . . . . . . . . 13 (𝜑+ :(𝐴 × 𝐵)⟶𝐶)
43adantr 276 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → + :(𝐴 × 𝐵)⟶𝐶)
54fovcdmda 6113 . . . . . . . . . . 11 (((𝜑 ∧ (𝑥𝐽𝑦𝐾)) ∧ (𝑝𝐴𝑞𝐵)) → (𝑝 + 𝑞) ∈ 𝐶)
6 ecelqsg 6698 . . . . . . . . . . 11 ((𝑇𝑍 ∧ (𝑝 + 𝑞) ∈ 𝐶) → [(𝑝 + 𝑞)]𝑇 ∈ (𝐶 / 𝑇))
72, 5, 6syl2anc 411 . . . . . . . . . 10 (((𝜑 ∧ (𝑥𝐽𝑦𝐾)) ∧ (𝑝𝐴𝑞𝐵)) → [(𝑝 + 𝑞)]𝑇 ∈ (𝐶 / 𝑇))
8 eropr.15 . . . . . . . . . 10 𝐿 = (𝐶 / 𝑇)
97, 8eleqtrrdi 2301 . . . . . . . . 9 (((𝜑 ∧ (𝑥𝐽𝑦𝐾)) ∧ (𝑝𝐴𝑞𝐵)) → [(𝑝 + 𝑞)]𝑇𝐿)
10 eleq1a 2279 . . . . . . . . 9 ([(𝑝 + 𝑞)]𝑇𝐿 → (𝑧 = [(𝑝 + 𝑞)]𝑇𝑧𝐿))
119, 10syl 14 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐽𝑦𝐾)) ∧ (𝑝𝐴𝑞𝐵)) → (𝑧 = [(𝑝 + 𝑞)]𝑇𝑧𝐿))
1211adantld 278 . . . . . . 7 (((𝜑 ∧ (𝑥𝐽𝑦𝐾)) ∧ (𝑝𝐴𝑞𝐵)) → (((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → 𝑧𝐿))
1312rexlimdvva 2633 . . . . . 6 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → (∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → 𝑧𝐿))
1413abssdv 3275 . . . . 5 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → {𝑧 ∣ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)} ⊆ 𝐿)
15 eropr.1 . . . . . . 7 𝐽 = (𝐴 / 𝑅)
16 eropr.2 . . . . . . 7 𝐾 = (𝐵 / 𝑆)
17 eropr.4 . . . . . . 7 (𝜑𝑅 Er 𝑈)
18 eropr.5 . . . . . . 7 (𝜑𝑆 Er 𝑉)
19 eropr.6 . . . . . . 7 (𝜑𝑇 Er 𝑊)
20 eropr.7 . . . . . . 7 (𝜑𝐴𝑈)
21 eropr.8 . . . . . . 7 (𝜑𝐵𝑉)
22 eropr.9 . . . . . . 7 (𝜑𝐶𝑊)
23 eropr.11 . . . . . . 7 ((𝜑 ∧ ((𝑟𝐴𝑠𝐴) ∧ (𝑡𝐵𝑢𝐵))) → ((𝑟𝑅𝑠𝑡𝑆𝑢) → (𝑟 + 𝑡)𝑇(𝑠 + 𝑢)))
2415, 16, 1, 17, 18, 19, 20, 21, 22, 3, 23eroveu 6736 . . . . . 6 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → ∃!𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))
25 iotacl 5275 . . . . . 6 (∃!𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ {𝑧 ∣ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)})
2624, 25syl 14 . . . . 5 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ {𝑧 ∣ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)})
2714, 26sseldd 3202 . . . 4 ((𝜑 ∧ (𝑥𝐽𝑦𝐾)) → (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ 𝐿)
2827ralrimivva 2590 . . 3 (𝜑 → ∀𝑥𝐽𝑦𝐾 (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ 𝐿)
29 eqid 2207 . . . 4 (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))) = (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
3029fmpo 6310 . . 3 (∀𝑥𝐽𝑦𝐾 (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ∈ 𝐿 ↔ (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))):(𝐽 × 𝐾)⟶𝐿)
3128, 30sylib 122 . 2 (𝜑 → (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))):(𝐽 × 𝐾)⟶𝐿)
32 eropr.12 . . . 4 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)}
3315, 16, 1, 17, 18, 19, 20, 21, 22, 3, 23, 32erovlem 6737 . . 3 (𝜑 = (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
3433feq1d 5432 . 2 (𝜑 → ( :(𝐽 × 𝐾)⟶𝐿 ↔ (𝑥𝐽, 𝑦𝐾 ↦ (℩𝑧𝑝𝐴𝑞𝐵 ((𝑥 = [𝑝]𝑅𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))):(𝐽 × 𝐾)⟶𝐿))
3531, 34mpbird 167 1 (𝜑 :(𝐽 × 𝐾)⟶𝐿)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  ∃!weu 2055  wcel 2178  {cab 2193  wral 2486  wrex 2487  wss 3174   class class class wbr 4059   × cxp 4691  cio 5249  wf 5286  (class class class)co 5967  {coprab 5968  cmpo 5969   Er wer 6640  [cec 6641   / cqs 6642
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-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-er 6643  df-ec 6645  df-qs 6649
This theorem is referenced by:  eroprf2  6739
  Copyright terms: Public domain W3C validator