Theorem istrnN 40603

Description: The predicate "is a translation". (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
trnset.a	⊢ 𝐴 = (Atoms‘𝐾)
trnset.s	⊢ 𝑆 = (PSubSp‘𝐾)
trnset.p	⊢ + = (+𝑃‘𝐾)
trnset.o	⊢ ⊥ = (⊥𝑃‘𝐾)
trnset.w	⊢ 𝑊 = (WAtoms‘𝐾)
trnset.m	⊢ 𝑀 = (PAut‘𝐾)
trnset.l	⊢ 𝐿 = (Dil‘𝐾)
trnset.t	⊢ 𝑇 = (Trn‘𝐾)

Assertion

Ref	Expression
istrnN	⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝑇‘𝐷) ↔ (𝐹 ∈ (𝐿‘𝐷) ∧ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷})))))

Distinct variable groups:   𝑟,𝑞,𝐾   𝑊,𝑞,𝑟   𝐷,𝑞,𝑟   𝐹,𝑞,𝑟

Allowed substitution hints:   𝐴(𝑟,𝑞)   𝐵(𝑟,𝑞)   + (𝑟,𝑞)   𝑆(𝑟,𝑞)   𝑇(𝑟,𝑞)   𝐿(𝑟,𝑞)   𝑀(𝑟,𝑞)   ⊥ (𝑟,𝑞)

Proof of Theorem istrnN

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		trnset.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
2		trnset.s	. . . 4 ⊢ 𝑆 = (PSubSp‘𝐾)
3		trnset.p	. . . 4 ⊢ + = (+𝑃‘𝐾)
4		trnset.o	. . . 4 ⊢ ⊥ = (⊥𝑃‘𝐾)
5		trnset.w	. . . 4 ⊢ 𝑊 = (WAtoms‘𝐾)
6		trnset.m	. . . 4 ⊢ 𝑀 = (PAut‘𝐾)
7		trnset.l	. . . 4 ⊢ 𝐿 = (Dil‘𝐾)
8		trnset.t	. . . 4 ⊢ 𝑇 = (Trn‘𝐾)
9	1, 2, 3, 4, 5, 6, 7, 8	trnsetN 40602	. . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝑇‘𝐷) = {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))})
10	9	eleq2d 2822	. 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝑇‘𝐷) ↔ 𝐹 ∈ {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))}))
11		fveq1 6839	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑞) = (𝐹‘𝑞))
12	11	oveq2d 7383	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑞 + (𝑓‘𝑞)) = (𝑞 + (𝐹‘𝑞)))
13	12	ineq1d 4159	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})))
14		fveq1 6839	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑟) = (𝐹‘𝑟))
15	14	oveq2d 7383	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑟 + (𝑓‘𝑟)) = (𝑟 + (𝐹‘𝑟)))
16	15	ineq1d 4159	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷})))
17	13, 16	eqeq12d 2752	. . . 4 ⊢ (𝑓 = 𝐹 → (((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) ↔ ((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
18	17	2ralbidv 3201	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) ↔ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
19	18	elrab 3634	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))} ↔ (𝐹 ∈ (𝐿‘𝐷) ∧ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
20	10, 19	bitrdi 287	1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝑇‘𝐷) ↔ (𝐹 ∈ (𝐿‘𝐷) ∧ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷})))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3051  {crab 3389   ∩ cin 3888  {csn 4567  ‘cfv 6498  (class class class)co 7367  Atomscatm 39709  PSubSpcpsubsp 39942  +_𝑃cpadd 40241  ⊥_𝑃cpolN 40348  WAtomscwpointsN 40432  PAutcpautN 40433  DilcdilN 40548  TrnctrnN 40549

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-trnN 40553

This theorem is referenced by: (None)