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

Theorem aprcl 8415
Description: Reverse closure for apartness. (Contributed by Jim Kingdon, 19-Dec-2023.)
Assertion
Ref Expression
aprcl (𝐴 # 𝐵 → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ))

Proof of Theorem aprcl
Dummy variables 𝑟 𝑠 𝑡 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 3930 . . . 4 (𝐴 # 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ # )
2 eqeq1 2146 . . . . . . . . . 10 (𝑥 = (1st ‘⟨𝐴, 𝐵⟩) → (𝑥 = (𝑟 + (i · 𝑠)) ↔ (1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠))))
32anbi1d 460 . . . . . . . . 9 (𝑥 = (1st ‘⟨𝐴, 𝐵⟩) → ((𝑥 = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ↔ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢)))))
43anbi1d 460 . . . . . . . 8 (𝑥 = (1st ‘⟨𝐴, 𝐵⟩) → (((𝑥 = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) ↔ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢))))
542rexbidv 2460 . . . . . . 7 (𝑥 = (1st ‘⟨𝐴, 𝐵⟩) → (∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((𝑥 = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) ↔ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢))))
652rexbidv 2460 . . . . . 6 (𝑥 = (1st ‘⟨𝐴, 𝐵⟩) → (∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((𝑥 = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) ↔ ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢))))
7 eqeq1 2146 . . . . . . . . . 10 (𝑦 = (2nd ‘⟨𝐴, 𝐵⟩) → (𝑦 = (𝑡 + (i · 𝑢)) ↔ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))))
87anbi2d 459 . . . . . . . . 9 (𝑦 = (2nd ‘⟨𝐴, 𝐵⟩) → (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ↔ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))))
98anbi1d 460 . . . . . . . 8 (𝑦 = (2nd ‘⟨𝐴, 𝐵⟩) → ((((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) ↔ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢))))
1092rexbidv 2460 . . . . . . 7 (𝑦 = (2nd ‘⟨𝐴, 𝐵⟩) → (∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) ↔ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢))))
11102rexbidv 2460 . . . . . 6 (𝑦 = (2nd ‘⟨𝐴, 𝐵⟩) → (∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) ↔ ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢))))
126, 11elopabi 6093 . . . . 5 (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((𝑥 = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢))} → ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)))
13 df-ap 8351 . . . . 5 # = {⟨𝑥, 𝑦⟩ ∣ ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((𝑥 = (𝑟 + (i · 𝑠)) ∧ 𝑦 = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢))}
1412, 13eleq2s 2234 . . . 4 (⟨𝐴, 𝐵⟩ ∈ # → ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)))
151, 14sylbi 120 . . 3 (𝐴 # 𝐵 → ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)))
16 simpl 108 . . . . . . 7 ((((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) → ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))))
1716reximi 2529 . . . . . 6 (∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) → ∃𝑢 ∈ ℝ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))))
1817reximi 2529 . . . . 5 (∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) → ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))))
1918reximi 2529 . . . 4 (∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) → ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))))
2019reximi 2529 . . 3 (∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) ∧ (𝑟 # 𝑡𝑠 # 𝑢)) → ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))))
2115, 20syl 14 . 2 (𝐴 # 𝐵 → ∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))))
2213relopabi 4665 . . . . . . . . . 10 Rel #
2322brrelex1i 4582 . . . . . . . . 9 (𝐴 # 𝐵𝐴 ∈ V)
2423ad3antrrr 483 . . . . . . . 8 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → 𝐴 ∈ V)
2522brrelex2i 4583 . . . . . . . . 9 (𝐴 # 𝐵𝐵 ∈ V)
2625ad3antrrr 483 . . . . . . . 8 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → 𝐵 ∈ V)
27 op1stg 6048 . . . . . . . 8 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
2824, 26, 27syl2anc 408 . . . . . . 7 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
29 simprl 520 . . . . . . . 8 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)))
30 simprl 520 . . . . . . . . . . 11 ((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) → 𝑟 ∈ ℝ)
3130ad2antrr 479 . . . . . . . . . 10 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → 𝑟 ∈ ℝ)
3231recnd 7801 . . . . . . . . 9 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → 𝑟 ∈ ℂ)
33 ax-icn 7722 . . . . . . . . . . 11 i ∈ ℂ
3433a1i 9 . . . . . . . . . 10 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → i ∈ ℂ)
35 simprr 521 . . . . . . . . . . . 12 ((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) → 𝑠 ∈ ℝ)
3635ad2antrr 479 . . . . . . . . . . 11 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → 𝑠 ∈ ℝ)
3736recnd 7801 . . . . . . . . . 10 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → 𝑠 ∈ ℂ)
3834, 37mulcld 7793 . . . . . . . . 9 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (i · 𝑠) ∈ ℂ)
3932, 38addcld 7792 . . . . . . . 8 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (𝑟 + (i · 𝑠)) ∈ ℂ)
4029, 39eqeltrd 2216 . . . . . . 7 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (1st ‘⟨𝐴, 𝐵⟩) ∈ ℂ)
4128, 40eqeltrrd 2217 . . . . . 6 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → 𝐴 ∈ ℂ)
42 op2ndg 6049 . . . . . . . 8 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
4324, 26, 42syl2anc 408 . . . . . . 7 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
44 simprr 521 . . . . . . . 8 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))
45 recn 7760 . . . . . . . . . . . 12 (𝑡 ∈ ℝ → 𝑡 ∈ ℂ)
4645adantr 274 . . . . . . . . . . 11 ((𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ) → 𝑡 ∈ ℂ)
4733a1i 9 . . . . . . . . . . . 12 ((𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ) → i ∈ ℂ)
48 recn 7760 . . . . . . . . . . . . 13 (𝑢 ∈ ℝ → 𝑢 ∈ ℂ)
4948adantl 275 . . . . . . . . . . . 12 ((𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ) → 𝑢 ∈ ℂ)
5047, 49mulcld 7793 . . . . . . . . . . 11 ((𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ) → (i · 𝑢) ∈ ℂ)
5146, 50addcld 7792 . . . . . . . . . 10 ((𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ) → (𝑡 + (i · 𝑢)) ∈ ℂ)
5251adantl 275 . . . . . . . . 9 (((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) → (𝑡 + (i · 𝑢)) ∈ ℂ)
5352adantr 274 . . . . . . . 8 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (𝑡 + (i · 𝑢)) ∈ ℂ)
5444, 53eqeltrd 2216 . . . . . . 7 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (2nd ‘⟨𝐴, 𝐵⟩) ∈ ℂ)
5543, 54eqeltrrd 2217 . . . . . 6 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → 𝐵 ∈ ℂ)
5641, 55jca 304 . . . . 5 ((((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) ∧ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢)))) → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ))
5756ex 114 . . . 4 (((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) ∧ (𝑡 ∈ ℝ ∧ 𝑢 ∈ ℝ)) → (((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ)))
5857rexlimdvva 2557 . . 3 ((𝐴 # 𝐵 ∧ (𝑟 ∈ ℝ ∧ 𝑠 ∈ ℝ)) → (∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ)))
5958rexlimdvva 2557 . 2 (𝐴 # 𝐵 → (∃𝑟 ∈ ℝ ∃𝑠 ∈ ℝ ∃𝑡 ∈ ℝ ∃𝑢 ∈ ℝ ((1st ‘⟨𝐴, 𝐵⟩) = (𝑟 + (i · 𝑠)) ∧ (2nd ‘⟨𝐴, 𝐵⟩) = (𝑡 + (i · 𝑢))) → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ)))
6021, 59mpd 13 1 (𝐴 # 𝐵 → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wo 697   = wceq 1331  wcel 1480  wrex 2417  Vcvv 2686  cop 3530   class class class wbr 3929  {copab 3988  cfv 5123  (class class class)co 5774  1st c1st 6036  2nd c2nd 6037  cc 7625  cr 7626  ici 7629   + caddc 7630   · cmul 7632   # creap 8343   # cap 8350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-resscn 7719  ax-icn 7722  ax-addcl 7723  ax-mulcl 7725
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fo 5129  df-fv 5131  df-1st 6038  df-2nd 6039  df-ap 8351
This theorem is referenced by:  apsscn  8416
  Copyright terms: Public domain W3C validator