Theorem f1otrgitv 29480

Description: Convenient lemma for f1otrg 29481. (Contributed by Thierry Arnoux, 19-Mar-2019.)

Hypotheses

Ref	Expression
f1otrkg.p	⊢ 𝑃 = (Base‘𝐺)
f1otrkg.d	⊢ 𝐷 = (dist‘𝐺)
f1otrkg.i	⊢ 𝐼 = (Itv‘𝐺)
f1otrkg.b	⊢ 𝐵 = (Base‘𝐻)
f1otrkg.e	⊢ 𝐸 = (dist‘𝐻)
f1otrkg.j	⊢ 𝐽 = (Itv‘𝐻)
f1otrkg.f	⊢ (𝜑 → 𝐹:𝐵⟶1-1onto𝑃)
f1otrkg.1	⊢ ((𝜑 ∧ (𝑒 ∈ 𝐵 ∧ 𝑓 ∈ 𝐵)) → (𝑒𝐸𝑓) = ((𝐹‘𝑒)𝐷(𝐹‘𝑓)))
f1otrkg.2	⊢ ((𝜑 ∧ (𝑒 ∈ 𝐵 ∧ 𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))))
f1otrgitv.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
f1otrgitv.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
f1otrgitv.z	⊢ (𝜑 → 𝑍 ∈ 𝐵)

Assertion

Ref	Expression
f1otrgitv	⊢ (𝜑 → (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))))

Distinct variable groups:   𝑒,𝑓,𝑔,𝐵   𝐷,𝑒,𝑓   𝑒,𝐸,𝑓   𝑒,𝐹,𝑓,𝑔   𝑒,𝐼,𝑓,𝑔   𝑒,𝐽,𝑓,𝑔   𝑒,𝑋,𝑓,𝑔   𝜑,𝑒,𝑓,𝑔   𝑓,𝑌,𝑔   𝑔,𝑍

Allowed substitution hints:   𝐷(𝑔)   𝑃(𝑒, 𝑓, 𝑔)   𝐸(𝑔)   𝐺(𝑒, 𝑓, 𝑔)   𝐻(𝑒, 𝑓, 𝑔)   𝑌(𝑒)   𝑍(𝑒, 𝑓)

Proof of Theorem f1otrgitv

Step	Hyp	Ref	Expression
1		f1otrkg.2	. . 3 ⊢ ((𝜑 ∧ (𝑒 ∈ 𝐵 ∧ 𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))))
2	1	ralrimivvva 3212	. 2 ⊢ (𝜑 → ∀𝑒 ∈ 𝐵 ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))))
3		f1otrgitv.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
4		f1otrgitv.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
5		f1otrgitv.z	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
6		oveq1 7453	. . . . . 6 ⊢ (𝑒 = 𝑋 → (𝑒𝐽𝑓) = (𝑋𝐽𝑓))
7	6	eleq2d 2850	. . . . 5 ⊢ (𝑒 = 𝑋 → (𝑔 ∈ (𝑒𝐽𝑓) ↔ 𝑔 ∈ (𝑋𝐽𝑓)))
8		fveq2 6911	. . . . . . 7 ⊢ (𝑒 = 𝑋 → (𝐹‘𝑒) = (𝐹‘𝑋))
9	8	oveq1d 7461	. . . . . 6 ⊢ (𝑒 = 𝑋 → ((𝐹‘𝑒)𝐼(𝐹‘𝑓)) = ((𝐹‘𝑋)𝐼(𝐹‘𝑓)))
10	9	eleq2d 2850	. . . . 5 ⊢ (𝑒 = 𝑋 → ((𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓)) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑓))))
11	7, 10	bibi12d 348	. . . 4 ⊢ (𝑒 = 𝑋 → ((𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))) ↔ (𝑔 ∈ (𝑋𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑓)))))
12		oveq2 7454	. . . . . 6 ⊢ (𝑓 = 𝑌 → (𝑋𝐽𝑓) = (𝑋𝐽𝑌))
13	12	eleq2d 2850	. . . . 5 ⊢ (𝑓 = 𝑌 → (𝑔 ∈ (𝑋𝐽𝑓) ↔ 𝑔 ∈ (𝑋𝐽𝑌)))
14		fveq2 6911	. . . . . . 7 ⊢ (𝑓 = 𝑌 → (𝐹‘𝑓) = (𝐹‘𝑌))
15	14	oveq2d 7462	. . . . . 6 ⊢ (𝑓 = 𝑌 → ((𝐹‘𝑋)𝐼(𝐹‘𝑓)) = ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))
16	15	eleq2d 2850	. . . . 5 ⊢ (𝑓 = 𝑌 → ((𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑓)) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))))
17	13, 16	bibi12d 348	. . . 4 ⊢ (𝑓 = 𝑌 → ((𝑔 ∈ (𝑋𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑓))) ↔ (𝑔 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))))
18		eleq1 2852	. . . . 5 ⊢ (𝑔 = 𝑍 → (𝑔 ∈ (𝑋𝐽𝑌) ↔ 𝑍 ∈ (𝑋𝐽𝑌)))
19		fveq2 6911	. . . . . 6 ⊢ (𝑔 = 𝑍 → (𝐹‘𝑔) = (𝐹‘𝑍))
20	19	eleq1d 2849	. . . . 5 ⊢ (𝑔 = 𝑍 → ((𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))))
21	18, 20	bibi12d 348	. . . 4 ⊢ (𝑔 = 𝑍 → ((𝑔 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))) ↔ (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))))
22	11, 17, 21	rspc3v 3595	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (∀𝑒 ∈ 𝐵 ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))) → (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))))
23	3, 4, 5, 22	syl3anc 1399	. 2 ⊢ (𝜑 → (∀𝑒 ∈ 𝐵 ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))) → (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))))
24	2, 23	mpd 16	1 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟶1-1ontowf1o 6560  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  distcds 17469  Itvcitv 28928

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

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-ral 3081  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 4839  df-uni 4871  df-br 5107  df-iota 6515  df-fv 6569  df-ov 7449

This theorem is used by:  f1otrg  29481  f1otrge  29482