MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  erovlem Structured version   Visualization version   GIF version

Theorem erovlem 8834
Description: Lemma for erov 8835 and eroprf 8836. (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 488 . . . . . . . 8 (((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → (𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆))
21reximi 3101 . . . . . . 7 (∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → ∃𝑞 ∈ 𝐵 (𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆))
32reximi 3101 . . . . . 6 (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 (𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆))
4 eropr.1 . . . . . . . . . 10 𝐽 = (𝐴 / 𝑅)
54eleq2i 2853 . . . . . . . . 9 (𝑥 ∈ 𝐽 ↔ 𝑥 ∈ (𝐴 / 𝑅))
6 vex 3455 . . . . . . . . . 10 𝑥 ∈ V
76elqs 8785 . . . . . . . . 9 (𝑥 ∈ (𝐴 / 𝑅) ↔ ∃𝑝 ∈ 𝐴 𝑥 = [𝑝]𝑅)
85, 7bitri 278 . . . . . . . 8 (𝑥 ∈ 𝐽 ↔ ∃𝑝 ∈ 𝐴 𝑥 = [𝑝]𝑅)
9 eropr.2 . . . . . . . . . 10 𝐾 = (𝐵 / 𝑆)
109eleq2i 2853 . . . . . . . . 9 (𝑦 ∈ 𝐾 ↔ 𝑦 ∈ (𝐵 / 𝑆))
11 vex 3455 . . . . . . . . . 10 𝑦 ∈ V
1211elqs 8785 . . . . . . . . 9 (𝑦 ∈ (𝐵 / 𝑆) ↔ ∃𝑞 ∈ 𝐵 𝑦 = [𝑞]𝑆)
1310, 12bitri 278 . . . . . . . 8 (𝑦 ∈ 𝐾 ↔ ∃𝑞 ∈ 𝐵 𝑦 = [𝑞]𝑆)
148, 13anbi12i 640 . . . . . . 7 ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ↔ (∃𝑝 ∈ 𝐴 𝑥 = [𝑝]𝑅 ∧ ∃𝑞 ∈ 𝐵 𝑦 = [𝑞]𝑆))
15 reeanv 3235 . . . . . . 7 (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 (𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ↔ (∃𝑝 ∈ 𝐴 𝑥 = [𝑝]𝑅 ∧ ∃𝑞 ∈ 𝐵 𝑦 = [𝑞]𝑆))
1614, 15bitr4i 281 . . . . . 6 ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 (𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆))
173, 16sylibr 237 . . . . 5 (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾))
1817pm4.71ri 570 . . . 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 8833 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → ∃!𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))
29 iota1 6517 . . . . . . 7 (∃!𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) = 𝑧))
3028, 29syl 18 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) = 𝑧))
31 eqcom 2768 . . . . . 6 ((℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) = 𝑧 ↔ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
3230, 31bitrdi 290 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
3332pm5.32da 590 . . . 4 (𝜑 → (((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ↔ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))))
3418, 33bitrid 286 . . 3 (𝜑 → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇) ↔ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))))
3534oprabbidv 7486 . 2 (𝜑 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))})
36 eropr.12 . 2 ⨣ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)}
37 df-mpo 7425 . . 3 (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))) = {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑤 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))}
38 nfv 1947 . . . 4 Ⅎ𝑤((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
39 nfv 1947 . . . . 5 Ⅎ𝑧(𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾)
40 nfiota1 6496 . . . . . 6 Ⅎ𝑧(℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))
4140nfeq2 2940 . . . . 5 Ⅎ𝑧 𝑤 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))
4239, 41nfan 1932 . . . 4 Ⅎ𝑧((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑤 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))
43 eqeq1 2765 . . . . 5 (𝑧 = 𝑤 → (𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)) ↔ 𝑤 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
4443anbi2d 642 . . . 4 (𝑧 = 𝑤 → (((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))) ↔ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑤 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))))
4538, 42, 44cbvoprab3 7511 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))} = {⟨⟨𝑥, 𝑦⟩, 𝑤⟩ ∣ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑤 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))}
4637, 45eqtr4i 2787 . 2 (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐽 ∧ 𝑦 ∈ 𝐾) ∧ 𝑧 = (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇)))}
4735, 36, 463eqtr4g 2821 1 (𝜑 → ⨣ = (𝑥 ∈ 𝐽, 𝑦 ∈ 𝐾 ↦ (℩𝑧∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐵 ((𝑥 = [𝑝]𝑅 ∧ 𝑦 = [𝑞]𝑆) ∧ 𝑧 = [(𝑝 + 𝑞)]𝑇))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃!weu 2594  ∃wrex 3087   ⊆ wss 3899   class class class wbr 5103   × cxp 5649  ℩cio 6492  ⟶wf 6534  (class class class)co 7420  {coprab 7421   ∈ cmpo 7422   Er wer 8714  [cec 8715   / cqs 8716
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-er 8717  df-ec 8719  df-qs 8723
This theorem is used by:  erov  8835  eroprf  8836
  Copyright terms: Public domain W3C validator