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

Theorem omeu 8194
Description: The division algorithm for ordinal multiplication. (Contributed by Mario Carneiro, 28-Feb-2013.)
Assertion
Ref Expression
omeu ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∃!𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧

Proof of Theorem omeu
Dummy variables 𝑟 𝑠 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 omeulem1 8191 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On ∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)
2 opex 5337 . . . . . . . . 9 𝑥, 𝑦⟩ ∈ V
32isseti 3493 . . . . . . . 8 𝑧 𝑧 = ⟨𝑥, 𝑦
4 19.41v 1951 . . . . . . . 8 (∃𝑧(𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ (∃𝑧 𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
53, 4mpbiran 708 . . . . . . 7 (∃𝑧(𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)
65rexbii 3241 . . . . . 6 (∃𝑦𝐴𝑧(𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)
7 rexcom4 3243 . . . . . 6 (∃𝑦𝐴𝑧(𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑧𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
86, 7bitr3i 280 . . . . 5 (∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵 ↔ ∃𝑧𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
98rexbii 3241 . . . 4 (∃𝑥 ∈ On ∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵 ↔ ∃𝑥 ∈ On ∃𝑧𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
10 rexcom4 3243 . . . 4 (∃𝑥 ∈ On ∃𝑧𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
119, 10bitri 278 . . 3 (∃𝑥 ∈ On ∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵 ↔ ∃𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
121, 11sylib 221 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∃𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
13 simp2rl 1239 . . . . . . . . . . 11 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑧 = ⟨𝑥, 𝑦⟩)
14 simp3rl 1243 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑡 = ⟨𝑟, 𝑠⟩)
15 simp2rr 1240 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)
16 simp3rr 1244 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)
1715, 16eqtr4d 2862 . . . . . . . . . . . . . 14 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → ((𝐴 ·o 𝑥) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑠))
18 simp11 1200 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝐴 ∈ On)
19 simp13 1202 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝐴 ≠ ∅)
20 simp2ll 1237 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑥 ∈ On)
21 simp2lr 1238 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑦𝐴)
22 simp3ll 1241 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑟 ∈ On)
23 simp3lr 1242 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑠𝐴)
24 omopth2 8193 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑟 ∈ On ∧ 𝑠𝐴)) → (((𝐴 ·o 𝑥) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑠) ↔ (𝑥 = 𝑟𝑦 = 𝑠)))
2518, 19, 20, 21, 22, 23, 24syl222anc 1383 . . . . . . . . . . . . . 14 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → (((𝐴 ·o 𝑥) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑠) ↔ (𝑥 = 𝑟𝑦 = 𝑠)))
2617, 25mpbid 235 . . . . . . . . . . . . 13 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → (𝑥 = 𝑟𝑦 = 𝑠))
27 opeq12 4786 . . . . . . . . . . . . 13 ((𝑥 = 𝑟𝑦 = 𝑠) → ⟨𝑥, 𝑦⟩ = ⟨𝑟, 𝑠⟩)
2826, 27syl 17 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → ⟨𝑥, 𝑦⟩ = ⟨𝑟, 𝑠⟩)
2914, 28eqtr4d 2862 . . . . . . . . . . 11 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑡 = ⟨𝑥, 𝑦⟩)
3013, 29eqtr4d 2862 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑧 = 𝑡)
31303expia 1118 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))) → (((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)) → 𝑧 = 𝑡))
3231exp4b 434 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → (((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) → ((𝑟 ∈ On ∧ 𝑠𝐴) → ((𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) → 𝑧 = 𝑡))))
3332expd 419 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ((𝑥 ∈ On ∧ 𝑦𝐴) → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) → ((𝑟 ∈ On ∧ 𝑠𝐴) → ((𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) → 𝑧 = 𝑡)))))
3433rexlimdvv 3285 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) → ((𝑟 ∈ On ∧ 𝑠𝐴) → ((𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) → 𝑧 = 𝑡))))
3534imp 410 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) → ((𝑟 ∈ On ∧ 𝑠𝐴) → ((𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) → 𝑧 = 𝑡)))
3635rexlimdvv 3285 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) → (∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) → 𝑧 = 𝑡))
3736expimpd 457 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ((∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ∧ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)) → 𝑧 = 𝑡))
3837alrimivv 1930 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∀𝑧𝑡((∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ∧ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)) → 𝑧 = 𝑡))
39 opeq1 4784 . . . . . . 7 (𝑥 = 𝑟 → ⟨𝑥, 𝑦⟩ = ⟨𝑟, 𝑦⟩)
4039eqeq2d 2835 . . . . . 6 (𝑥 = 𝑟 → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ 𝑧 = ⟨𝑟, 𝑦⟩))
41 oveq2 7146 . . . . . . . 8 (𝑥 = 𝑟 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑟))
4241oveq1d 7153 . . . . . . 7 (𝑥 = 𝑟 → ((𝐴 ·o 𝑥) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑦))
4342eqeq1d 2826 . . . . . 6 (𝑥 = 𝑟 → (((𝐴 ·o 𝑥) +o 𝑦) = 𝐵 ↔ ((𝐴 ·o 𝑟) +o 𝑦) = 𝐵))
4440, 43anbi12d 633 . . . . 5 (𝑥 = 𝑟 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ (𝑧 = ⟨𝑟, 𝑦⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑦) = 𝐵)))
45 opeq2 4785 . . . . . . 7 (𝑦 = 𝑠 → ⟨𝑟, 𝑦⟩ = ⟨𝑟, 𝑠⟩)
4645eqeq2d 2835 . . . . . 6 (𝑦 = 𝑠 → (𝑧 = ⟨𝑟, 𝑦⟩ ↔ 𝑧 = ⟨𝑟, 𝑠⟩))
47 oveq2 7146 . . . . . . 7 (𝑦 = 𝑠 → ((𝐴 ·o 𝑟) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑠))
4847eqeq1d 2826 . . . . . 6 (𝑦 = 𝑠 → (((𝐴 ·o 𝑟) +o 𝑦) = 𝐵 ↔ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))
4946, 48anbi12d 633 . . . . 5 (𝑦 = 𝑠 → ((𝑧 = ⟨𝑟, 𝑦⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑦) = 𝐵) ↔ (𝑧 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)))
5044, 49cbvrex2vw 3447 . . . 4 (∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑧 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))
51 eqeq1 2828 . . . . . 6 (𝑧 = 𝑡 → (𝑧 = ⟨𝑟, 𝑠⟩ ↔ 𝑡 = ⟨𝑟, 𝑠⟩))
5251anbi1d 632 . . . . 5 (𝑧 = 𝑡 → ((𝑧 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) ↔ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)))
53522rexbidv 3292 . . . 4 (𝑧 = 𝑡 → (∃𝑟 ∈ On ∃𝑠𝐴 (𝑧 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) ↔ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)))
5450, 53syl5bb 286 . . 3 (𝑧 = 𝑡 → (∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)))
5554eu4 2702 . 2 (∃!𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ (∃𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ∧ ∀𝑧𝑡((∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ∧ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)) → 𝑧 = 𝑡)))
5612, 38, 55sylanbrc 586 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∃!𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1084  wal 1536   = wceq 1538  wex 1781  wcel 2115  ∃!weu 2654  wne 3013  wrex 3133  c0 4274  cop 4554  Oncon0 6172  (class class class)co 7138   +o coa 8082   ·o comu 8083
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5171  ax-sep 5184  ax-nul 5191  ax-pow 5247  ax-pr 5311  ax-un 7444
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3014  df-ral 3137  df-rex 3138  df-reu 3139  df-rmo 3140  df-rab 3141  df-v 3481  df-sbc 3758  df-csb 3866  df-dif 3921  df-un 3923  df-in 3925  df-ss 3935  df-pss 3937  df-nul 4275  df-if 4449  df-pw 4522  df-sn 4549  df-pr 4551  df-tp 4553  df-op 4555  df-uni 4820  df-int 4858  df-iun 4902  df-br 5048  df-opab 5110  df-mpt 5128  df-tr 5154  df-id 5441  df-eprel 5446  df-po 5455  df-so 5456  df-fr 5495  df-we 5497  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-pred 6129  df-ord 6175  df-on 6176  df-lim 6177  df-suc 6178  df-iota 6295  df-fun 6338  df-fn 6339  df-f 6340  df-f1 6341  df-fo 6342  df-f1o 6343  df-fv 6344  df-ov 7141  df-oprab 7142  df-mpo 7143  df-om 7564  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-omul 8090
This theorem is referenced by:  oeeui  8211  omxpenlem  8601
  Copyright terms: Public domain W3C validator