ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  1idprl GIF version

Theorem 1idprl 7586
Description: Lemma for 1idpr 7588. (Contributed by Jim Kingdon, 13-Dec-2019.)
Assertion
Ref Expression
1idprl (𝐴P → (1st ‘(𝐴 ·P 1P)) = (1st𝐴))

Proof of Theorem 1idprl
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssid 3175 . . . . . 6 (1st ‘1P) ⊆ (1st ‘1P)
2 rexss 3222 . . . . . 6 ((1st ‘1P) ⊆ (1st ‘1P) → (∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔) ↔ ∃𝑔 ∈ (1st ‘1P)(𝑔 ∈ (1st ‘1P) ∧ 𝑥 = (𝑓 ·Q 𝑔))))
31, 2ax-mp 5 . . . . 5 (∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔) ↔ ∃𝑔 ∈ (1st ‘1P)(𝑔 ∈ (1st ‘1P) ∧ 𝑥 = (𝑓 ·Q 𝑔)))
4 1pr 7550 . . . . . . . . . . 11 1PP
5 prop 7471 . . . . . . . . . . . 12 (1PP → ⟨(1st ‘1P), (2nd ‘1P)⟩ ∈ P)
6 elprnql 7477 . . . . . . . . . . . 12 ((⟨(1st ‘1P), (2nd ‘1P)⟩ ∈ P𝑔 ∈ (1st ‘1P)) → 𝑔Q)
75, 6sylan 283 . . . . . . . . . . 11 ((1PP𝑔 ∈ (1st ‘1P)) → 𝑔Q)
84, 7mpan 424 . . . . . . . . . 10 (𝑔 ∈ (1st ‘1P) → 𝑔Q)
9 prop 7471 . . . . . . . . . . . 12 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
10 elprnql 7477 . . . . . . . . . . . 12 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑓 ∈ (1st𝐴)) → 𝑓Q)
119, 10sylan 283 . . . . . . . . . . 11 ((𝐴P𝑓 ∈ (1st𝐴)) → 𝑓Q)
12 breq1 4005 . . . . . . . . . . . . 13 (𝑥 = (𝑓 ·Q 𝑔) → (𝑥 <Q 𝑓 ↔ (𝑓 ·Q 𝑔) <Q 𝑓))
13123ad2ant3 1020 . . . . . . . . . . . 12 ((𝑓Q𝑔Q𝑥 = (𝑓 ·Q 𝑔)) → (𝑥 <Q 𝑓 ↔ (𝑓 ·Q 𝑔) <Q 𝑓))
14 1prl 7551 . . . . . . . . . . . . . . 15 (1st ‘1P) = {𝑔𝑔 <Q 1Q}
1514abeq2i 2288 . . . . . . . . . . . . . 14 (𝑔 ∈ (1st ‘1P) ↔ 𝑔 <Q 1Q)
16 1nq 7362 . . . . . . . . . . . . . . . . 17 1QQ
17 ltmnqg 7397 . . . . . . . . . . . . . . . . 17 ((𝑔Q ∧ 1QQ𝑓Q) → (𝑔 <Q 1Q ↔ (𝑓 ·Q 𝑔) <Q (𝑓 ·Q 1Q)))
1816, 17mp3an2 1325 . . . . . . . . . . . . . . . 16 ((𝑔Q𝑓Q) → (𝑔 <Q 1Q ↔ (𝑓 ·Q 𝑔) <Q (𝑓 ·Q 1Q)))
1918ancoms 268 . . . . . . . . . . . . . . 15 ((𝑓Q𝑔Q) → (𝑔 <Q 1Q ↔ (𝑓 ·Q 𝑔) <Q (𝑓 ·Q 1Q)))
20 mulidnq 7385 . . . . . . . . . . . . . . . . 17 (𝑓Q → (𝑓 ·Q 1Q) = 𝑓)
2120breq2d 4014 . . . . . . . . . . . . . . . 16 (𝑓Q → ((𝑓 ·Q 𝑔) <Q (𝑓 ·Q 1Q) ↔ (𝑓 ·Q 𝑔) <Q 𝑓))
2221adantr 276 . . . . . . . . . . . . . . 15 ((𝑓Q𝑔Q) → ((𝑓 ·Q 𝑔) <Q (𝑓 ·Q 1Q) ↔ (𝑓 ·Q 𝑔) <Q 𝑓))
2319, 22bitrd 188 . . . . . . . . . . . . . 14 ((𝑓Q𝑔Q) → (𝑔 <Q 1Q ↔ (𝑓 ·Q 𝑔) <Q 𝑓))
2415, 23bitr2id 193 . . . . . . . . . . . . 13 ((𝑓Q𝑔Q) → ((𝑓 ·Q 𝑔) <Q 𝑓𝑔 ∈ (1st ‘1P)))
25243adant3 1017 . . . . . . . . . . . 12 ((𝑓Q𝑔Q𝑥 = (𝑓 ·Q 𝑔)) → ((𝑓 ·Q 𝑔) <Q 𝑓𝑔 ∈ (1st ‘1P)))
2613, 25bitrd 188 . . . . . . . . . . 11 ((𝑓Q𝑔Q𝑥 = (𝑓 ·Q 𝑔)) → (𝑥 <Q 𝑓𝑔 ∈ (1st ‘1P)))
2711, 26syl3an1 1271 . . . . . . . . . 10 (((𝐴P𝑓 ∈ (1st𝐴)) ∧ 𝑔Q𝑥 = (𝑓 ·Q 𝑔)) → (𝑥 <Q 𝑓𝑔 ∈ (1st ‘1P)))
288, 27syl3an2 1272 . . . . . . . . 9 (((𝐴P𝑓 ∈ (1st𝐴)) ∧ 𝑔 ∈ (1st ‘1P) ∧ 𝑥 = (𝑓 ·Q 𝑔)) → (𝑥 <Q 𝑓𝑔 ∈ (1st ‘1P)))
29283expia 1205 . . . . . . . 8 (((𝐴P𝑓 ∈ (1st𝐴)) ∧ 𝑔 ∈ (1st ‘1P)) → (𝑥 = (𝑓 ·Q 𝑔) → (𝑥 <Q 𝑓𝑔 ∈ (1st ‘1P))))
3029pm5.32rd 451 . . . . . . 7 (((𝐴P𝑓 ∈ (1st𝐴)) ∧ 𝑔 ∈ (1st ‘1P)) → ((𝑥 <Q 𝑓𝑥 = (𝑓 ·Q 𝑔)) ↔ (𝑔 ∈ (1st ‘1P) ∧ 𝑥 = (𝑓 ·Q 𝑔))))
3130rexbidva 2474 . . . . . 6 ((𝐴P𝑓 ∈ (1st𝐴)) → (∃𝑔 ∈ (1st ‘1P)(𝑥 <Q 𝑓𝑥 = (𝑓 ·Q 𝑔)) ↔ ∃𝑔 ∈ (1st ‘1P)(𝑔 ∈ (1st ‘1P) ∧ 𝑥 = (𝑓 ·Q 𝑔))))
32 r19.42v 2634 . . . . . 6 (∃𝑔 ∈ (1st ‘1P)(𝑥 <Q 𝑓𝑥 = (𝑓 ·Q 𝑔)) ↔ (𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔)))
3331, 32bitr3di 195 . . . . 5 ((𝐴P𝑓 ∈ (1st𝐴)) → (∃𝑔 ∈ (1st ‘1P)(𝑔 ∈ (1st ‘1P) ∧ 𝑥 = (𝑓 ·Q 𝑔)) ↔ (𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔))))
343, 33bitrid 192 . . . 4 ((𝐴P𝑓 ∈ (1st𝐴)) → (∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔) ↔ (𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔))))
3534rexbidva 2474 . . 3 (𝐴P → (∃𝑓 ∈ (1st𝐴)∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔) ↔ ∃𝑓 ∈ (1st𝐴)(𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔))))
36 df-imp 7465 . . . . 5 ·P = (𝑦P, 𝑧P ↦ ⟨{𝑤Q ∣ ∃𝑢Q𝑣Q (𝑢 ∈ (1st𝑦) ∧ 𝑣 ∈ (1st𝑧) ∧ 𝑤 = (𝑢 ·Q 𝑣))}, {𝑤Q ∣ ∃𝑢Q𝑣Q (𝑢 ∈ (2nd𝑦) ∧ 𝑣 ∈ (2nd𝑧) ∧ 𝑤 = (𝑢 ·Q 𝑣))}⟩)
37 mulclnq 7372 . . . . 5 ((𝑢Q𝑣Q) → (𝑢 ·Q 𝑣) ∈ Q)
3836, 37genpelvl 7508 . . . 4 ((𝐴P ∧ 1PP) → (𝑥 ∈ (1st ‘(𝐴 ·P 1P)) ↔ ∃𝑓 ∈ (1st𝐴)∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔)))
394, 38mpan2 425 . . 3 (𝐴P → (𝑥 ∈ (1st ‘(𝐴 ·P 1P)) ↔ ∃𝑓 ∈ (1st𝐴)∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔)))
40 prnmaxl 7484 . . . . . . 7 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑥 ∈ (1st𝐴)) → ∃𝑓 ∈ (1st𝐴)𝑥 <Q 𝑓)
419, 40sylan 283 . . . . . 6 ((𝐴P𝑥 ∈ (1st𝐴)) → ∃𝑓 ∈ (1st𝐴)𝑥 <Q 𝑓)
42 ltrelnq 7361 . . . . . . . . . . . . 13 <Q ⊆ (Q × Q)
4342brel 4677 . . . . . . . . . . . 12 (𝑥 <Q 𝑓 → (𝑥Q𝑓Q))
44 ltmnqg 7397 . . . . . . . . . . . . . . . 16 ((𝑦Q𝑧Q𝑤Q) → (𝑦 <Q 𝑧 ↔ (𝑤 ·Q 𝑦) <Q (𝑤 ·Q 𝑧)))
4544adantl 277 . . . . . . . . . . . . . . 15 (((𝑥Q𝑓Q) ∧ (𝑦Q𝑧Q𝑤Q)) → (𝑦 <Q 𝑧 ↔ (𝑤 ·Q 𝑦) <Q (𝑤 ·Q 𝑧)))
46 simpl 109 . . . . . . . . . . . . . . 15 ((𝑥Q𝑓Q) → 𝑥Q)
47 simpr 110 . . . . . . . . . . . . . . 15 ((𝑥Q𝑓Q) → 𝑓Q)
48 recclnq 7388 . . . . . . . . . . . . . . . 16 (𝑓Q → (*Q𝑓) ∈ Q)
4948adantl 277 . . . . . . . . . . . . . . 15 ((𝑥Q𝑓Q) → (*Q𝑓) ∈ Q)
50 mulcomnqg 7379 . . . . . . . . . . . . . . . 16 ((𝑦Q𝑧Q) → (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦))
5150adantl 277 . . . . . . . . . . . . . . 15 (((𝑥Q𝑓Q) ∧ (𝑦Q𝑧Q)) → (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦))
5245, 46, 47, 49, 51caovord2d 6041 . . . . . . . . . . . . . 14 ((𝑥Q𝑓Q) → (𝑥 <Q 𝑓 ↔ (𝑥 ·Q (*Q𝑓)) <Q (𝑓 ·Q (*Q𝑓))))
53 recidnq 7389 . . . . . . . . . . . . . . . 16 (𝑓Q → (𝑓 ·Q (*Q𝑓)) = 1Q)
5453breq2d 4014 . . . . . . . . . . . . . . 15 (𝑓Q → ((𝑥 ·Q (*Q𝑓)) <Q (𝑓 ·Q (*Q𝑓)) ↔ (𝑥 ·Q (*Q𝑓)) <Q 1Q))
5554adantl 277 . . . . . . . . . . . . . 14 ((𝑥Q𝑓Q) → ((𝑥 ·Q (*Q𝑓)) <Q (𝑓 ·Q (*Q𝑓)) ↔ (𝑥 ·Q (*Q𝑓)) <Q 1Q))
5652, 55bitrd 188 . . . . . . . . . . . . 13 ((𝑥Q𝑓Q) → (𝑥 <Q 𝑓 ↔ (𝑥 ·Q (*Q𝑓)) <Q 1Q))
5756biimpd 144 . . . . . . . . . . . 12 ((𝑥Q𝑓Q) → (𝑥 <Q 𝑓 → (𝑥 ·Q (*Q𝑓)) <Q 1Q))
5843, 57mpcom 36 . . . . . . . . . . 11 (𝑥 <Q 𝑓 → (𝑥 ·Q (*Q𝑓)) <Q 1Q)
59 mulclnq 7372 . . . . . . . . . . . . . 14 ((𝑥Q ∧ (*Q𝑓) ∈ Q) → (𝑥 ·Q (*Q𝑓)) ∈ Q)
6048, 59sylan2 286 . . . . . . . . . . . . 13 ((𝑥Q𝑓Q) → (𝑥 ·Q (*Q𝑓)) ∈ Q)
6143, 60syl 14 . . . . . . . . . . . 12 (𝑥 <Q 𝑓 → (𝑥 ·Q (*Q𝑓)) ∈ Q)
62 breq1 4005 . . . . . . . . . . . . 13 (𝑔 = (𝑥 ·Q (*Q𝑓)) → (𝑔 <Q 1Q ↔ (𝑥 ·Q (*Q𝑓)) <Q 1Q))
6362, 14elab2g 2884 . . . . . . . . . . . 12 ((𝑥 ·Q (*Q𝑓)) ∈ Q → ((𝑥 ·Q (*Q𝑓)) ∈ (1st ‘1P) ↔ (𝑥 ·Q (*Q𝑓)) <Q 1Q))
6461, 63syl 14 . . . . . . . . . . 11 (𝑥 <Q 𝑓 → ((𝑥 ·Q (*Q𝑓)) ∈ (1st ‘1P) ↔ (𝑥 ·Q (*Q𝑓)) <Q 1Q))
6558, 64mpbird 167 . . . . . . . . . 10 (𝑥 <Q 𝑓 → (𝑥 ·Q (*Q𝑓)) ∈ (1st ‘1P))
66 mulassnqg 7380 . . . . . . . . . . . . . 14 ((𝑦Q𝑧Q𝑤Q) → ((𝑦 ·Q 𝑧) ·Q 𝑤) = (𝑦 ·Q (𝑧 ·Q 𝑤)))
6766adantl 277 . . . . . . . . . . . . 13 (((𝑥Q𝑓Q) ∧ (𝑦Q𝑧Q𝑤Q)) → ((𝑦 ·Q 𝑧) ·Q 𝑤) = (𝑦 ·Q (𝑧 ·Q 𝑤)))
6847, 46, 49, 51, 67caov12d 6053 . . . . . . . . . . . 12 ((𝑥Q𝑓Q) → (𝑓 ·Q (𝑥 ·Q (*Q𝑓))) = (𝑥 ·Q (𝑓 ·Q (*Q𝑓))))
6953oveq2d 5888 . . . . . . . . . . . . 13 (𝑓Q → (𝑥 ·Q (𝑓 ·Q (*Q𝑓))) = (𝑥 ·Q 1Q))
7069adantl 277 . . . . . . . . . . . 12 ((𝑥Q𝑓Q) → (𝑥 ·Q (𝑓 ·Q (*Q𝑓))) = (𝑥 ·Q 1Q))
71 mulidnq 7385 . . . . . . . . . . . . 13 (𝑥Q → (𝑥 ·Q 1Q) = 𝑥)
7271adantr 276 . . . . . . . . . . . 12 ((𝑥Q𝑓Q) → (𝑥 ·Q 1Q) = 𝑥)
7368, 70, 723eqtrrd 2215 . . . . . . . . . . 11 ((𝑥Q𝑓Q) → 𝑥 = (𝑓 ·Q (𝑥 ·Q (*Q𝑓))))
7443, 73syl 14 . . . . . . . . . 10 (𝑥 <Q 𝑓𝑥 = (𝑓 ·Q (𝑥 ·Q (*Q𝑓))))
75 oveq2 5880 . . . . . . . . . . . 12 (𝑔 = (𝑥 ·Q (*Q𝑓)) → (𝑓 ·Q 𝑔) = (𝑓 ·Q (𝑥 ·Q (*Q𝑓))))
7675eqeq2d 2189 . . . . . . . . . . 11 (𝑔 = (𝑥 ·Q (*Q𝑓)) → (𝑥 = (𝑓 ·Q 𝑔) ↔ 𝑥 = (𝑓 ·Q (𝑥 ·Q (*Q𝑓)))))
7776rspcev 2841 . . . . . . . . . 10 (((𝑥 ·Q (*Q𝑓)) ∈ (1st ‘1P) ∧ 𝑥 = (𝑓 ·Q (𝑥 ·Q (*Q𝑓)))) → ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔))
7865, 74, 77syl2anc 411 . . . . . . . . 9 (𝑥 <Q 𝑓 → ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔))
7978a1i 9 . . . . . . . 8 (𝑓 ∈ (1st𝐴) → (𝑥 <Q 𝑓 → ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔)))
8079ancld 325 . . . . . . 7 (𝑓 ∈ (1st𝐴) → (𝑥 <Q 𝑓 → (𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔))))
8180reximia 2572 . . . . . 6 (∃𝑓 ∈ (1st𝐴)𝑥 <Q 𝑓 → ∃𝑓 ∈ (1st𝐴)(𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔)))
8241, 81syl 14 . . . . 5 ((𝐴P𝑥 ∈ (1st𝐴)) → ∃𝑓 ∈ (1st𝐴)(𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔)))
8382ex 115 . . . 4 (𝐴P → (𝑥 ∈ (1st𝐴) → ∃𝑓 ∈ (1st𝐴)(𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔))))
84 prcdnql 7480 . . . . . . 7 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P𝑓 ∈ (1st𝐴)) → (𝑥 <Q 𝑓𝑥 ∈ (1st𝐴)))
859, 84sylan 283 . . . . . 6 ((𝐴P𝑓 ∈ (1st𝐴)) → (𝑥 <Q 𝑓𝑥 ∈ (1st𝐴)))
8685adantrd 279 . . . . 5 ((𝐴P𝑓 ∈ (1st𝐴)) → ((𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔)) → 𝑥 ∈ (1st𝐴)))
8786rexlimdva 2594 . . . 4 (𝐴P → (∃𝑓 ∈ (1st𝐴)(𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔)) → 𝑥 ∈ (1st𝐴)))
8883, 87impbid 129 . . 3 (𝐴P → (𝑥 ∈ (1st𝐴) ↔ ∃𝑓 ∈ (1st𝐴)(𝑥 <Q 𝑓 ∧ ∃𝑔 ∈ (1st ‘1P)𝑥 = (𝑓 ·Q 𝑔))))
8935, 39, 883bitr4d 220 . 2 (𝐴P → (𝑥 ∈ (1st ‘(𝐴 ·P 1P)) ↔ 𝑥 ∈ (1st𝐴)))
9089eqrdv 2175 1 (𝐴P → (1st ‘(𝐴 ·P 1P)) = (1st𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 978   = wceq 1353  wcel 2148  wrex 2456  wss 3129  cop 3595   class class class wbr 4002  cfv 5215  (class class class)co 5872  1st c1st 6136  2nd c2nd 6137  Qcnq 7276  1Qc1q 7277   ·Q cmq 7279  *Qcrq 7280   <Q cltq 7281  Pcnp 7287  1Pc1p 7288   ·P cmp 7290
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-coll 4117  ax-sep 4120  ax-nul 4128  ax-pow 4173  ax-pr 4208  ax-un 4432  ax-setind 4535  ax-iinf 4586
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  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-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4003  df-opab 4064  df-mpt 4065  df-tr 4101  df-eprel 4288  df-id 4292  df-po 4295  df-iso 4296  df-iord 4365  df-on 4367  df-suc 4370  df-iom 4589  df-xp 4631  df-rel 4632  df-cnv 4633  df-co 4634  df-dm 4635  df-rn 4636  df-res 4637  df-ima 4638  df-iota 5177  df-fun 5217  df-fn 5218  df-f 5219  df-f1 5220  df-fo 5221  df-f1o 5222  df-fv 5223  df-ov 5875  df-oprab 5876  df-mpo 5877  df-1st 6138  df-2nd 6139  df-recs 6303  df-irdg 6368  df-1o 6414  df-oadd 6418  df-omul 6419  df-er 6532  df-ec 6534  df-qs 6538  df-ni 7300  df-pli 7301  df-mi 7302  df-lti 7303  df-plpq 7340  df-mpq 7341  df-enq 7343  df-nqqs 7344  df-plqqs 7345  df-mqqs 7346  df-1nqqs 7347  df-rq 7348  df-ltnqqs 7349  df-inp 7462  df-i1p 7463  df-imp 7465
This theorem is referenced by:  1idpr  7588
  Copyright terms: Public domain W3C validator