Theorem f1otrgitv 26169

Description: Convenient lemma for f1otrg 26170. (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-1-onto→𝑃)
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 3181	. 2 ⊢ (𝜑 → ∀𝑒 ∈ 𝐵 ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))))
3		f1otrgitv.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
4		f1otrgitv.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
5		f1otrgitv.z	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
6		oveq1 6912	. . . . . 6 ⊢ (𝑒 = 𝑋 → (𝑒𝐽𝑓) = (𝑋𝐽𝑓))
7	6	eleq2d 2892	. . . . 5 ⊢ (𝑒 = 𝑋 → (𝑔 ∈ (𝑒𝐽𝑓) ↔ 𝑔 ∈ (𝑋𝐽𝑓)))
8		fveq2 6433	. . . . . . 7 ⊢ (𝑒 = 𝑋 → (𝐹‘𝑒) = (𝐹‘𝑋))
9	8	oveq1d 6920	. . . . . 6 ⊢ (𝑒 = 𝑋 → ((𝐹‘𝑒)𝐼(𝐹‘𝑓)) = ((𝐹‘𝑋)𝐼(𝐹‘𝑓)))
10	9	eleq2d 2892	. . . . 5 ⊢ (𝑒 = 𝑋 → ((𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓)) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑓))))
11	7, 10	bibi12d 337	. . . 4 ⊢ (𝑒 = 𝑋 → ((𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))) ↔ (𝑔 ∈ (𝑋𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑓)))))
12		oveq2 6913	. . . . . 6 ⊢ (𝑓 = 𝑌 → (𝑋𝐽𝑓) = (𝑋𝐽𝑌))
13	12	eleq2d 2892	. . . . 5 ⊢ (𝑓 = 𝑌 → (𝑔 ∈ (𝑋𝐽𝑓) ↔ 𝑔 ∈ (𝑋𝐽𝑌)))
14		fveq2 6433	. . . . . . 7 ⊢ (𝑓 = 𝑌 → (𝐹‘𝑓) = (𝐹‘𝑌))
15	14	oveq2d 6921	. . . . . 6 ⊢ (𝑓 = 𝑌 → ((𝐹‘𝑋)𝐼(𝐹‘𝑓)) = ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))
16	15	eleq2d 2892	. . . . 5 ⊢ (𝑓 = 𝑌 → ((𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑓)) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))))
17	13, 16	bibi12d 337	. . . 4 ⊢ (𝑓 = 𝑌 → ((𝑔 ∈ (𝑋𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑓))) ↔ (𝑔 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))))
18		eleq1 2894	. . . . 5 ⊢ (𝑔 = 𝑍 → (𝑔 ∈ (𝑋𝐽𝑌) ↔ 𝑍 ∈ (𝑋𝐽𝑌)))
19		fveq2 6433	. . . . . 6 ⊢ (𝑔 = 𝑍 → (𝐹‘𝑔) = (𝐹‘𝑍))
20	19	eleq1d 2891	. . . . 5 ⊢ (𝑔 = 𝑍 → ((𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))))
21	18, 20	bibi12d 337	. . . 4 ⊢ (𝑔 = 𝑍 → ((𝑔 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))) ↔ (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))))
22	11, 17, 21	rspc3v 3542	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (∀𝑒 ∈ 𝐵 ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))) → (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))))
23	3, 4, 5, 22	syl3anc 1496	. 2 ⊢ (𝜑 → (∀𝑒 ∈ 𝐵 ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑔 ∈ (𝑒𝐽𝑓) ↔ (𝐹‘𝑔) ∈ ((𝐹‘𝑒)𝐼(𝐹‘𝑓))) → (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌)))))
24	2, 23	mpd 15	1 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐽𝑌) ↔ (𝐹‘𝑍) ∈ ((𝐹‘𝑋)𝐼(𝐹‘𝑌))))

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386   ∧ w3a 1113   = wceq 1658   ∈ wcel 2166  ∀wral 3117  –1-1-onto→wf1o 6122  ‘cfv 6123  (class class class)co 6905  Basecbs 16222  distcds 16314  Itvcitv 25748

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ral 3122  df-rex 3123  df-rab 3126  df-v 3416  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4145  df-if 4307  df-sn 4398  df-pr 4400  df-op 4404  df-uni 4659  df-br 4874  df-iota 6086  df-fv 6131  df-ov 6908

This theorem is referenced by:  f1otrg  26170  f1otrge  26171