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

Theorem omeu 8547
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 8544 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On ∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)
2 opex 5428 . . . . . . . . 9 𝑥, 𝑦⟩ ∈ V
32isseti 3471 . . . . . . . 8 𝑧 𝑧 = ⟨𝑥, 𝑦
4 19.41v 1968 . . . . . . . 8 (∃𝑧(𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ (∃𝑧 𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
53, 4mpbiran 719 . . . . . . 7 (∃𝑧(𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)
65rexbii 3108 . . . . . 6 (∃𝑦𝐴𝑧(𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)
7 rexcom4 3288 . . . . . 6 (∃𝑦𝐴𝑧(𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑧𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
86, 7bitr3i 279 . . . . 5 (∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵 ↔ ∃𝑧𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
98rexbii 3108 . . . 4 (∃𝑥 ∈ On ∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵 ↔ ∃𝑥 ∈ On ∃𝑧𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
10 rexcom4 3288 . . . 4 (∃𝑥 ∈ On ∃𝑧𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
119, 10bitri 277 . . 3 (∃𝑥 ∈ On ∃𝑦𝐴 ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵 ↔ ∃𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
121, 11sylib 220 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∃𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
13 simp2rl 1255 . . . . . . . . . . 11 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑧 = ⟨𝑥, 𝑦⟩)
14 simp3rl 1259 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑡 = ⟨𝑟, 𝑠⟩)
15 simp2rr 1256 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)
16 simp3rr 1260 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)
1715, 16eqtr4d 2799 . . . . . . . . . . . . . 14 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → ((𝐴 ·o 𝑥) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑠))
18 simp11 1216 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝐴 ∈ On)
19 simp13 1218 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝐴 ≠ ∅)
20 simp2ll 1253 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑥 ∈ On)
21 simp2lr 1254 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑦𝐴)
22 simp3ll 1257 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑟 ∈ On)
23 simp3lr 1258 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑠𝐴)
24 omopth2 8546 . . . . . . . . . . . . . . 15 (((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑟 ∈ On ∧ 𝑠𝐴)) → (((𝐴 ·o 𝑥) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑠) ↔ (𝑥 = 𝑟𝑦 = 𝑠)))
2518, 19, 20, 21, 22, 23, 24syl222anc 1404 . . . . . . . . . . . . . 14 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → (((𝐴 ·o 𝑥) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑠) ↔ (𝑥 = 𝑟𝑦 = 𝑠)))
2617, 25mpbid 234 . . . . . . . . . . . . 13 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → (𝑥 = 𝑟𝑦 = 𝑠))
27 opeq12 4830 . . . . . . . . . . . . 13 ((𝑥 = 𝑟𝑦 = 𝑠) → ⟨𝑥, 𝑦⟩ = ⟨𝑟, 𝑠⟩)
2826, 27syl 17 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → ⟨𝑥, 𝑦⟩ = ⟨𝑟, 𝑠⟩)
2914, 28eqtr4d 2799 . . . . . . . . . . 11 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑡 = ⟨𝑥, 𝑦⟩)
3013, 29eqtr4d 2799 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ((𝑥 ∈ On ∧ 𝑦𝐴) ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) ∧ ((𝑟 ∈ On ∧ 𝑠𝐴) ∧ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))) → 𝑧 = 𝑡)
31303expia 1133 . . . . . . . . 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 3217 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) → ((𝑟 ∈ On ∧ 𝑠𝐴) → ((𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) → 𝑧 = 𝑡))))
3534imp 410 . . . . 5 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) → ((𝑟 ∈ On ∧ 𝑠𝐴) → ((𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) → 𝑧 = 𝑡)))
3635rexlimdvv 3217 . . . 4 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) ∧ ∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵)) → (∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) → 𝑧 = 𝑡))
3736expimpd 457 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ((∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ∧ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)) → 𝑧 = 𝑡))
3837alrimivv 1947 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∀𝑧𝑡((∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ∧ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)) → 𝑧 = 𝑡))
39 opeq1 4828 . . . . . . 7 (𝑥 = 𝑟 → ⟨𝑥, 𝑦⟩ = ⟨𝑟, 𝑦⟩)
4039eqeq2d 2772 . . . . . 6 (𝑥 = 𝑟 → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ 𝑧 = ⟨𝑟, 𝑦⟩))
41 oveq2 7398 . . . . . . . 8 (𝑥 = 𝑟 → (𝐴 ·o 𝑥) = (𝐴 ·o 𝑟))
4241oveq1d 7405 . . . . . . 7 (𝑥 = 𝑟 → ((𝐴 ·o 𝑥) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑦))
4342eqeq1d 2763 . . . . . 6 (𝑥 = 𝑟 → (((𝐴 ·o 𝑥) +o 𝑦) = 𝐵 ↔ ((𝐴 ·o 𝑟) +o 𝑦) = 𝐵))
4440, 43anbi12d 641 . . . . 5 (𝑥 = 𝑟 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ (𝑧 = ⟨𝑟, 𝑦⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑦) = 𝐵)))
45 opeq2 4829 . . . . . . 7 (𝑦 = 𝑠 → ⟨𝑟, 𝑦⟩ = ⟨𝑟, 𝑠⟩)
4645eqeq2d 2772 . . . . . 6 (𝑦 = 𝑠 → (𝑧 = ⟨𝑟, 𝑦⟩ ↔ 𝑧 = ⟨𝑟, 𝑠⟩))
47 oveq2 7398 . . . . . . 7 (𝑦 = 𝑠 → ((𝐴 ·o 𝑟) +o 𝑦) = ((𝐴 ·o 𝑟) +o 𝑠))
4847eqeq1d 2763 . . . . . 6 (𝑦 = 𝑠 → (((𝐴 ·o 𝑟) +o 𝑦) = 𝐵 ↔ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))
4946, 48anbi12d 641 . . . . 5 (𝑦 = 𝑠 → ((𝑧 = ⟨𝑟, 𝑦⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑦) = 𝐵) ↔ (𝑧 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)))
5044, 49cbvrex2vw 3244 . . . 4 (∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑧 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵))
51 eqeq1 2765 . . . . . 6 (𝑧 = 𝑡 → (𝑧 = ⟨𝑟, 𝑠⟩ ↔ 𝑡 = ⟨𝑟, 𝑠⟩))
5251anbi1d 640 . . . . 5 (𝑧 = 𝑡 → ((𝑧 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) ↔ (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)))
53522rexbidv 3226 . . . 4 (𝑧 = 𝑡 → (∃𝑟 ∈ On ∃𝑠𝐴 (𝑧 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵) ↔ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)))
5450, 53bitrid 285 . . 3 (𝑧 = 𝑡 → (∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)))
5554eu4 2641 . 2 (∃!𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ↔ (∃𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ∧ ∀𝑧𝑡((∃𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵) ∧ ∃𝑟 ∈ On ∃𝑠𝐴 (𝑡 = ⟨𝑟, 𝑠⟩ ∧ ((𝐴 ·o 𝑟) +o 𝑠) = 𝐵)) → 𝑧 = 𝑡)))
5612, 38, 55sylanbrc 592 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∃!𝑧𝑥 ∈ On ∃𝑦𝐴 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ ((𝐴 ·o 𝑥) +o 𝑦) = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1097  wal 1557   = wceq 1559  wex 1798  wcel 2141  ∃!weu 2594  wne 2956  wrex 3085  c0 4283  cop 4585  Oncon0 6340  (class class class)co 7390   +o coa 8427   ·o comu 8428
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7712
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6282  df-ord 6343  df-on 6344  df-lim 6345  df-suc 6346  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7841  df-2nd 7965  df-frecs 8255  df-wrecs 8286  df-recs 8335  df-rdg 8374  df-1o 8430  df-oadd 8434  df-omul 8435
This theorem is referenced by:  oeeui  8565  omxpenlem  9043  onexomgt  43778
  Copyright terms: Public domain W3C validator