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

Theorem th3qlem2 6237
Description: Lemma for Exercise 44 version of Theorem 3Q of [Enderton] p. 60, extended to operations on ordered pairs. The fourth hypothesis is the compatibility assumption. (Contributed by NM, 4-Aug-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypotheses
Ref Expression
th3q.1 ∈ V
th3q.2 Er (𝑆 × 𝑆)
th3q.4 ((((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) ∧ ((𝑠𝑆𝑓𝑆) ∧ (𝑔𝑆𝑆))) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓𝑔, ⟩) → (⟨𝑤, 𝑣+𝑠, 𝑓⟩) (⟨𝑢, 𝑡+𝑔, ⟩)))
Assertion
Ref Expression
th3qlem2 ((𝐴 ∈ ((𝑆 × 𝑆) / ) ∧ 𝐵 ∈ ((𝑆 × 𝑆) / )) → ∃*𝑧𝑤𝑣𝑢𝑡((𝐴 = [⟨𝑤, 𝑣⟩] 𝐵 = [⟨𝑢, 𝑡⟩] ) ∧ 𝑧 = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] ))
Distinct variable groups:   𝑧,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓,𝑔,,   𝑧,𝑆,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓,𝑔,   𝑧,𝐴,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓   𝑧,𝐵,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓   𝑧, + ,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓,𝑔,
Allowed substitution hints:   𝐴(𝑔,)   𝐵(𝑔,)

