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

Theorem eqger 14029
Description: The subgroup coset equivalence relation is an equivalence relation. (Contributed by Mario Carneiro, 13-Jan-2015.)
Hypotheses
Ref Expression
eqger.x 𝑋 = (Base‘𝐺)
eqger.r = (𝐺 ~QG 𝑌)
Assertion
Ref Expression
eqger (𝑌 ∈ (SubGrp‘𝐺) → Er 𝑋)

Proof of Theorem eqger
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 subgrcl 13984 . . 3 (𝑌 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
2 eqger.r . . . 4 = (𝐺 ~QG 𝑌)
32releqgg 14025 . . 3 ((𝐺 ∈ Grp ∧ 𝑌 ∈ (SubGrp‘𝐺)) → Rel )
41, 3mpancom 426 . 2 (𝑌 ∈ (SubGrp‘𝐺) → Rel )
5 eqger.x . . . . . . 7 𝑋 = (Base‘𝐺)
65subgss 13979 . . . . . 6 (𝑌 ∈ (SubGrp‘𝐺) → 𝑌𝑋)
7 eqid 2238 . . . . . . 7 (invg𝐺) = (invg𝐺)
8 eqid 2238 . . . . . . 7 (+g𝐺) = (+g𝐺)
95, 7, 8, 2eqgval 14028 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑌𝑋) → (𝑥 𝑦 ↔ (𝑥𝑋𝑦𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑦) ∈ 𝑌)))
101, 6, 9syl2anc 415 . . . . 5 (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 𝑦 ↔ (𝑥𝑋𝑦𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑦) ∈ 𝑌)))
1110biimpa 296 . . . 4 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → (𝑥𝑋𝑦𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑦) ∈ 𝑌))
1211simp2d 1041 . . 3 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → 𝑦𝑋)
1311simp1d 1040 . . 3 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → 𝑥𝑋)
141adantr 276 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → 𝐺 ∈ Grp)
155, 7grpinvcl 13855 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥𝑋) → ((invg𝐺)‘𝑥) ∈ 𝑋)
1614, 13, 15syl2anc 415 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → ((invg𝐺)‘𝑥) ∈ 𝑋)
175, 8, 7grpinvadd 13885 . . . . . 6 ((𝐺 ∈ Grp ∧ ((invg𝐺)‘𝑥) ∈ 𝑋𝑦𝑋) → ((invg𝐺)‘(((invg𝐺)‘𝑥)(+g𝐺)𝑦)) = (((invg𝐺)‘𝑦)(+g𝐺)((invg𝐺)‘((invg𝐺)‘𝑥))))
1814, 16, 12, 17syl3anc 1278 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → ((invg𝐺)‘(((invg𝐺)‘𝑥)(+g𝐺)𝑦)) = (((invg𝐺)‘𝑦)(+g𝐺)((invg𝐺)‘((invg𝐺)‘𝑥))))
195, 7grpinvinv 13874 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥𝑋) → ((invg𝐺)‘((invg𝐺)‘𝑥)) = 𝑥)
2014, 13, 19syl2anc 415 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → ((invg𝐺)‘((invg𝐺)‘𝑥)) = 𝑥)
2120oveq2d 6101 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → (((invg𝐺)‘𝑦)(+g𝐺)((invg𝐺)‘((invg𝐺)‘𝑥))) = (((invg𝐺)‘𝑦)(+g𝐺)𝑥))
2218, 21eqtrd 2271 . . . 4 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → ((invg𝐺)‘(((invg𝐺)‘𝑥)(+g𝐺)𝑦)) = (((invg𝐺)‘𝑦)(+g𝐺)𝑥))
2311simp3d 1042 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → (((invg𝐺)‘𝑥)(+g𝐺)𝑦) ∈ 𝑌)
247subginvcl 13988 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑦) ∈ 𝑌) → ((invg𝐺)‘(((invg𝐺)‘𝑥)(+g𝐺)𝑦)) ∈ 𝑌)
2523, 24syldan 282 . . . 4 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → ((invg𝐺)‘(((invg𝐺)‘𝑥)(+g𝐺)𝑦)) ∈ 𝑌)
2622, 25eqeltrrd 2316 . . 3 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → (((invg𝐺)‘𝑦)(+g𝐺)𝑥) ∈ 𝑌)
276adantr 276 . . . 4 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → 𝑌𝑋)
285, 7, 8, 2eqgval 14028 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝑋) → (𝑦 𝑥 ↔ (𝑦𝑋𝑥𝑋 ∧ (((invg𝐺)‘𝑦)(+g𝐺)𝑥) ∈ 𝑌)))
2914, 27, 28syl2anc 415 . . 3 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → (𝑦 𝑥 ↔ (𝑦𝑋𝑥𝑋 ∧ (((invg𝐺)‘𝑦)(+g𝐺)𝑥) ∈ 𝑌)))
3012, 13, 26, 29mpbir3and 1211 . 2 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 𝑦) → 𝑦 𝑥)
3113adantrr 483 . . 3 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → 𝑥𝑋)
325, 7, 8, 2eqgval 14028 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑌𝑋) → (𝑦 𝑧 ↔ (𝑦𝑋𝑧𝑋 ∧ (((invg𝐺)‘𝑦)(+g𝐺)𝑧) ∈ 𝑌)))
331, 6, 32syl2anc 415 . . . . . 6 (𝑌 ∈ (SubGrp‘𝐺) → (𝑦 𝑧 ↔ (𝑦𝑋𝑧𝑋 ∧ (((invg𝐺)‘𝑦)(+g𝐺)𝑧) ∈ 𝑌)))
3433biimpa 296 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑦 𝑧) → (𝑦𝑋𝑧𝑋 ∧ (((invg𝐺)‘𝑦)(+g𝐺)𝑧) ∈ 𝑌))
3534adantrl 482 . . . 4 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (𝑦𝑋𝑧𝑋 ∧ (((invg𝐺)‘𝑦)(+g𝐺)𝑧) ∈ 𝑌))
3635simp2d 1041 . . 3 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → 𝑧𝑋)
371adantr 276 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → 𝐺 ∈ Grp)
3837, 31, 15syl2anc 415 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → ((invg𝐺)‘𝑥) ∈ 𝑋)
3912adantrr 483 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → 𝑦𝑋)
405, 7grpinvcl 13855 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑦𝑋) → ((invg𝐺)‘𝑦) ∈ 𝑋)
4137, 39, 40syl2anc 415 . . . . . . 7 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → ((invg𝐺)‘𝑦) ∈ 𝑋)
425, 8, 37, 41, 36grpcld 13821 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (((invg𝐺)‘𝑦)(+g𝐺)𝑧) ∈ 𝑋)
435, 8grpass 13816 . . . . . 6 ((𝐺 ∈ Grp ∧ (((invg𝐺)‘𝑥) ∈ 𝑋𝑦𝑋 ∧ (((invg𝐺)‘𝑦)(+g𝐺)𝑧) ∈ 𝑋)) → ((((invg𝐺)‘𝑥)(+g𝐺)𝑦)(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧)) = (((invg𝐺)‘𝑥)(+g𝐺)(𝑦(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧))))
4437, 38, 39, 42, 43syl13anc 1280 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → ((((invg𝐺)‘𝑥)(+g𝐺)𝑦)(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧)) = (((invg𝐺)‘𝑥)(+g𝐺)(𝑦(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧))))
45 eqid 2238 . . . . . . . . . 10 (0g𝐺) = (0g𝐺)
465, 8, 45, 7grprinv 13858 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑦𝑋) → (𝑦(+g𝐺)((invg𝐺)‘𝑦)) = (0g𝐺))
4737, 39, 46syl2anc 415 . . . . . . . 8 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (𝑦(+g𝐺)((invg𝐺)‘𝑦)) = (0g𝐺))
4847oveq1d 6100 . . . . . . 7 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → ((𝑦(+g𝐺)((invg𝐺)‘𝑦))(+g𝐺)𝑧) = ((0g𝐺)(+g𝐺)𝑧))
495, 8grpass 13816 . . . . . . . 8 ((𝐺 ∈ Grp ∧ (𝑦𝑋 ∧ ((invg𝐺)‘𝑦) ∈ 𝑋𝑧𝑋)) → ((𝑦(+g𝐺)((invg𝐺)‘𝑦))(+g𝐺)𝑧) = (𝑦(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧)))
5037, 39, 41, 36, 49syl13anc 1280 . . . . . . 7 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → ((𝑦(+g𝐺)((invg𝐺)‘𝑦))(+g𝐺)𝑧) = (𝑦(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧)))
515, 8, 45grplid 13838 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → ((0g𝐺)(+g𝐺)𝑧) = 𝑧)
5237, 36, 51syl2anc 415 . . . . . . 7 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → ((0g𝐺)(+g𝐺)𝑧) = 𝑧)
5348, 50, 523eqtr3d 2279 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (𝑦(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧)) = 𝑧)
5453oveq2d 6101 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (((invg𝐺)‘𝑥)(+g𝐺)(𝑦(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧))) = (((invg𝐺)‘𝑥)(+g𝐺)𝑧))
5544, 54eqtrd 2271 . . . 4 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → ((((invg𝐺)‘𝑥)(+g𝐺)𝑦)(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧)) = (((invg𝐺)‘𝑥)(+g𝐺)𝑧))
56 simpl 109 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → 𝑌 ∈ (SubGrp‘𝐺))
5723adantrr 483 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (((invg𝐺)‘𝑥)(+g𝐺)𝑦) ∈ 𝑌)
5835simp3d 1042 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (((invg𝐺)‘𝑦)(+g𝐺)𝑧) ∈ 𝑌)
598subgcl 13989 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑦) ∈ 𝑌 ∧ (((invg𝐺)‘𝑦)(+g𝐺)𝑧) ∈ 𝑌) → ((((invg𝐺)‘𝑥)(+g𝐺)𝑦)(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧)) ∈ 𝑌)
6056, 57, 58, 59syl3anc 1278 . . . 4 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → ((((invg𝐺)‘𝑥)(+g𝐺)𝑦)(+g𝐺)(((invg𝐺)‘𝑦)(+g𝐺)𝑧)) ∈ 𝑌)
6155, 60eqeltrrd 2316 . . 3 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (((invg𝐺)‘𝑥)(+g𝐺)𝑧) ∈ 𝑌)
626adantr 276 . . . 4 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → 𝑌𝑋)
635, 7, 8, 2eqgval 14028 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝑋) → (𝑥 𝑧 ↔ (𝑥𝑋𝑧𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑧) ∈ 𝑌)))
6437, 62, 63syl2anc 415 . . 3 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → (𝑥 𝑧 ↔ (𝑥𝑋𝑧𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑧) ∈ 𝑌)))
6531, 36, 61, 64mpbir3and 1211 . 2 ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 𝑦𝑦 𝑧)) → 𝑥 𝑧)
665, 8, 45, 7grplinv 13857 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥𝑋) → (((invg𝐺)‘𝑥)(+g𝐺)𝑥) = (0g𝐺))
671, 66sylan 283 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥𝑋) → (((invg𝐺)‘𝑥)(+g𝐺)𝑥) = (0g𝐺))
6845subg0cl 13987 . . . . . . 7 (𝑌 ∈ (SubGrp‘𝐺) → (0g𝐺) ∈ 𝑌)
6968adantr 276 . . . . . 6 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥𝑋) → (0g𝐺) ∈ 𝑌)
7067, 69eqeltrd 2315 . . . . 5 ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥𝑋) → (((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌)
7170ex 115 . . . 4 (𝑌 ∈ (SubGrp‘𝐺) → (𝑥𝑋 → (((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌))
7271pm4.71rd 398 . . 3 (𝑌 ∈ (SubGrp‘𝐺) → (𝑥𝑋 ↔ ((((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌𝑥𝑋)))
735, 7, 8, 2eqgval 14028 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑌𝑋) → (𝑥 𝑥 ↔ (𝑥𝑋𝑥𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌)))
741, 6, 73syl2anc 415 . . . 4 (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 𝑥 ↔ (𝑥𝑋𝑥𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌)))
75 df-3an 1011 . . . . 5 ((𝑥𝑋𝑥𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌) ↔ ((𝑥𝑋𝑥𝑋) ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌))
76 anidm 400 . . . . . 6 ((𝑥𝑋𝑥𝑋) ↔ 𝑥𝑋)
7776anbi2ci 463 . . . . 5 (((𝑥𝑋𝑥𝑋) ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌) ↔ ((((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌𝑥𝑋))
7875, 77bitri 184 . . . 4 ((𝑥𝑋𝑥𝑋 ∧ (((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌) ↔ ((((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌𝑥𝑋))
7974, 78bitrdi 196 . . 3 (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 𝑥 ↔ ((((invg𝐺)‘𝑥)(+g𝐺)𝑥) ∈ 𝑌𝑥𝑋)))
8072, 79bitr4d 191 . 2 (𝑌 ∈ (SubGrp‘𝐺) → (𝑥𝑋𝑥 𝑥))
814, 30, 65, 80iserd 6833 1 (𝑌 ∈ (SubGrp‘𝐺) → Er 𝑋)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105  w3a 1009   = wceq 1402  wcel 2209  wss 3220   class class class wbr 4130  Rel wrel 4779  cfv 5377  (class class class)co 6085   Er wer 6804  Basecbs 13354  +gcplusg 13433  0gc0g 13612  Grpcgrp 13807  invgcminusg 13808  SubGrpcsubg 13972   ~QG cqg 13974
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-er 6807  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9306  df-2 9364  df-ndx 13357  df-slot 13358  df-base 13360  df-sets 13361  df-iress 13362  df-plusg 13446  df-0g 13614  df-mgm 13678  df-sgrp 13719  df-mnd 13732  df-grp 13810  df-minusg 13811  df-subg 13975  df-eqg 13977
This theorem is used by:  eqgen  14032  eqg0el  14034  qusgrp  14037  qusadd  14039  qusecsub  14137  2idlcpblrng  14862  qus2idrng  14864  qus1  14865  qusrhm  14867  qusmul2  14868  qusmulrng  14871  zndvds  14986
  Copyright terms: Public domain W3C validator