Theorem dmrecnq 11031

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 10980	. . . . . 6 ⊢ *Q = (◡ ·Q “ {1Q})
2		cnvimass 6076	. . . . . 6 ⊢ (◡ ·Q “ {1Q}) ⊆ dom ·Q
3	1, 2	eqsstri 3977	. . . . 5 ⊢ *Q ⊆ dom ·Q
4		mulnqf 11012	. . . . . 6 ⊢ ·Q :(Q × Q)⟶Q
5	4	fdmi 6713	. . . . 5 ⊢ dom ·Q = (Q × Q)
6	3, 5	sseqtri 3979	. . . 4 ⊢ *Q ⊆ (Q × Q)
7		dmss 5884	. . . 4 ⊢ (*Q ⊆ (Q × Q) → dom *Q ⊆ dom (Q × Q))
8	6, 7	ax-mp 5	. . 3 ⊢ dom *Q ⊆ dom (Q × Q)
9		dmxpid 5912	. . 3 ⊢ dom (Q × Q) = Q
10	8, 9	sseqtri 3979	. 2 ⊢ dom *Q ⊆ Q
11		recclnq 11029	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (*Q‘𝑥) ∈ Q)
12		opelxpi 5688	. . . . . . . 8 ⊢ ((𝑥 ∈ Q ∧ (*Q‘𝑥) ∈ Q) → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q))
13	11, 12	mpdan 700	. . . . . . 7 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q))
14		df-ov 7415	. . . . . . . 8 ⊢ (𝑥 ·Q (*Q‘𝑥)) = ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩)
15		recidnq 11028	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (𝑥 ·Q (*Q‘𝑥)) = 1Q)
16	14, 15	eqtr3id 2810	. . . . . . 7 ⊢ (𝑥 ∈ Q → ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩) = 1Q)
17		ffn 6701	. . . . . . . 8 ⊢ ( ·Q :(Q × Q)⟶Q → ·Q Fn (Q × Q))
18		fniniseg 7051	. . . . . . . 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 2872	. . . . 5 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ *Q)
22		df-br 5104	. . . . 5 ⊢ (𝑥*Q(*Q‘𝑥) ↔ ⟨𝑥, (*Q‘𝑥)⟩ ∈ *Q)
23	21, 22	sylibr 237	. . . 4 ⊢ (𝑥 ∈ Q → 𝑥*Q(*Q‘𝑥))
24		vex 3455	. . . . 5 ⊢ 𝑥 ∈ V
25		fvex 6890	. . . . 5 ⊢ (*Q‘𝑥) ∈ V
26	24, 25	breldm 5890	. . . 4 ⊢ (𝑥*Q(*Q‘𝑥) → 𝑥 ∈ dom *Q)
27	23, 26	syl 18	. . 3 ⊢ (𝑥 ∈ Q → 𝑥 ∈ dom *Q)
28	27	ssriv 3935	. 2 ⊢ Q ⊆ dom *Q
29	10, 28	eqssi 3947	1 ⊢ dom *Q = Q

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899  {csn 4584  ⟨cop 4590   class class class wbr 5103   × cxp 5649  ^◡ccnv 5650  dom cdm 5651   “ cima 5654   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412  Qcnq 10915  1_Qc1q 10916   ·_Q cmq 10919  *_Qcrq 10920

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-oadd 8464  df-omul 8465  df-er 8701  df-ni 10935  df-mi 10937  df-lti 10938  df-mpq 10972  df-enq 10974  df-nq 10975  df-erq 10976  df-mq 10978  df-1nq 10979  df-rq 10980

This theorem is used by:  ltrnq  11042  reclem2pr  11111