Proof of Theorem th3qlem2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 th3q.2 . . 3 Er (𝑆 × 𝑆)
2 eqid 2054 . . . . 5 (𝑆 × 𝑆) = (𝑆 × 𝑆)
3 breq1 3792 . . . . . . . 8 (⟨𝑤, 𝑣⟩ = 𝑠 → (⟨𝑤, 𝑣𝑢, 𝑡⟩ ↔ 𝑠 𝑢, 𝑡⟩))
43anbi1d 446 . . . . . . 7 (⟨𝑤, 𝑣⟩ = 𝑠 → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑦) ↔ (𝑠 𝑢, 𝑡⟩ ∧ 𝑥 𝑦)))
5 oveq1 5544 . . . . . . . 8 (⟨𝑤, 𝑣⟩ = 𝑠 → (⟨𝑤, 𝑣+ 𝑥) = (𝑠 + 𝑥))
65breq1d 3799 . . . . . . 7 (⟨𝑤, 𝑣⟩ = 𝑠 → ((⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+ 𝑦) ↔ (𝑠 + 𝑥) (⟨𝑢, 𝑡+ 𝑦)))
74, 6imbi12d 227 . . . . . 6 (⟨𝑤, 𝑣⟩ = 𝑠 → (((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+ 𝑦)) ↔ ((𝑠 𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (𝑠 + 𝑥) (⟨𝑢, 𝑡+ 𝑦))))
87imbi2d 223 . . . . 5 (⟨𝑤, 𝑣⟩ = 𝑠 → (((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+ 𝑦))) ↔ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((𝑠 𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (𝑠 + 𝑥) (⟨𝑢, 𝑡+ 𝑦)))))
9 breq2 3793 . . . . . . . 8 (⟨𝑢, 𝑡⟩ = 𝑓 → (𝑠 𝑢, 𝑡⟩ ↔ 𝑠 𝑓))
109anbi1d 446 . . . . . . 7 (⟨𝑢, 𝑡⟩ = 𝑓 → ((𝑠 𝑢, 𝑡⟩ ∧ 𝑥 𝑦) ↔ (𝑠 𝑓𝑥 𝑦)))
11 oveq1 5544 . . . . . . . 8 (⟨𝑢, 𝑡⟩ = 𝑓 → (⟨𝑢, 𝑡+ 𝑦) = (𝑓 + 𝑦))
1211breq2d 3801 . . . . . . 7 (⟨𝑢, 𝑡⟩ = 𝑓 → ((𝑠 + 𝑥) (⟨𝑢, 𝑡+ 𝑦) ↔ (𝑠 + 𝑥) (𝑓 + 𝑦)))
1310, 12imbi12d 227 . . . . . 6 (⟨𝑢, 𝑡⟩ = 𝑓 → (((𝑠 𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (𝑠 + 𝑥) (⟨𝑢, 𝑡+ 𝑦)) ↔ ((𝑠 𝑓𝑥 𝑦) → (𝑠 + 𝑥) (𝑓 + 𝑦))))
1413imbi2d 223 . . . . 5 (⟨𝑢, 𝑡⟩ = 𝑓 → (((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((𝑠 𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (𝑠 + 𝑥) (⟨𝑢, 𝑡+ 𝑦))) ↔ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((𝑠 𝑓𝑥 𝑦) → (𝑠 + 𝑥) (𝑓 + 𝑦)))))
15 breq1 3792 . . . . . . . . . 10 (⟨𝑠, 𝑓⟩ = 𝑥 → (⟨𝑠, 𝑓𝑔, ⟩ ↔ 𝑥 𝑔, ⟩))
1615anbi2d 445 . . . . . . . . 9 (⟨𝑠, 𝑓⟩ = 𝑥 → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓𝑔, ⟩) ↔ (⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑔, ⟩)))
17 oveq2 5545 . . . . . . . . . 10 (⟨𝑠, 𝑓⟩ = 𝑥 → (⟨𝑤, 𝑣+𝑠, 𝑓⟩) = (⟨𝑤, 𝑣+ 𝑥))
1817breq1d 3799 . . . . . . . . 9 (⟨𝑠, 𝑓⟩ = 𝑥 → ((⟨𝑤, 𝑣+𝑠, 𝑓⟩) (⟨𝑢, 𝑡+𝑔, ⟩) ↔ (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+𝑔, ⟩)))
1916, 18imbi12d 227 . . . . . . . 8 (⟨𝑠, 𝑓⟩ = 𝑥 → (((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓𝑔, ⟩) → (⟨𝑤, 𝑣+𝑠, 𝑓⟩) (⟨𝑢, 𝑡+𝑔, ⟩)) ↔ ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑔, ⟩) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+𝑔, ⟩))))
2019imbi2d 223 . . . . . . 7 (⟨𝑠, 𝑓⟩ = 𝑥 → ((((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓𝑔, ⟩) → (⟨𝑤, 𝑣+𝑠, 𝑓⟩) (⟨𝑢, 𝑡+𝑔, ⟩))) ↔ (((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑔, ⟩) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+𝑔, ⟩)))))
21 breq2 3793 . . . . . . . . . 10 (⟨𝑔, ⟩ = 𝑦 → (𝑥 𝑔, ⟩ ↔ 𝑥 𝑦))
2221anbi2d 445 . . . . . . . . 9 (⟨𝑔, ⟩ = 𝑦 → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑔, ⟩) ↔ (⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑦)))
23 oveq2 5545 . . . . . . . . . 10 (⟨𝑔, ⟩ = 𝑦 → (⟨𝑢, 𝑡+𝑔, ⟩) = (⟨𝑢, 𝑡+ 𝑦))
2423breq2d 3801 . . . . . . . . 9 (⟨𝑔, ⟩ = 𝑦 → ((⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+𝑔, ⟩) ↔ (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+ 𝑦)))
2522, 24imbi12d 227 . . . . . . . 8 (⟨𝑔, ⟩ = 𝑦 → (((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑔, ⟩) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+𝑔, ⟩)) ↔ ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+ 𝑦))))
2625imbi2d 223 . . . . . . 7 (⟨𝑔, ⟩ = 𝑦 → ((((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑔, ⟩) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+𝑔, ⟩))) ↔ (((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+ 𝑦)))))
27 th3q.4 . . . . . . . 8 ((((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) ∧ ((𝑠𝑆𝑓𝑆) ∧ (𝑔𝑆𝑆))) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓𝑔, ⟩) → (⟨𝑤, 𝑣+𝑠, 𝑓⟩) (⟨𝑢, 𝑡+𝑔, ⟩)))
2827expcom 113 . . . . . . 7 (((𝑠𝑆𝑓𝑆) ∧ (𝑔𝑆𝑆)) → (((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓𝑔, ⟩) → (⟨𝑤, 𝑣+𝑠, 𝑓⟩) (⟨𝑢, 𝑡+𝑔, ⟩))))
292, 20, 26, 282optocl 4442 . . . . . 6 ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → (((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+ 𝑦))))
3029com12 30 . . . . 5 (((𝑤𝑆𝑣𝑆) ∧ (𝑢𝑆𝑡𝑆)) → ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((⟨𝑤, 𝑣𝑢, 𝑡⟩ ∧ 𝑥 𝑦) → (⟨𝑤, 𝑣+ 𝑥) (⟨𝑢, 𝑡+ 𝑦))))
312, 8, 14, 302optocl 4442 . . . 4 ((𝑠 ∈ (𝑆 × 𝑆) ∧ 𝑓 ∈ (𝑆 × 𝑆)) → ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((𝑠 𝑓𝑥 𝑦) → (𝑠 + 𝑥) (𝑓 + 𝑦))))
3231imp 119 . . 3 (((𝑠 ∈ (𝑆 × 𝑆) ∧ 𝑓 ∈ (𝑆 × 𝑆)) ∧ (𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆))) → ((𝑠 𝑓𝑥 𝑦) → (𝑠 + 𝑥) (𝑓 + 𝑦)))
331, 32th3qlem1 6236 . 2 ((𝐴 ∈ ((𝑆 × 𝑆) / ) ∧ 𝐵 ∈ ((𝑆 × 𝑆) / )) → ∃*𝑧𝑠𝑥((𝐴 = [𝑠] 𝐵 = [𝑥] ) ∧ 𝑧 = [(𝑠 + 𝑥)] ))
34 vex 2575 . . . . . . 7 𝑤 ∈ V
35 vex 2575 . . . . . . 7 𝑣 ∈ V
3634, 35opex 3991 . . . . . 6 𝑤, 𝑣⟩ ∈ V
37 vex 2575 . . . . . . 7 𝑢 ∈ V
38 vex 2575 . . . . . . 7 𝑡 ∈ V
3937, 38opex 3991 . . . . . 6 𝑢, 𝑡⟩ ∈ V
40 eceq1 6169 . . . . . . . . 9 (𝑠 = ⟨𝑤, 𝑣⟩ → [𝑠] = [⟨𝑤, 𝑣⟩] )
4140eqeq2d 2065 . . . . . . . 8 (𝑠 = ⟨𝑤, 𝑣⟩ → (𝐴 = [𝑠] 𝐴 = [⟨𝑤, 𝑣⟩] ))
42 eceq1 6169 . . . . . . . . 9 (𝑥 = ⟨𝑢, 𝑡⟩ → [𝑥] = [⟨𝑢, 𝑡⟩] )
4342eqeq2d 2065 . . . . . . . 8 (𝑥 = ⟨𝑢, 𝑡⟩ → (𝐵 = [𝑥] 𝐵 = [⟨𝑢, 𝑡⟩] ))
4441, 43bi2anan9 546 . . . . . . 7 ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → ((𝐴 = [𝑠] 𝐵 = [𝑥] ) ↔ (𝐴 = [⟨𝑤, 𝑣⟩] 𝐵 = [⟨𝑢, 𝑡⟩] )))
45 oveq12 5546 . . . . . . . . 9 ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → (𝑠 + 𝑥) = (⟨𝑤, 𝑣+𝑢, 𝑡⟩))
4645eceq1d 6170 . . . . . . . 8 ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → [(𝑠 + 𝑥)] = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] )
4746eqeq2d 2065 . . . . . . 7 ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → (𝑧 = [(𝑠 + 𝑥)] 𝑧 = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] ))
4844, 47anbi12d 450 . . . . . 6 ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → (((𝐴 = [𝑠] 𝐵 = [𝑥] ) ∧ 𝑧 = [(𝑠 + 𝑥)] ) ↔ ((𝐴 = [⟨𝑤, 𝑣⟩] 𝐵 = [⟨𝑢, 𝑡⟩] ) ∧ 𝑧 = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] )))
4936, 39, 48spc2ev 2663 . . . . 5 (((𝐴 = [⟨𝑤, 𝑣⟩] 𝐵 = [⟨𝑢, 𝑡⟩] ) ∧ 𝑧 = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] ) → ∃𝑠𝑥((𝐴 = [𝑠] 𝐵 = [𝑥] ) ∧ 𝑧 = [(𝑠 + 𝑥)] ))
5049exlimivv 1790 . . . 4 (∃𝑢𝑡((𝐴 = [⟨𝑤, 𝑣⟩] 𝐵 = [⟨𝑢, 𝑡⟩] ) ∧ 𝑧 = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] ) → ∃𝑠𝑥((𝐴 = [𝑠] 𝐵 = [𝑥] ) ∧ 𝑧 = [(𝑠 + 𝑥)] ))
5150exlimivv 1790 . . 3 (∃𝑤𝑣𝑢𝑡((𝐴 = [⟨𝑤, 𝑣⟩] 𝐵 = [⟨𝑢, 𝑡⟩] ) ∧ 𝑧 = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] ) → ∃𝑠𝑥((𝐴 = [𝑠] 𝐵 = [𝑥] ) ∧ 𝑧 = [(𝑠 + 𝑥)] ))
5251moimi 1979 . 2 (∃*𝑧𝑠𝑥((𝐴 = [𝑠] 𝐵 = [𝑥] ) ∧ 𝑧 = [(𝑠 + 𝑥)] ) → ∃*𝑧𝑤𝑣𝑢𝑡((𝐴 = [⟨𝑤, 𝑣⟩] 𝐵 = [⟨𝑢, 𝑡⟩] ) ∧ 𝑧 = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] ))
5333, 52syl 14 1 ((𝐴 ∈ ((𝑆 × 𝑆) / ) ∧ 𝐵 ∈ ((𝑆 × 𝑆) / )) → ∃*𝑧𝑤𝑣𝑢𝑡((𝐴 = [⟨𝑤, 𝑣⟩] 𝐵 = [⟨𝑢, 𝑡⟩] ) ∧ 𝑧 = [(⟨𝑤, 𝑣+𝑢, 𝑡⟩)] ))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101   = wceq 1257  wex 1395  wcel 1407  ∃*wmo 1915  Vcvv 2572  cop 3403   class class class wbr 3789   × cxp 4368  (class class class)co 5537   Er wer 6131  [cec 6132   / cqs 6133
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 638  ax-5 1350  ax-7 1351  ax-gen 1352  ax-ie1 1396  ax-ie2 1397  ax-8 1409  ax-10 1410  ax-11 1411  ax-i12 1412  ax-bndl 1413  ax-4 1414  ax-14 1419  ax-17 1433  ax-i9 1437  ax-ial 1441  ax-i5r 1442  ax-ext 2036  ax-sep 3900  ax-pow 3952  ax-pr 3969
This theorem depends on definitions:  df-bi 114  df-3an 896  df-tru 1260  df-nf 1364  df-sb 1660  df-eu 1917  df-mo 1918  df-clab 2041  df-cleq 2047  df-clel 2050  df-nfc 2181  df-ral 2326  df-rex 2327  df-v 2574  df-sbc 2785  df-un 2947  df-in 2949  df-ss 2956  df-pw 3386  df-sn 3406  df-pr 3407  df-op 3409  df-uni 3606  df-br 3790  df-opab 3844  df-xp 4376  df-rel 4377  df-cnv 4378  df-co 4379  df-dm 4380  df-rn 4381  df-res 4382  df-ima 4383  df-iota 4892  df-fv 4935  df-ov 5540  df-er 6134  df-ec 6136  df-qs 6140
This theorem is referenced by:  th3qcor  6238  th3q  6239
  Copyright terms: Public domain W3C validator