Theorem dmrecnq 11056

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 11005	. . . . . 6 ⊢ *Q = (◡ ·Q “ {1Q})
2		cnvimass 6198	. . . . . 6 ⊢ (◡ ·Q “ {1Q}) ⊆ dom ·Q
3	1, 2	eqsstri 3954	. . . . 5 ⊢ *Q ⊆ dom ·Q
4		mulnqf 11037	. . . . . 6 ⊢ ·Q :(Q × Q)⟶Q
5	4	fdmi 6721	. . . . 5 ⊢ dom ·Q = (Q × Q)
6	3, 5	sseqtri 3956	. . . 4 ⊢ *Q ⊆ (Q × Q)
7		dmss 5883	. . . 4 ⊢ (*Q ⊆ (Q × Q) → dom *Q ⊆ dom (Q × Q))
8	6, 7	ax-mp 5	. . 3 ⊢ dom *Q ⊆ dom (Q × Q)
9		dmxpid 5911	. . 3 ⊢ dom (Q × Q) = Q
10	8, 9	sseqtri 3956	. 2 ⊢ dom *Q ⊆ Q
11		recclnq 11054	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (*Q‘𝑥) ∈ Q)
12		opelxpi 5687	. . . . . . . 8 ⊢ ((𝑥 ∈ Q ∧ (*Q‘𝑥) ∈ Q) → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q))
13	11, 12	mpdan 700	. . . . . . 7 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q))
14		df-ov 7423	. . . . . . . 8 ⊢ (𝑥 ·Q (*Q‘𝑥)) = ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩)
15		recidnq 11053	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (𝑥 ·Q (*Q‘𝑥)) = 1Q)
16	14, 15	eqtr3id 2809	. . . . . . 7 ⊢ (𝑥 ∈ Q → ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩) = 1Q)
17		ffn 6709	. . . . . . . 8 ⊢ ( ·Q :(Q × Q)⟶Q → ·Q Fn (Q × Q))
18		fniniseg 7059	. . . . . . . 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 2871	. . . . 5 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ *Q)
22		df-br 5103	. . . . 5 ⊢ (𝑥*Q(*Q‘𝑥) ↔ ⟨𝑥, (*Q‘𝑥)⟩ ∈ *Q)
23	21, 22	sylibr 237	. . . 4 ⊢ (𝑥 ∈ Q → 𝑥*Q(*Q‘𝑥))
24		vex 3454	. . . . 5 ⊢ 𝑥 ∈ V
25		fvex 6898	. . . . 5 ⊢ (*Q‘𝑥) ∈ V
26	24, 25	breldm 5889	. . . 4 ⊢ (𝑥*Q(*Q‘𝑥) → 𝑥 ∈ dom *Q)
27	23, 26	syl 18	. . 3 ⊢ (𝑥 ∈ Q → 𝑥 ∈ dom *Q)
28	27	ssriv 3912	. 2 ⊢ Q ⊆ dom *Q
29	10, 28	eqssi 3924	1 ⊢ dom *Q = Q

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ⊆ wss 3895  {csn 4584  ⟨cop 4834   class class class wbr 5102   × cxp 5648  ^◡ccnv 5649  dom cdm 5650   “ cima 5653   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Qcnq 10940  1_Qc1q 10941   ·_Q cmq 10944  *_Qcrq 10945

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-1o 8479  df-oadd 8483  df-omul 8484  df-er 8720  df-ni 10960  df-mi 10962  df-lti 10963  df-mpq 10997  df-enq 10999  df-nq 11000  df-erq 11001  df-mq 11003  df-1nq 11004  df-rq 11005

This theorem is used by:  ltrnq  11067  reclem2pr  11136