Theorem symgmatr01lem 22568

Description: Lemma for symgmatr01 22569. (Contributed by AV, 3-Jan-2019.)

Hypothesis

Ref	Expression
symgmatr01.p	⊢ 𝑃 = (Base‘(SymGrp‘𝑁))

Assertion

Ref	Expression
symgmatr01lem	⊢ ((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → ∃𝑘 ∈ 𝑁 if(𝑘 = 𝐾, if((𝑄‘𝑘) = 𝐿, 𝐴, 𝐵), (𝑘𝑀(𝑄‘𝑘))) = 𝐵))

Distinct variable groups:   𝐴,𝑘   𝐵,𝑘   𝑘,𝑞,𝐿   𝑘,𝐾,𝑞   𝑘,𝑀   𝑘,𝑁   𝑃,𝑘,𝑞   𝑄,𝑘,𝑞

Allowed substitution hints:   𝐴(𝑞)   𝐵(𝑞)   𝑀(𝑞)   𝑁(𝑞)

Proof of Theorem symgmatr01lem

Step	Hyp	Ref	Expression
1		simpll 765	. . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → 𝐾 ∈ 𝑁)
2		eqeq1 2729	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑘 = 𝐾 ↔ 𝐾 = 𝐾))
3		fveq2 6890	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (𝑄‘𝑘) = (𝑄‘𝐾))
4	3	eqeq1d 2727	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((𝑄‘𝑘) = 𝐿 ↔ (𝑄‘𝐾) = 𝐿))
5	4	ifbid 4548	. . . . . 6 ⊢ (𝑘 = 𝐾 → if((𝑄‘𝑘) = 𝐿, 𝐴, 𝐵) = if((𝑄‘𝐾) = 𝐿, 𝐴, 𝐵))
6		id 22	. . . . . . 7 ⊢ (𝑘 = 𝐾 → 𝑘 = 𝐾)
7	6, 3	oveq12d 7431	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑘𝑀(𝑄‘𝑘)) = (𝐾𝑀(𝑄‘𝐾)))
8	2, 5, 7	ifbieq12d 4553	. . . . 5 ⊢ (𝑘 = 𝐾 → if(𝑘 = 𝐾, if((𝑄‘𝑘) = 𝐿, 𝐴, 𝐵), (𝑘𝑀(𝑄‘𝑘))) = if(𝐾 = 𝐾, if((𝑄‘𝐾) = 𝐿, 𝐴, 𝐵), (𝐾𝑀(𝑄‘𝐾))))
9	8	eqeq1d 2727	. . . 4 ⊢ (𝑘 = 𝐾 → (if(𝑘 = 𝐾, if((𝑄‘𝑘) = 𝐿, 𝐴, 𝐵), (𝑘𝑀(𝑄‘𝑘))) = 𝐵 ↔ if(𝐾 = 𝐾, if((𝑄‘𝐾) = 𝐿, 𝐴, 𝐵), (𝐾𝑀(𝑄‘𝐾))) = 𝐵))
10	9	adantl 480	. . 3 ⊢ ((((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) ∧ 𝑘 = 𝐾) → (if(𝑘 = 𝐾, if((𝑄‘𝑘) = 𝐿, 𝐴, 𝐵), (𝑘𝑀(𝑄‘𝑘))) = 𝐵 ↔ if(𝐾 = 𝐾, if((𝑄‘𝐾) = 𝐿, 𝐴, 𝐵), (𝐾𝑀(𝑄‘𝐾))) = 𝐵))
11		eqidd 2726	. . . . 5 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → 𝐾 = 𝐾)
12	11	iftrued 4533	. . . 4 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → if(𝐾 = 𝐾, if((𝑄‘𝐾) = 𝐿, 𝐴, 𝐵), (𝐾𝑀(𝑄‘𝐾))) = if((𝑄‘𝐾) = 𝐿, 𝐴, 𝐵))
13		eldif 3951	. . . . . . 7 ⊢ (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) ↔ (𝑄 ∈ 𝑃 ∧ ¬ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}))
14		ianor 979	. . . . . . . . . 10 ⊢ (¬ (𝑄 ∈ 𝑃 ∧ (𝑄‘𝐾) = 𝐿) ↔ (¬ 𝑄 ∈ 𝑃 ∨ ¬ (𝑄‘𝐾) = 𝐿))
15		fveq1 6889	. . . . . . . . . . . 12 ⊢ (𝑞 = 𝑄 → (𝑞‘𝐾) = (𝑄‘𝐾))
16	15	eqeq1d 2727	. . . . . . . . . . 11 ⊢ (𝑞 = 𝑄 → ((𝑞‘𝐾) = 𝐿 ↔ (𝑄‘𝐾) = 𝐿))
17	16	elrab 3676	. . . . . . . . . 10 ⊢ (𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿} ↔ (𝑄 ∈ 𝑃 ∧ (𝑄‘𝐾) = 𝐿))
18	14, 17	xchnxbir 332	. . . . . . . . 9 ⊢ (¬ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿} ↔ (¬ 𝑄 ∈ 𝑃 ∨ ¬ (𝑄‘𝐾) = 𝐿))
19		pm2.21 123	. . . . . . . . . 10 ⊢ (¬ 𝑄 ∈ 𝑃 → (𝑄 ∈ 𝑃 → ¬ (𝑄‘𝐾) = 𝐿))
20		ax-1 6	. . . . . . . . . 10 ⊢ (¬ (𝑄‘𝐾) = 𝐿 → (𝑄 ∈ 𝑃 → ¬ (𝑄‘𝐾) = 𝐿))
21	19, 20	jaoi 855	. . . . . . . . 9 ⊢ ((¬ 𝑄 ∈ 𝑃 ∨ ¬ (𝑄‘𝐾) = 𝐿) → (𝑄 ∈ 𝑃 → ¬ (𝑄‘𝐾) = 𝐿))
22	18, 21	sylbi 216	. . . . . . . 8 ⊢ (¬ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿} → (𝑄 ∈ 𝑃 → ¬ (𝑄‘𝐾) = 𝐿))
23	22	impcom 406	. . . . . . 7 ⊢ ((𝑄 ∈ 𝑃 ∧ ¬ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → ¬ (𝑄‘𝐾) = 𝐿)
24	13, 23	sylbi 216	. . . . . 6 ⊢ (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → ¬ (𝑄‘𝐾) = 𝐿)
25	24	adantl 480	. . . . 5 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → ¬ (𝑄‘𝐾) = 𝐿)
26	25	iffalsed 4536	. . . 4 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → if((𝑄‘𝐾) = 𝐿, 𝐴, 𝐵) = 𝐵)
27	12, 26	eqtrd 2765	. . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → if(𝐾 = 𝐾, if((𝑄‘𝐾) = 𝐿, 𝐴, 𝐵), (𝐾𝑀(𝑄‘𝐾))) = 𝐵)
28	1, 10, 27	rspcedvd 3605	. 2 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → ∃𝑘 ∈ 𝑁 if(𝑘 = 𝐾, if((𝑄‘𝑘) = 𝐿, 𝐴, 𝐵), (𝑘𝑀(𝑄‘𝑘))) = 𝐵)
29	28	ex 411	1 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → ∃𝑘 ∈ 𝑁 if(𝑘 = 𝐾, if((𝑄‘𝑘) = 𝐿, 𝐴, 𝐵), (𝑘𝑀(𝑄‘𝑘))) = 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 394   ∨ wo 845   = wceq 1533   ∈ wcel 2098  ∃wrex 3060  {crab 3419   ∖ cdif 3938  ifcif 4525  ‘cfv 6543  (class class class)co 7413  Basecbs 17174  SymGrpcsymg 19320

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3465  df-dif 3944  df-un 3946  df-ss 3958  df-nul 4320  df-if 4526  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4905  df-br 5145  df-iota 6495  df-fv 6551  df-ov 7416

This theorem is referenced by:  symgmatr01  22569