Theorem marypha2lem3 9477

Description: Lemma for marypha2 9479. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)

Hypothesis

Ref	Expression
marypha2lem.t	⊢ 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))

Assertion

Ref	Expression
marypha2lem3	⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐺 ⊆ 𝑇 ↔ ∀𝑥 ∈ 𝐴 (𝐺‘𝑥) ∈ (𝐹‘𝑥)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺

Allowed substitution hint:   𝑇(𝑥)

Proof of Theorem marypha2lem3

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dffn5 6967	. . . . . . 7 ⊢ (𝐺 Fn 𝐴 ↔ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)))
2	1	biimpi 216	. . . . . 6 ⊢ (𝐺 Fn 𝐴 → 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)))
3	2	adantl 481	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)))
4		df-mpt 5226	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))}
5	3, 4	eqtrdi 2793	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → 𝐺 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))})
6		marypha2lem.t	. . . . . 6 ⊢ 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))
7	6	marypha2lem2 9476	. . . . 5 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
8	7	a1i 11	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))})
9	5, 8	sseq12d 4017	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐺 ⊆ 𝑇 ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}))
10		ssopab2bw 5552	. . 3 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥))} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))} ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))))
11	9, 10	bitrdi 287	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐺 ⊆ 𝑇 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))))
12		19.21v 1939	. . . . 5 ⊢ (∀𝑦(𝑥 ∈ 𝐴 → (𝑦 = (𝐺‘𝑥) → 𝑦 ∈ (𝐹‘𝑥))) ↔ (𝑥 ∈ 𝐴 → ∀𝑦(𝑦 = (𝐺‘𝑥) → 𝑦 ∈ (𝐹‘𝑥))))
13		imdistan 567	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → (𝑦 = (𝐺‘𝑥) → 𝑦 ∈ (𝐹‘𝑥))) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))))
14	13	albii 1819	. . . . 5 ⊢ (∀𝑦(𝑥 ∈ 𝐴 → (𝑦 = (𝐺‘𝑥) → 𝑦 ∈ (𝐹‘𝑥))) ↔ ∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))))
15		fvex 6919	. . . . . . 7 ⊢ (𝐺‘𝑥) ∈ V
16		eleq1 2829	. . . . . . 7 ⊢ (𝑦 = (𝐺‘𝑥) → (𝑦 ∈ (𝐹‘𝑥) ↔ (𝐺‘𝑥) ∈ (𝐹‘𝑥)))
17	15, 16	ceqsalv 3521	. . . . . 6 ⊢ (∀𝑦(𝑦 = (𝐺‘𝑥) → 𝑦 ∈ (𝐹‘𝑥)) ↔ (𝐺‘𝑥) ∈ (𝐹‘𝑥))
18	17	imbi2i 336	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 → ∀𝑦(𝑦 = (𝐺‘𝑥) → 𝑦 ∈ (𝐹‘𝑥))) ↔ (𝑥 ∈ 𝐴 → (𝐺‘𝑥) ∈ (𝐹‘𝑥)))
19	12, 14, 18	3bitr3i 301	. . . 4 ⊢ (∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))) ↔ (𝑥 ∈ 𝐴 → (𝐺‘𝑥) ∈ (𝐹‘𝑥)))
20	19	albii 1819	. . 3 ⊢ (∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝐺‘𝑥) ∈ (𝐹‘𝑥)))
21		df-ral 3062	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝐺‘𝑥) ∈ (𝐹‘𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝐺‘𝑥) ∈ (𝐹‘𝑥)))
22	20, 21	bitr4i 278	. 2 ⊢ (∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐺‘𝑥)) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))) ↔ ∀𝑥 ∈ 𝐴 (𝐺‘𝑥) ∈ (𝐹‘𝑥))
23	11, 22	bitrdi 287	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐺 ⊆ 𝑇 ↔ ∀𝑥 ∈ 𝐴 (𝐺‘𝑥) ∈ (𝐹‘𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1538   = wceq 1540   ∈ wcel 2108  ∀wral 3061   ⊆ wss 3951  {csn 4626  ∪ ciun 4991  {copab 5205   ↦ cmpt 5225   × cxp 5683   Fn wfn 6556  ‘cfv 6561

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-iota 6514  df-fun 6563  df-fn 6564  df-fv 6569

This theorem is referenced by:  marypha2  9479