Theorem dmrecnq 10971

Description: Domain of reciprocal on positive fractions. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 10-Jul-2014.) (New usage is discouraged.)

Assertion

Ref	Expression
dmrecnq	⊢ dom *Q = Q

Proof of Theorem dmrecnq

Step	Hyp	Ref	Expression
1		df-rq 10920	. . . . . 6 ⊢ *Q = (◡ ·Q “ {1Q})
2		cnvimass 6089	. . . . . 6 ⊢ (◡ ·Q “ {1Q}) ⊆ dom ·Q
3	1, 2	eqsstri 3986	. . . . 5 ⊢ *Q ⊆ dom ·Q
4		mulnqf 10952	. . . . . 6 ⊢ ·Q :(Q × Q)⟶Q
5	4	fdmi 6724	. . . . 5 ⊢ dom ·Q = (Q × Q)
6	3, 5	sseqtri 3988	. . . 4 ⊢ *Q ⊆ (Q × Q)
7		dmss 5897	. . . 4 ⊢ (*Q ⊆ (Q × Q) → dom *Q ⊆ dom (Q × Q))
8	6, 7	ax-mp 5	. . 3 ⊢ dom *Q ⊆ dom (Q × Q)
9		dmxpid 5925	. . 3 ⊢ dom (Q × Q) = Q
10	8, 9	sseqtri 3988	. 2 ⊢ dom *Q ⊆ Q
11		recclnq 10969	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (*Q‘𝑥) ∈ Q)
12		opelxpi 5703	. . . . . . . 8 ⊢ ((𝑥 ∈ Q ∧ (*Q‘𝑥) ∈ Q) → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q))
13	11, 12	mpdan 700	. . . . . . 7 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q))
14		df-ov 7426	. . . . . . . 8 ⊢ (𝑥 ·Q (*Q‘𝑥)) = ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩)
15		recidnq 10968	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (𝑥 ·Q (*Q‘𝑥)) = 1Q)
16	14, 15	eqtr3id 2815	. . . . . . 7 ⊢ (𝑥 ∈ Q → ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩) = 1Q)
17		ffn 6712	. . . . . . . 8 ⊢ ( ·Q :(Q × Q)⟶Q → ·Q Fn (Q × Q))
18		fniniseg 7062	. . . . . . . 8 ⊢ ( ·Q Fn (Q × Q) → (⟨𝑥, (*Q‘𝑥)⟩ ∈ (◡ ·Q “ {1Q}) ↔ (⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q) ∧ ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩) = 1Q)))
19	4, 17, 18	mp2b 10	. . . . . . 7 ⊢ (⟨𝑥, (*Q‘𝑥)⟩ ∈ (◡ ·Q “ {1Q}) ↔ (⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q) ∧ ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩) = 1Q))
20	13, 16, 19	sylanbrc 595	. . . . . 6 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (◡ ·Q “ {1Q}))
21	20, 1	eleqtrrdi 2877	. . . . 5 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ *Q)
22		df-br 5115	. . . . 5 ⊢ (𝑥*Q(*Q‘𝑥) ↔ ⟨𝑥, (*Q‘𝑥)⟩ ∈ *Q)
23	21, 22	sylibr 237	. . . 4 ⊢ (𝑥 ∈ Q → 𝑥*Q(*Q‘𝑥))
24		vex 3462	. . . . 5 ⊢ 𝑥 ∈ V
25		fvex 6901	. . . . 5 ⊢ (*Q‘𝑥) ∈ V
26	24, 25	breldm 5903	. . . 4 ⊢ (𝑥*Q(*Q‘𝑥) → 𝑥 ∈ dom *Q)
27	23, 26	syl 18	. . 3 ⊢ (𝑥 ∈ Q → 𝑥 ∈ dom *Q)
28	27	ssriv 3944	. 2 ⊢ Q ⊆ dom *Q
29	10, 28	eqssi 3956	1 ⊢ dom *Q = Q

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ⊆ wss 3908  {csn 4594  ⟨cop 4600   class class class wbr 5114   × cxp 5664  ^◡ccnv 5665  dom cdm 5666   “ cima 5669   Fn wfn 6538  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423  Qcnq 10855  1_Qc1q 10856   ·_Q cmq 10859  *_Qcrq 10860

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-oadd 8466  df-omul 8467  df-er 8703  df-ni 10875  df-mi 10877  df-lti 10878  df-mpq 10912  df-enq 10914  df-nq 10915  df-erq 10916  df-mq 10918  df-1nq 10919  df-rq 10920

This theorem is used by:  ltrnq  10982  reclem2pr  11051