Theorem 2arwcatlem4 51067

Description: Lemma for 2arwcat 51069. (Contributed by Zhi Wang, 5-Nov-2025.)

Hypotheses

Ref	Expression
2arwcatlem2.a	⊢ (𝜑 → 𝐴 = 𝑋)
2arwcatlem2.b	⊢ (𝜑 → 𝐵 = 𝑌)
2arwcatlem2.c	⊢ (𝜑 → 𝐶 = 𝑍)
2arwcatlem2.f	⊢ (𝜑 → (𝐹 = 0 ∨ 𝐹 = 1 ))
2arwcatlem2.1	⊢ (𝜑 → ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ) = 1 )
2arwcatlem3.0	⊢ (𝜑 → ( 0 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ) = 0 )
2arwcatlem4.0	⊢ (𝜑 → ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ) = 0 )
2arwcatlem4.00	⊢ (𝜑 → ( 0 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ) ∈ { 0 , 1 })
2arwcatlem4.g	⊢ (𝜑 → (𝐺 = 0 ∨ 𝐺 = 1 ))

Assertion

Ref	Expression
2arwcatlem4	⊢ (𝜑 → (𝐺(⟨𝐴, 𝐵⟩ · 𝐶)𝐹) ∈ { 0 , 1 })

Proof of Theorem 2arwcatlem4

Step	Hyp	Ref	Expression
1		2arwcatlem2.a	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝑋)
2		2arwcatlem2.b	. . . . 5 ⊢ (𝜑 → 𝐵 = 𝑌)
3	1, 2	opeq12d 4853	. . . 4 ⊢ (𝜑 → ⟨𝐴, 𝐵⟩ = ⟨𝑋, 𝑌⟩)
4		2arwcatlem2.c	. . . 4 ⊢ (𝜑 → 𝐶 = 𝑍)
5	3, 4	oveq12d 7469	. . 3 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ · 𝐶) = (⟨𝑋, 𝑌⟩ · 𝑍))
6	5	oveqd 7468	. 2 ⊢ (𝜑 → (𝐺(⟨𝐴, 𝐵⟩ · 𝐶)𝐹) = (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹))
7		simpr 490	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 0 ) → 𝐺 = 0 )
8		simplr 781	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 0 ) → 𝐹 = 0 )
9	7, 8	oveq12d 7469	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 0 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = ( 0 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ))
10		2arwcatlem4.00	. . . . . 6 ⊢ (𝜑 → ( 0 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ) ∈ { 0 , 1 })
11	10	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 0 ) → ( 0 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ) ∈ { 0 , 1 })
12	9, 11	eqeltrd 2864	. . . 4 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 0 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ { 0 , 1 })
13		simpr 490	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 1 ) → 𝐺 = 1 )
14		simplr 781	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 1 ) → 𝐹 = 0 )
15	13, 14	oveq12d 7469	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 1 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ))
16		2arwcatlem4.0	. . . . . . 7 ⊢ (𝜑 → ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ) = 0 )
17	16	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 1 ) → ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ) = 0 )
18	15, 17	eqtrd 2798	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 1 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = 0 )
19		ovex 7484	. . . . . . . 8 ⊢ ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 0 ) ∈ V
20	16, 19	eqeltrrdi 2873	. . . . . . 7 ⊢ (𝜑 → 0 ∈ V)
21		prid1g 4723	. . . . . . 7 ⊢ ( 0 ∈ V → 0 ∈ { 0 , 1 })
22	20, 21	syl 18	. . . . . 6 ⊢ (𝜑 → 0 ∈ { 0 , 1 })
23	22	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 1 ) → 0 ∈ { 0 , 1 })
24	18, 23	eqeltrd 2864	. . . 4 ⊢ (((𝜑 ∧ 𝐹 = 0 ) ∧ 𝐺 = 1 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ { 0 , 1 })
25		2arwcatlem4.g	. . . . 5 ⊢ (𝜑 → (𝐺 = 0 ∨ 𝐺 = 1 ))
26	25	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐹 = 0 ) → (𝐺 = 0 ∨ 𝐺 = 1 ))
27	12, 24, 26	mpjaodan 973	. . 3 ⊢ ((𝜑 ∧ 𝐹 = 0 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ { 0 , 1 })
28		simpr 490	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 0 ) → 𝐺 = 0 )
29		simplr 781	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 0 ) → 𝐹 = 1 )
30	28, 29	oveq12d 7469	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 0 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = ( 0 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ))
31		2arwcatlem3.0	. . . . . . 7 ⊢ (𝜑 → ( 0 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ) = 0 )
32	31	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 0 ) → ( 0 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ) = 0 )
33	30, 32	eqtrd 2798	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 0 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = 0 )
34	22	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 0 ) → 0 ∈ { 0 , 1 })
35	33, 34	eqeltrd 2864	. . . 4 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 0 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ { 0 , 1 })
36		simpr 490	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 1 ) → 𝐺 = 1 )
37		simplr 781	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 1 ) → 𝐹 = 1 )
38	36, 37	oveq12d 7469	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 1 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ))
39		2arwcatlem2.1	. . . . . . 7 ⊢ (𝜑 → ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ) = 1 )
40	39	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 1 ) → ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ) = 1 )
41	38, 40	eqtrd 2798	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 1 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) = 1 )
42		ovex 7484	. . . . . . . 8 ⊢ ( 1 (⟨𝑋, 𝑌⟩ · 𝑍) 1 ) ∈ V
43	39, 42	eqeltrrdi 2873	. . . . . . 7 ⊢ (𝜑 → 1 ∈ V)
44		prid2g 4724	. . . . . . 7 ⊢ ( 1 ∈ V → 1 ∈ { 0 , 1 })
45	43, 44	syl 18	. . . . . 6 ⊢ (𝜑 → 1 ∈ { 0 , 1 })
46	45	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 1 ) → 1 ∈ { 0 , 1 })
47	41, 46	eqeltrd 2864	. . . 4 ⊢ (((𝜑 ∧ 𝐹 = 1 ) ∧ 𝐺 = 1 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ { 0 , 1 })
48	25	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐹 = 1 ) → (𝐺 = 0 ∨ 𝐺 = 1 ))
49	35, 47, 48	mpjaodan 973	. . 3 ⊢ ((𝜑 ∧ 𝐹 = 1 ) → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ { 0 , 1 })
50		2arwcatlem2.f	. . 3 ⊢ (𝜑 → (𝐹 = 0 ∨ 𝐹 = 1 ))
51	27, 49, 50	mpjaodan 973	. 2 ⊢ (𝜑 → (𝐺(⟨𝑋, 𝑌⟩ · 𝑍)𝐹) ∈ { 0 , 1 })
52	6, 51	eqeltrd 2864	1 ⊢ (𝜑 → (𝐺(⟨𝐴, 𝐵⟩ · 𝐶)𝐹) ∈ { 0 , 1 })

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {cpr 4590  ⟨cop 4840  (class class class)co 7451

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-ext 2735  ax-nul 5266

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454

This theorem is used by:  2arwcat  51069