Theorem dmrecnq 11080

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 11029	. . . . . 6 ⊢ *Q = (◡ ·Q “ {1Q})
2		cnvimass 6211	. . . . . 6 ⊢ (◡ ·Q “ {1Q}) ⊆ dom ·Q
3	1, 2	eqsstri 3959	. . . . 5 ⊢ *Q ⊆ dom ·Q
4		mulnqf 11061	. . . . . 6 ⊢ ·Q :(Q × Q)⟶Q
5	4	fdmi 6743	. . . . 5 ⊢ dom ·Q = (Q × Q)
6	3, 5	sseqtri 3961	. . . 4 ⊢ *Q ⊆ (Q × Q)
7		dmss 5891	. . . 4 ⊢ (*Q ⊆ (Q × Q) → dom *Q ⊆ dom (Q × Q))
8	6, 7	ax-mp 5	. . 3 ⊢ dom *Q ⊆ dom (Q × Q)
9		dmxpid 5919	. . 3 ⊢ dom (Q × Q) = Q
10	8, 9	sseqtri 3961	. 2 ⊢ dom *Q ⊆ Q
11		recclnq 11078	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (*Q‘𝑥) ∈ Q)
12		opelxpi 5692	. . . . . . . 8 ⊢ ((𝑥 ∈ Q ∧ (*Q‘𝑥) ∈ Q) → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q))
13	11, 12	mpdan 700	. . . . . . 7 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ (Q × Q))
14		df-ov 7446	. . . . . . . 8 ⊢ (𝑥 ·Q (*Q‘𝑥)) = ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩)
15		recidnq 11077	. . . . . . . 8 ⊢ (𝑥 ∈ Q → (𝑥 ·Q (*Q‘𝑥)) = 1Q)
16	14, 15	eqtr3id 2812	. . . . . . 7 ⊢ (𝑥 ∈ Q → ( ·Q ‘⟨𝑥, (*Q‘𝑥)⟩) = 1Q)
17		ffn 6731	. . . . . . . 8 ⊢ ( ·Q :(Q × Q)⟶Q → ·Q Fn (Q × Q))
18		fniniseg 7083	. . . . . . . 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 2875	. . . . 5 ⊢ (𝑥 ∈ Q → ⟨𝑥, (*Q‘𝑥)⟩ ∈ *Q)
22		df-br 5107	. . . . 5 ⊢ (𝑥*Q(*Q‘𝑥) ↔ ⟨𝑥, (*Q‘𝑥)⟩ ∈ *Q)
23	21, 22	sylibr 237	. . . 4 ⊢ (𝑥 ∈ Q → 𝑥*Q(*Q‘𝑥))
24		vex 3458	. . . . 5 ⊢ 𝑥 ∈ V
25		fvex 6921	. . . . 5 ⊢ (*Q‘𝑥) ∈ V
26	24, 25	breldm 5897	. . . 4 ⊢ (𝑥*Q(*Q‘𝑥) → 𝑥 ∈ dom *Q)
27	23, 26	syl 18	. . 3 ⊢ (𝑥 ∈ Q → 𝑥 ∈ dom *Q)
28	27	ssriv 3917	. 2 ⊢ Q ⊆ dom *Q
29	10, 28	eqssi 3929	1 ⊢ dom *Q = Q

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  {csn 4588  ⟨cop 4838   class class class wbr 5106   × cxp 5653  ^◡ccnv 5654  dom cdm 5655   “ cima 5658   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  Qcnq 10964  1_Qc1q 10965   ·_Q cmq 10968  *_Qcrq 10969

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-oadd 8508  df-omul 8509  df-er 8745  df-ni 10984  df-mi 10986  df-lti 10987  df-mpq 11021  df-enq 11023  df-nq 11024  df-erq 11025  df-mq 11027  df-1nq 11028  df-rq 11029

This theorem is used by:  ltrnq  11091  reclem2pr  11160