Theorem dmaddpq 7369

Description: Domain of addition on positive fractions. (Contributed by NM, 24-Aug-1995.)

Assertion

Ref	Expression
dmaddpq	⊢ dom +Q = (Q × Q)

Proof of Theorem dmaddpq

Dummy variables 𝑥 𝑦 𝑧 𝑣 𝑤 𝑢 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmoprab 5950	. . 3 ⊢ dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))}
2		df-plqqs 7339	. . . 4 ⊢ +Q = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))}
3	2	dmeqi 4824	. . 3 ⊢ dom +Q = dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))}
4		dmaddpqlem 7367	. . . . . . . . 9 ⊢ (𝑥 ∈ Q → ∃𝑤∃𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q )
5		dmaddpqlem 7367	. . . . . . . . 9 ⊢ (𝑦 ∈ Q → ∃𝑢∃𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q )
6	4, 5	anim12i 338	. . . . . . . 8 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (∃𝑤∃𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ ∃𝑢∃𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
7		ee4anv 1934	. . . . . . . 8 ⊢ (∃𝑤∃𝑣∃𝑢∃𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ↔ (∃𝑤∃𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ ∃𝑢∃𝑓 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
8	6, 7	sylibr 134	. . . . . . 7 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → ∃𝑤∃𝑣∃𝑢∃𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ))
9		enqex 7350	. . . . . . . . . . . . . 14 ⊢ ~Q ∈ V
10		ecexg 6533	. . . . . . . . . . . . . 14 ⊢ ( ~Q ∈ V → [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ∈ V)
11	9, 10	ax-mp 5	. . . . . . . . . . . . 13 ⊢ [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ∈ V
12	11	isseti 2745	. . . . . . . . . . . 12 ⊢ ∃𝑧 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q
13		ax-ia3 108	. . . . . . . . . . . . 13 ⊢ ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → (𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q → ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q )))
14	13	eximdv 1880	. . . . . . . . . . . 12 ⊢ ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → (∃𝑧 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q → ∃𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q )))
15	12, 14	mpi 15	. . . . . . . . . . 11 ⊢ ((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))
16	15	2eximi 1601	. . . . . . . . . 10 ⊢ (∃𝑢∃𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑢∃𝑓∃𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))
17		exrot3 1690	. . . . . . . . . 10 ⊢ (∃𝑧∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ) ↔ ∃𝑢∃𝑓∃𝑧((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))
18	16, 17	sylibr 134	. . . . . . . . 9 ⊢ (∃𝑢∃𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑧∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))
19	18	2eximi 1601	. . . . . . . 8 ⊢ (∃𝑤∃𝑣∃𝑢∃𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑤∃𝑣∃𝑧∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))
20		exrot3 1690	. . . . . . . 8 ⊢ (∃𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ) ↔ ∃𝑤∃𝑣∃𝑧∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))
21	19, 20	sylibr 134	. . . . . . 7 ⊢ (∃𝑤∃𝑣∃𝑢∃𝑓(𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) → ∃𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))
22	8, 21	syl 14	. . . . . 6 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → ∃𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))
23	22	pm4.71i 391	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ↔ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q )))
24		19.42v 1906	. . . . 5 ⊢ (∃𝑧((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q )) ↔ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q )))
25	23, 24	bitr4i 187	. . . 4 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ↔ ∃𝑧((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q )))
26	25	opabbii 4067	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ Q ∧ 𝑦 ∈ Q)} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q ∧ 𝑦 = [⟨𝑢, 𝑓⟩] ~Q ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ +pQ ⟨𝑢, 𝑓⟩)] ~Q ))}
27	1, 3, 26	3eqtr4i 2208	. 2 ⊢ dom +Q = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ Q ∧ 𝑦 ∈ Q)}
28		df-xp 4629	. 2 ⊢ (Q × Q) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ Q ∧ 𝑦 ∈ Q)}
29	27, 28	eqtr4i 2201	1 ⊢ dom +Q = (Q × Q)

Syntax hints:   ∧ wa 104   = wceq 1353  ∃wex 1492   ∈ wcel 2148  Vcvv 2737  ⟨cop 3594  {copab 4060   × cxp 4621  dom cdm 4623  (class class class)co 5869  {coprab 5870  [cec 6527   +_pQ cplpq 7266   ~_Q ceq 7269  Qcnq 7270   +_Q cplq 7272

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-iinf 4584

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-br 4001  df-opab 4062  df-iom 4587  df-xp 4629  df-cnv 4631  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-oprab 5873  df-ec 6531  df-qs 6535  df-ni 7294  df-enq 7337  df-nqqs 7338  df-plqqs 7339

This theorem is referenced by: (None)