mulcomprg - Intuitionistic Logic Explorer

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

Theorem mulcomprg 7599

Description: Multiplication of positive reals is commutative. Proposition 9-3.7(ii) of [Gleason] p. 124. (Contributed by Jim Kingdon, 11-Dec-2019.)

**Assertion**
Ref	Expression
mulcomprg	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·_P 𝐵) = (𝐵 ·_P 𝐴))

Proof of Theorem mulcomprg Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prop 7494	. . . . . . . . 9 ⊢ (𝐵 ∈ P → ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P)
2		elprnql 7500	. . . . . . . . 9 ⊢ ((⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P ∧ 𝑧 ∈ (1^st ‘𝐵)) → 𝑧 ∈ Q)
3	1, 2	sylan 283	. . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ 𝑧 ∈ (1^st ‘𝐵)) → 𝑧 ∈ Q)
4		prop 7494	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
5		elprnql 7500	. . . . . . . . . . . . 13 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑦 ∈ (1^st ‘𝐴)) → 𝑦 ∈ Q)
6	4, 5	sylan 283	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ P ∧ 𝑦 ∈ (1^st ‘𝐴)) → 𝑦 ∈ Q)
7		mulcomnqg 7402	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ Q ∧ 𝑦 ∈ Q) → (𝑧 ·_Q 𝑦) = (𝑦 ·_Q 𝑧))
8	7	eqeq2d 2201	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥 = (𝑧 ·_Q 𝑦) ↔ 𝑥 = (𝑦 ·_Q 𝑧)))
9	6, 8	sylan2 286	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ Q ∧ (𝐴 ∈ P ∧ 𝑦 ∈ (1^st ‘𝐴))) → (𝑥 = (𝑧 ·_Q 𝑦) ↔ 𝑥 = (𝑦 ·_Q 𝑧)))
10	9	anassrs 400	. . . . . . . . . 10 ⊢ (((𝑧 ∈ Q ∧ 𝐴 ∈ P) ∧ 𝑦 ∈ (1^st ‘𝐴)) → (𝑥 = (𝑧 ·_Q 𝑦) ↔ 𝑥 = (𝑦 ·_Q 𝑧)))
11	10	rexbidva 2487	. . . . . . . . 9 ⊢ ((𝑧 ∈ Q ∧ 𝐴 ∈ P) → (∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
12	11	ancoms 268	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝑧 ∈ Q) → (∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
13	3, 12	sylan2 286	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ 𝑧 ∈ (1^st ‘𝐵))) → (∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
14	13	anassrs 400	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝑧 ∈ (1^st ‘𝐵)) → (∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
15	14	rexbidva 2487	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∃𝑧 ∈ (1^st ‘𝐵)∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑧 ∈ (1^st ‘𝐵)∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
16		rexcom 2654	. . . . 5 ⊢ (∃𝑧 ∈ (1^st ‘𝐵)∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧) ↔ ∃𝑦 ∈ (1^st ‘𝐴)∃𝑧 ∈ (1^st ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧))
17	15, 16	bitrdi 196	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∃𝑧 ∈ (1^st ‘𝐵)∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (1^st ‘𝐴)∃𝑧 ∈ (1^st ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧)))
18	17	rabbidv 2741	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → {𝑥 ∈ Q ∣ ∃𝑧 ∈ (1^st ‘𝐵)∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦)} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ (1^st ‘𝐴)∃𝑧 ∈ (1^st ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧)})
19		elprnqu 7501	. . . . . . . . 9 ⊢ ((⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P ∧ 𝑧 ∈ (2^nd ‘𝐵)) → 𝑧 ∈ Q)
20	1, 19	sylan 283	. . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ 𝑧 ∈ (2^nd ‘𝐵)) → 𝑧 ∈ Q)
21		elprnqu 7501	. . . . . . . . . . . . 13 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑦 ∈ (2^nd ‘𝐴)) → 𝑦 ∈ Q)
22	4, 21	sylan 283	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ P ∧ 𝑦 ∈ (2^nd ‘𝐴)) → 𝑦 ∈ Q)
23	22, 8	sylan2 286	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ Q ∧ (𝐴 ∈ P ∧ 𝑦 ∈ (2^nd ‘𝐴))) → (𝑥 = (𝑧 ·_Q 𝑦) ↔ 𝑥 = (𝑦 ·_Q 𝑧)))
24	23	anassrs 400	. . . . . . . . . 10 ⊢ (((𝑧 ∈ Q ∧ 𝐴 ∈ P) ∧ 𝑦 ∈ (2^nd ‘𝐴)) → (𝑥 = (𝑧 ·_Q 𝑦) ↔ 𝑥 = (𝑦 ·_Q 𝑧)))
25	24	rexbidva 2487	. . . . . . . . 9 ⊢ ((𝑧 ∈ Q ∧ 𝐴 ∈ P) → (∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
26	25	ancoms 268	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝑧 ∈ Q) → (∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
27	20, 26	sylan2 286	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ 𝑧 ∈ (2^nd ‘𝐵))) → (∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
28	27	anassrs 400	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝑧 ∈ (2^nd ‘𝐵)) → (∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
29	28	rexbidva 2487	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∃𝑧 ∈ (2^nd ‘𝐵)∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑧 ∈ (2^nd ‘𝐵)∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧)))
30		rexcom 2654	. . . . 5 ⊢ (∃𝑧 ∈ (2^nd ‘𝐵)∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑦 ·_Q 𝑧) ↔ ∃𝑦 ∈ (2^nd ‘𝐴)∃𝑧 ∈ (2^nd ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧))
31	29, 30	bitrdi 196	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∃𝑧 ∈ (2^nd ‘𝐵)∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦) ↔ ∃𝑦 ∈ (2^nd ‘𝐴)∃𝑧 ∈ (2^nd ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧)))
32	31	rabbidv 2741	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → {𝑥 ∈ Q ∣ ∃𝑧 ∈ (2^nd ‘𝐵)∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦)} = {𝑥 ∈ Q ∣ ∃𝑦 ∈ (2^nd ‘𝐴)∃𝑧 ∈ (2^nd ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧)})
33	18, 32	opeq12d 3801	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ⟨{𝑥 ∈ Q ∣ ∃𝑧 ∈ (1^st ‘𝐵)∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦)}, {𝑥 ∈ Q ∣ ∃𝑧 ∈ (2^nd ‘𝐵)∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦)}⟩ = ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ (1^st ‘𝐴)∃𝑧 ∈ (1^st ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧)}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ (2^nd ‘𝐴)∃𝑧 ∈ (2^nd ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧)}⟩)
34		mpvlu 7558	. . 3 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵 ·_P 𝐴) = ⟨{𝑥 ∈ Q ∣ ∃𝑧 ∈ (1^st ‘𝐵)∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦)}, {𝑥 ∈ Q ∣ ∃𝑧 ∈ (2^nd ‘𝐵)∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦)}⟩)
35	34	ancoms 268	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐵 ·_P 𝐴) = ⟨{𝑥 ∈ Q ∣ ∃𝑧 ∈ (1^st ‘𝐵)∃𝑦 ∈ (1^st ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦)}, {𝑥 ∈ Q ∣ ∃𝑧 ∈ (2^nd ‘𝐵)∃𝑦 ∈ (2^nd ‘𝐴)𝑥 = (𝑧 ·_Q 𝑦)}⟩)
36		mpvlu 7558	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·_P 𝐵) = ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ (1^st ‘𝐴)∃𝑧 ∈ (1^st ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧)}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ (2^nd ‘𝐴)∃𝑧 ∈ (2^nd ‘𝐵)𝑥 = (𝑦 ·_Q 𝑧)}⟩)
37	33, 35, 36	3eqtr4rd 2233	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·_P 𝐵) = (𝐵 ·_P 𝐴))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2160 ∃wrex 2469 {crab 2472 ⟨cop 3610 ‘cfv 5232 (class class class)co 5892 1^st c1st 6158 2^nd c2nd 6159 Qcnq 7299 ·_Q cmq 7302 Pcnp 7310 ·_P cmp 7313

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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4189 ax-pr 4224 ax-un 4448 ax-setind 4551 ax-iinf 4602

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-id 4308 df-iord 4381 df-on 4383 df-suc 4386 df-iom 4605 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-rn 4652 df-res 4653 df-ima 4654 df-iota 5193 df-fun 5234 df-fn 5235 df-f 5236 df-f1 5237 df-fo 5238 df-f1o 5239 df-fv 5240 df-ov 5895 df-oprab 5896 df-mpo 5897 df-1st 6160 df-2nd 6161 df-recs 6325 df-irdg 6390 df-oadd 6440 df-omul 6441 df-er 6554 df-ec 6556 df-qs 6560 df-ni 7323 df-mi 7325 df-mpq 7364 df-enq 7366 df-nqqs 7367 df-mqqs 7369 df-inp 7485 df-imp 7488

This theorem is referenced by: ltmprr 7661 mulcmpblnrlemg 7759 mulcomsrg 7776 mulasssrg 7777 m1m1sr 7780 recexgt0sr 7792 mulgt0sr 7797 mulextsr1lem 7799 recidpirqlemcalc 7876

W3C validator